OS X El Capitan downloaded form apple claims installation is successful, but new OS is not installed
OS X updater claims installation is successful, but new OS is not installed
Why is it considered a bad practice to omit curly braces? Why does everyone tell me writing code like this is a bad practice?  if (foo)     Bar();  //or  for(int i = 0 i &lt; count; i++)     Bar(i);   My biggest argument for omitting the curly braces is that it can sometimes be twice as many lines with them. For example, here is some code to paint a glow effect for a label in C#.  using (Brush br = new SolidBrush(Color.FromArgb(15, GlowColor))) {     for (int x = 0; x &lt;= GlowAmount; x++)     {         for (int y = 0; y &lt;= GlowAmount; y++)         {             g.DrawString(Text, this.Font, br, new Point(IconOffset + x, y));         }      }  }  //versus using (Brush br = new SolidBrush(Color.FromArgb(15, GlowColor)))     for (int x = 0; x &lt;= GlowAmount; x++)         for (int y = 0; y &lt;= GlowAmount; y++)             g.DrawString(Text, this.Font, br, new Point(IconOffset + x, y));   You can also get the added benefit of chaining usings together without having to indent a million times.  using (Graphics g = Graphics.FromImage(bmp)) {     using (Brush brush = new SolidBrush(backgroundColor))     {         using (Pen pen = new Pen(Color.FromArgb(penColor)))         {             //do lots of work         }     }  } //versus using (Graphics g = Graphics.FromImage(bmp)) using (Brush brush = new SolidBrush(backgroundColor)) using (Pen pen = new Pen(Color.FromArgb(penColor))) {     //do lots of work }     The most common argument for curly braces revolves around maintance programming, and the problems that would ensue by inserting code between the original if statement and its intended result:  if (foo)     Bar();     Biz();     Questions:   Is it wrong to want to use the more compact syntax which the language offers? The people that design these languages are smart, I can't imagine they would put a feature which is always bad to use. Should we or Shouldn't we write code so the lowest common denominator can understand and have no problems working with it?  Is there another argument that I'm missing? I am trying to teleport a player to certain coordinates once they enter an area.  The idea is that they walk into a really small building, but once they turn a corner, they get teleported into a larger building.   Please refer to the adventure map named '5 Cubed', if you need help understanding what I am asking. why arcane legacy steps to boot from USB with GPT and UEFI? To run the live AVG rescue "disk" on USB for Windows 10, how is it made to work with a GPT and UEFI system?  (Possible solution listed below.)  I enabled the boot menu so that pressing F12 will display a list to select from.  Also, I put everything USB at the top of the boot sequence and Windows and the HDD at the bottom.  However, I hadn't realized GPT and UEFI are so different from a BIOS.  Because the USB flash drive isn't compatible with GPT it's not being picked up?  This  was suggested:   Open the notebook and press quickly F2 to enter the BIOS. Under the MAIN menu, enable the F12 Boot Menu option. Under the BOOT menu, select Legacy boot and press F10 Save &amp; Exit. While the notebook is rebooting, press F2 again to enter the BIOS. Under the BOOT menu, select as your first boot option the USB HDD stick (your USB stick). Press F10 Save &amp; Exit.    Perhaps this will work, but what is the problem that prevents UEFI boot from registering the thumb drive?  Because it's using GPT and not an MBR?  I don't want to switch to legacy, but stay with UEFI.  The laptop: Minecraft Survival Mode I am playing Minecraft on survival mode. I can break blocks like sand, dirt, and gravel and it will give me a block. When I try to break stone or iron or anything else, it didn't give me a block. What can I do so that I can get a block? I am on single player and my internet is fine. I tried deleting the app and then getting the app again but that didn't work. This is happening with all my worlds in survival mode. How much does it cost to have a custom ASIC made? If a sequence converges in a metric space, it is Cauchy, and in $\mathbb{R}^k$ every Cauchy sequence converges.   Therefore, in $\mathbb{R}^k$ a sequence converges iff it is Cauchy.  Let $\{s_n\}$ be a sequence in $\mathbb{R}$ where each $s_n=\sum_{k=1}^na_k$. Therefore, by the above, every series converges iff  $$\left | \sum_{k=m}^n a_k\right| &lt;\epsilon$$ For a given $\epsilon &gt;0$ and an integer $N$ such that $N\le m\le n$. If $n=m$ then the statement reduces to:  A series converges if and only if $$|a_n| &lt; \epsilon $$ For a given $\epsilon &gt;0$ and an integer $N$ such that $N\le n$.  This clearly cannot be (e.g Harmonic series). When does the equivalence become an implication. dpkg: error: parsing file '/var/lib/dpkg/updates/0045' near line 0: Recovering Crashed Flash drive? So my friend has a USB flash drive that isn't working. I don't know a whole lot about "recovery" software so I figured I'd ask you guys.  What steps can I try (I have access to a Linux machine as well) to see....if I can get ANYTHING off the flash drive?  I've google'd around, but most of the stuff seems for windows. Why are there non-visible objects in my final render? Have Blender on about 4 machines rendering animations. Just spotted on one of the machines its rendering something different from the actual scene that I have setup.    Top window shows a different set of layers objects to whats actually being rendered in the rendering window below.  In my scene contents, layers objects 1-5 are not visible, but these are the ones that look like they are being rendered.  The only thing I can assume is that perhaps it might be because I did not save the document before clicking render, but I would not have expected that behaviour (you dont need to save your word document before printing it).  Can anyone confirm why this is happening? Rounding integers to nearest multiple of 10 Inspecting standard container (std::map) contents with gdb Supposing to have something like this:  #include &lt;map&gt; int main(){     std::map&lt;int,int&gt; m;     m[1] = 2;     m[2] = 4;     return 0; }   I would like to be able to inspect the contents of the map running the program from gdb. If I try using the subscript operator I get:    (gdb) p m[1] Attempt to take address of value not located in memory.   Using the find method does not yield better results:  (gdb) p m.find(1) Cannot evaluate function -- may be inlined   Is there a way to accomplish this? I can't open google-related sites I'm  getting timeout errors on google-related sites. If I try to open google.com, gmail.com, etc, it will keep displaying the "waiting reply" on the browser bottom, and the page won't open. If I am browsing another site that includes, say, www.google-analytics.com, ajax.googleapis.com, google fonts, etc, then it start loading, displaying a "connecting to [google-related site]" on the browser bottom, and stall at that point for a long time.  I can browse other sites fine and they load quickly. I can ping the domains with 0% loss and &lt;100ms times. I can ping 8.8.8.8, I am not behind a proxy, there is nothing on my hosts file, I am not at work or in a networked environment: it is a home network behind a router. I connect using wifi (I am too distant to use wired).   Other users on the same network don't have the issue. I can both ping and browse the sites. I have pinged ajax.googleapis.com from my android and my other laptop, and they return the same IP than on this laptop. They also share the same external IP address, according to   The issue happens on ubuntu 12.04, and as it is cyclic but not frequent enough to make sure, I don't honestly remember if it happens on Windows 7 as well (it is a dual-boot machine). Rebooting the router won't help. Rebooting the computer fixes the problem, until it happens again.  It's been happening for a few months now. The last time it happened (earlier today) I performed a ping before and after the reboot. Here's the results:  before  $ping ajax.googleapis.com PING googleapis.l.google.com (74.125.21.95) 56(84) bytes of data. 64 bytes from yv-in-f95.1e100.net (74.125.21.95): icmp_req=1 ttl=47 time=157 ms 64 bytes from yv-in-f95.1e100.net (74.125.21.95): icmp_req=2 ttl=47 time=163 ms 64 bytes from yv-in-f95.1e100.net (74.125.21.95): icmp_req=3 ttl=47 time=156 ms 64 bytes from yv-in-f95.1e100.net (74.125.21.95): icmp_req=4 ttl=47 time=165 ms 64 bytes from yv-in-f95.1e100.net (74.125.21.95): icmp_req=5 ttl=47 time=157 ms 64 bytes from yv-in-f95.1e100.net (74.125.21.95): icmp_req=6 ttl=47 time=155 ms 64 bytes from yv-in-f95.1e100.net (74.125.21.95): icmp_req=7 ttl=47 time=159 ms 64 bytes from yv-in-f95.1e100.net (74.125.21.95): icmp_req=8 ttl=47 time=157 ms   after  $ping ajax.googleapis.com PING googleapis.l.google.com (74.125.134.95) 56(84) bytes of data. 64 bytes from gg-in-f95.1e100.net (74.125.134.95): icmp_req=1 ttl=47 time=207 ms 64 bytes from gg-in-f95.1e100.net (74.125.134.95): icmp_req=2 ttl=47 time=154 ms 64 bytes from gg-in-f95.1e100.net (74.125.134.95): icmp_req=3 ttl=47 time=154 ms 64 bytes from gg-in-f95.1e100.net (74.125.134.95): icmp_req=4 ttl=47 time=152 ms 64 bytes from gg-in-f95.1e100.net (74.125.134.95): icmp_req=5 ttl=47 time=157 ms 64 bytes from gg-in-f95.1e100.net (74.125.134.95): icmp_req=6 ttl=47 time=160 ms 64 bytes from gg-in-f95.1e100.net (74.125.134.95): icmp_req=7 ttl=47 time=154 ms 64 bytes from gg-in-f95.1e100.net (74.125.134.95): icmp_req=8 ttl=47 time=157 ms 64 bytes from gg-in-f95.1e100.net (74.125.134.95): icmp_req=10 ttl=47 time=154 ms 64 bytes from gg-in-f95.1e100.net (74.125.134.95): icmp_req=11 ttl=47 time=152 ms   The issue happens on different browsers, I installed epiphany and it shows the same behaviour.  I have inspected the network tab on firefox and it shows a single, unreplied GET request:   I installed wireshark and listened for HTTP GET requests; on other sites it pops up on the report, but on ajax.googleapis it shows nothing. I listened then for DNS requests, there are some differences:     If connect via telnet to the port 80 of a random site and perform a GET it works, but I can't telnet to ajax.googleapis.com (or it's IP), the connection never completes. find command with regex quantifier e.g. {1,2} I have been trying to create a find command string that will find all files that end with a number 1-99 but exclude all others.  e.g. I want to find myfile1 myfile99 but not myfile456 and not myfilebackup  The regex I'm thinking of is myfile[1-9]{1,2} but I can't get this to work with find.  find . -regex '.*myfile[0-9]{1,2}' OR  find . -iname 'myfile[0-9]{1,2}'  From what I can see it's the {1,2} part that is not working.  (by the way can you use -name -regex interchangably?)  Any help appreciated. Is there proof that the DSA construction, also used by ECDSA, is secure assuming that discrete logarithms in the relevant group representation are difficult? As per the title, what is this new feature? dollar-terminated strings In my assembly language class, our first assignment was to write a program to print out a simple dollar-terminated string in DOS.  It looked something like this:  BITS 32     global _main  section .data     msg db "Hello, world!", 13, 10, ’$’  section .text _main: mov ah, 9 mov edx, msg int 21h ret   As I understand it, the $ sign serves to terminate the sting like null does in C.  But what do I do if I want to put a dollar sign in the string (like I want to print out "it costs $30")?  This seems like a simple question, but my professor didn't know the answer and I don't seem to find it using a google search. As a 8th grader I am still a newbie at science and I have problems understanding the forces that I can not imagine and one of these "forces" is the moment.  We are told that,  $$\text{moment}= Nm$$ but how can a certain force (i.e. $N$) be applied when there is $m$? How does it depend on the length of the considered object?  And how can 1 moment be defined on the basis of that representation?  And what would be the effect if the moment value is increased by the newton part as opposed to the effect when the value is increased by the length part.  Or is the result the same in both cases? Let $X$ be any distribution with defined mean, $\mu$, and standard deviation, $\sigma$.  The central limit theorem says that  $$ \sqrt{n}\frac{\bar{X} - \mu}{\sigma}  $$ converges in distribution to a standard normal distribution.  If we replace $\sigma$ by the sample standard deviation $S$, is there a theorem stating that  $$ \sqrt{n}\frac{\bar{X} - \mu}{S}  $$ converges in distribution to a t-distribution?  Since for large $n$ a t-distribution approaches a normal, the theorem, if it exists, may state that the limit is a standard normal distribution.  Hence, it would seem to me that t-distributions are not very useful - that they are useful only when $X$ is roughly a normal.  Is this the case?    If it is possible, would you indicate references that containing a proof of this CLT when $\sigma$ is replace by $S$?  Such a reference could preferably use measure theory concepts.  But anything would be great to me at this point. Multi-core vs Multi-CPU I am requesting a new server from our Server team. Which is better for SQL Server performance: 2 CPUs with 8 cores per CPU or 1 CPU with 16 cores? What is the name of the package for R? I tried aptitude search r, but (unsurprisingly), there are waaaay too many results to sift through.