Why do we omit the “are”
"named" vs "that is named"
Xcode - How to fix 'NSUnknownKeyException', reason: … this class is not key value coding-compliant for the key X" error? Where can I rent a decent mountain bike in Zürich? I am going for a 4 day trip in Zürich and I would like to bike quite a lot. Though biking is quite advertised, I failed to find a decent bike rental shop in the city. Would highly appreciate some tips! The only good way of creating circles in ArcMap is using true arc, (compound curves) but I need to convert those to vertex (densifying) because of a compatibility problem. I need info for geodatabase and SDO_geometry (arcsde)  and yes there is a way. I use:  UPDATE layer1 a SET arctype = 'compound' WHERE has_compound_curves(a.shape) &lt;&gt; 0;   and then using ET Geotools to densify  layer by layer.  But there should be easier way of doing this straightforward in Oracle or ArcMap, and I just want to densify the features that have true arc. I don't want any unnecessary vertices on straight lines and so on.  How can I identify true arcs in ArcMap, and how can I densify them as fast and easy as possible?  Same for Oracle SQL. "Hot" tab in is badly skewed and misleading - time to replace it with actual hot questions? Each site got a &quot;hot&quot; tab, where its contents are calculated based on . However take a look on the screenshots below and see for yourself that &quot;hot&quot; got nothing to do with many of the questions listed there. :    :    As you can see, there are questions with negative score, no answers, and even closed. I won't be surprised to see spam in there as well. This can't be any worse. What I suggest, instead of fixing the formula or patching it, simply have the hot tab show the same questions as the Hot Network Questions sidebar. (from the specific site only, of course.) Since the hot questions &quot;pool&quot; (as seen ) is limited to 100 for the whole network, either expand it or have the per-site list show questions with less hotness points - it would still be better than what we have now. Deriving Chinese Remainder Theorem from gcd Bezout identity We want to find the solution $x$ to the congruence system  $$\begin{align} x &amp;\equiv r_1 \!\!\!\pmod{\!m_1}\\ x &amp;\equiv r_2 \!\!\!\pmod{\!m_2}\end{align},\ \ {\rm where}\ \  \gcd(m_1, m_2) = 1$$  These can be rewritten as  $$\begin{align} x &amp;= r_1 + m_1 j\\ x &amp;= r_2 - m_2k\end{align}$$  for unknown integers $j, k$. So we set those two equations as equal and rearrange them to  $$m_1j + m_2k = r_2 - r_1$$  Now assume we perform $\text{egcd}(m_1, m_2)$, which gives us the solution to  $$m_1u + m_2v = \gcd(m_1, m_2)$$  Let the integer $\,h\,$ make $\,h \gcd(m_1, m_2) = r_2 - r_1$.  Then $\qquad hm_1u + hm_2v = h\gcd(m_1, m_2) =  r_2 - r_1 = m_1j + m_2k$  At this point I am lost because I don't think we can just assume  $hm_1u = m_1j$ and extract $j = hu$.   How do I get the values of $j$ or $k$ so I can get the value of $x$? How to Install Virtualbox on Windows 10 host? Linux "top" command: What are us, sy, ni, id, wa, hi, si and st (for CPU usage)? When I issue top in Linux, I get a result similar to this:    One of the lines has CPU usage information represented like this:  Cpu(s): 87.3%us,  1.2%sy,  0.0%ni, 27.6%id,  0.0%wa,  0.0%hi,  0.0%si,  0.0%st   While I know the definitions of each of them (far below), I don't understand what these tasks exactly mean.   hi - what does servicing hardware interrupts mean? si - what does servicing software interrupts mean? st - they say it's the "CPU time in involuntary wait by the virtual CPU while hypervisor is servicing another processor (or) % CPU time stolen from a virtual machine".   But what does it actually mean? Can someone be more clear?  I listed all of us, sy, ni, etc, because it could help others searching for the same. This information is not in the man pages.  us: user cpu time (or) % CPU time spent in user space sy: system cpu time (or) % CPU time spent in kernel space ni: user nice cpu time (or) % CPU time spent on low priority processes id: idle cpu time (or) % CPU time spent idle wa: io wait cpu time (or) % CPU time spent in wait (on disk) hi: hardware irq (or) % CPU time spent servicing/handling hardware interrupts si: software irq (or) % CPU time spent servicing/handling software interrupts st: steal time - - % CPU time in involuntary wait by virtual cpu while hypervisor is servicing another processor (or) % CPU time stolen from a virtual machine In thinking how to ask this question (somewhat) succinctly, I keep coming back to a Microwave Oven.  A Microwave Oven has a grid of holes over the window specifically designed to be smaller in diameter than the wavelength of the microwaves it produces, yet larger than the wavelengths of the visible light spectrum - this is so you can watch your food being heated without getting an eye full of microwaves.  The "realness" of electromagnetic waves seems indisputable - both from the microwave example above, and also because if I want to broadcast a radio wave with a certain wavelength, then I need to make sure I have an antenna of corresponding length to produce the wave I'm looking for.  Furthermore, we discuss and treat these waves as real, measurable "objects" that exist and can be manipulated.     Now, if I want to describe the behavior of my Microwave Oven in the framework of QM (let's pretend my oven is going to only produce 1 photon of energy corresponding to a wavelength of the microwave spectrum for simplicity) then I'll describe the behavior of that photon as a wavefunction that evolves over time and gives a probability distribution within my microwave that similarly does not allow the photon to pass through the safety grid and exit the oven cavity giving me a retinal burn.  The difference is, the wavefunction is never treated as something "real" in this description.  When the safety grid is described as working to protect you because it has holes smaller than the wavelength of the classical waves it's blocking, this is a useful description that seems to describe "real" objects/be-ables.  While it is possible to describe why an individual photon has low probability of passing through the same grid but extended physical properties such as wavelength (in space) are treated as non-real because we're dealing with a point particle and with behavior described by something we also treat as non-real (the wavefunction); it seems unclear to me why we insist this wave function which predicts behavior of physical measurements so well is somehow "non-real."    Put another way, if we have no problem treating EM waves as "Real," then why do we insist on treating the wavefunction that describes the same behavior as "unreal?"  I understand there is recent research (Eric Cavalcanti and his group for one) trying to argue this point, but as every respectable physics professor, I've ever encountered, has treated the wavefunction as an indisputably non-real mathematical tool, I needed to ask this community for an answer. Apple has introduced , also known as "rootless", with OS X 10.11, El Capitan. I understand this is a step for general protection against malware but as a developer I need write access to some of the files it locks away.  How do I disable this protection? .       The  has no sign of the user sharth The  also does not have any sign of related activity   I would like to know why the user's name is associated with the question. At least why their display name shows up as having modified the question timeline activity.  Possible reason that I can think of is that, .  Is this the reason?  Is there a way (for normal users), to look for such details, other than looking at the user activity and the question's revision history. I guess nobody really knows the true nature of black holes, however, based on everything I know about black holes, there is a "singularity" at their center, which has finite mass but is infinitely small and thus infinitely dense.  So a black hole is really just a point mass that dramatically warps the space-time around it so that an event horizon is achieved.  What doesn't make sense to me is how a true mathematical "point" can rotate, or at least how it is even possible to determine if a point is rotating (or if it should even make a difference about whether or not it is rotating, for the same reason it would be impossible to tell if a perfect, featureless sphere were rotating (I know it would have higher rotational energy but lets assume you can't measure that because a true "point" can't attain rotational energy since it has no radius)).  The only conceptual solution I have to describe a rotating black hole would be to compare it to a rotating whirlpool, where the surface of the water is the fabric of space-time... but this is different because there is no "singularity" in a whirlpool that causes the water around it to rotate, whirlpools form from flow of water around a point (put into motion perhaps by some kid swirling water in a 2-liter bottle... it's due to an external cause), but the only thing that could cause rotation around a black hole would be the singularity itself, which doesn't make sense because, once again, how can we know if a true point is actually rotating?  Aside from everything I've said, here is what I am actually asking:  Why/how do some black holes rotate... what is the mechanism of their rotation (is analogous to a spinning point or a 3-d whirlpool, or something different)? Some observations I made is for $\frac{a}{b}+\frac{b}{a}$, is either:   the denominator has to be one, the numerator has to be a multiple of the denominator or  the numerator and denominator have to be the same.    Obviously, with the given conditions case 3 is eliminated since  $a \neq b$.  For case 1, if $b=1$, then $a=1$ which is a contradiction to the given condition that says $a \neq b$.  For case 2, I would think of examples. For example if $b=2$ then a multiple is $4$, so $a=4$. Then we have:  $$\frac{a}{b}+\frac{b}{a}=\frac{4}{2}+\frac{2}{4}=\frac{10}{4}$$  which is not an integer, but how would i proceed to show this case for all integers. What is probabilistic programming? For the past year, I've been hearing a lot about Probabilistic Programming (PP) frameworks like  and , and how great PP is. And today, someone shared this link with me:    However, I don't really follow what is special about it since it feels like whatever you can do in PP you can do in any other general purpose language. I'm sure there are technical aspects about PP that make it attractive (e.g. parallel computing), but this aside, is PP really any different from any other language?  Question: I was wondering if there was a consensus of what PP was and how it differs from other statistical-focused software like R, Matlab, Mathematica. It should be noted that PyMC3 and Stan are focused on more Bayesian analysis.  Doing a little research on Google, I came across the following two definitions. The first more abstract, and the second more about PP's technical characteristics.     1.2. Probabilistic Programming Is      Instead, probabilistic programming is a tool for statistical modeling. The idea is to borrow lessons from the world of programming languages and apply them to the problems of designing and using statistical models. Experts construct statistical models already—by hand, in mathematical notation on paper—but it's an expert-only process that's hard to support with mechanical reasoning. The key insight in PP is that statistical modeling can, when you do it enough, start to feel a lot like programming. If we make the leap and actually use a real language for our modeling, many new tools become feasible. We can start to automate the tasks that used to justify writing a paper for each instance.      Here's a second definition: a probabilistic programming language is an ordinary programming language with rand and a great big pile of related tools that help you understand the program's statistical behavior.      Both of these definitions are accurate. They just emphasize different angles on the same core idea. Which one makes sense to you will depend on what you want to use PP for. But don't get distracted by the fact that PPL programs look a lot like ordinary software implementations, where the goal is to run the program and get some kind of output. The goal in PP is analysis, not execution (added emphasis).   --   I'd like to know if the general statistical community agrees with these two definitions of PP, and if there are any other characteristics this definition may be missing. Group of even order contains an element of order 2 I am working on the following problem from group theory:     If $G$ is a group of order $2n$, show that the number of elements of $G$ of order $2$ is odd.   That is, for some integer $k$, there are $2k+1$ elements $a$ such that $a \in G,\;\; a*a = e$, where $e$ is the identity element of $G$. How to connect to Salesforce REST API without OAuth? How does Jitterbit do it? Will my 320W PSU handle a Asus GTX 750Ti I've got a 320W PSU as far as I know and it's a Chinese PSU because I've seen the Chinese letters on it. I just had a question if I can upgrade my pc to Asus GTX 750Ti 2 GB OC.  My pc specs are:   4GB DDR3 RAM Intel Core 2 Duo E8400 3.0 GHZ 250GB HDD Onboard graphics card XTerm only display part of some unicodes and Urxvt displays nothing In my case, (U)XTerm does display some unicodes, but only partially. For exmaple: for letters are: 𝒫φϕ𝒟. Here is a screenshot of UXTerm and Urxvt respectively   It seems that the problem is related to the letter space or letter length. By the way, everything is fine with gnome-terminal.  My current .Xresources file is: Xft.dpi:       120 Xft.antialias: true Xft.hinting:   true Xft.rgba:      rgb Xft.autohint:  false Xft.hintstyle: hintslight Xft.lcdfilter: lcddefault  XTerm*faceName:          Fixed XTerm*faceSize:          14 XTerm*reverseVideo:      false XTerm*selectToClipboard: true  UXTerm.vt100*faceName:          Fixed UXTerm.vt100*faceSize:          14 UXTerm.vt100*reverseVideo:      false UXTerm*selectToClipboard: true  URxvt.font:            xft:Fixed:pixelsize=18  URxvt.depth:                      32 URxvt.background:                 #222D31 URxvt*scrollBar:                  false URxvt*mouseWheelScrollPage:       false URxvt*cursorBlink:                true URxvt*background:                 black URxvt*foreground:                 grey URxvt*saveLines:                  5000  How to make XTerm and Urxvt to display those characters correctly? Is it possible? Differences among Doctoral Degrees/titles Tuning PostGIS for production environments? What PostGIS documentation have you come across that has been helpful when tuning PostGIS for a production environment?  I would like to get together with my DBA to setup a Postgresql/PostGIS installation that is fit for production. I have read that there is some tweaking involved to achieve this, and I was hoping to find the answer on the .  So far I have found some documents on the OpenGeo site helpful, .  And this  is the kind of information I have found helpful, this is probably just basic DB stuff but to me its good stuff.  I would be interested to see what resources have helped others in achieving a stable production installation of PostGIS. Why do statisticians discourage us from referring to results as "highly significant" when the $p$-value is well below the conventional $\alpha$-level of $0.05$?  Is it really wrong to trust a result that has 99.9% chance of not being a Type I error ($p=0.001$) more than a result that only gives you that chance at 99% ($p=0.01$)?