Would it be unsafe to travel to Greece at this time?
I am travelling to Athens, Greece, shortly, and have seen . Should I be worried? Should I cancel my trip?  Update  It's fine, taxis are currently on strike, but Syntagma Sqaure is fine:
I found a feature request at  but it doesn't seem easy to get a column view with Nautilus while with Mac OS X it's a default feature.  Have I missed something or is this not currently possible? He who must not be named? (aka Anyone can ping everyone in chat) 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? How do I disable the alt-right click keyboard binding? Compare double in VBA precision problem I have trouble comparing 2 double in Excel VBA  suppose that I have the following code  Dim a as double Dim b as double a = 0.15 b = 0.01   After a few manipulations on b, b is now equal to 0.6  however the imprecision related to the double data type gives me headache because  if a = b then  //this will never trigger end if   Do you know how I can remove the trailing imprecision on the double type? Find The Last 3 digits of the number $2003^{2002^{2001}}$ Find The Last 3 digits of the number $2003^{2002^{2001}}$  BY number theory or otherwise,   Also i would like to ask is there a property observed in the numbers of the form $k^n$, where for some $k, n$ is varied then the digits of $k^n$ are periodic,  for example,  $2^n$,  its last digit is periodic with period 4, its second last digit is periodic $4\cdot 5 = 20$ its third last digit is periodic with periodic with period $20\cdot 5 =100$  I have observed this property with other numbers as well, though period might vary,for different values of $k$. Does the following series have a closed-form expression:  $$\sum_{k=0}^{\infty} \frac{z^k}{(k!)^2}$$  I know that it must converge because:  $$\sum_{k=0}^{\infty} \frac{z^k}{k!} = e^z$$  and the $(k!)^2$ denominator obviously increases more quickly than the $k!$ denominator.  This problem came up in computing the probability of a draw in a football match with each team's goal scoring modeled as a Poisson process.  Thanks,  John Note that (1) all norms on finite dimensional vector space are equivalent.  And here (2) norms on vector space are equivalent iff they have same topology.   Question : How can we prove (2) ? Please recommend reference  Thank you in anticipation Do Americans remove the "t" in "wanted"? When you pronounce the phrase "I got a message you wanted to see me", is the "t" usually deleted in the word "wanted"? Thank you. Set of discontinuity of monotone function is countable The result I am trying to prove is the following:     Let $F:\Bbb R\to\Bbb R$ be increasing. Then the set of points, at which it is discontinuous, is countable.   I have been reading this form Folland's Real Analysis and he proves this by considering the sum $\sum_{|x|&lt;N}[F(x^+)-F(x^-)]$ which has to be finite by some sort of telescoping sum. Now, I am not sure how he defines this sum. I am assuming he does this by using nets (let me know if there is another way to look at this), but he doesn't introduce the concept of nets until the next chapter. So I was looking for some other ways to prove this result and I found the following result (from Stein-Shakarchi) which is quite similar but assumes $F$ to be bounded.      A bounded increasing function $F$ on $[a,b]$ has at most countably many discontinuities.   This is shown by using the density of rationals in $\Bbb R$, i.e. $\exists r_x\in\Bbb Q$ s. t. $F(x^-)&lt;r_x&lt;F(x^+)$ corresponding to each point of discontinuity $x$.   Now I feel like there shouldn't be a problem in doing the exact same thing for unbounded increasing function. Is this right? Secondly how does this proof relate to the first one? I feel like there isn't much of a difference between the two proofs. To be precise I think that the previous sum is well defined/finite because of this countability of discontinuous points. What do you think about this way of thinking?  Edit. Here is the Folland's proof in more detail:  Since $F$ is increasing, the intervals $(F(x^-),F(x^+))$ are disjoint for all $\forall x\in\Bbb R$. Moreover,  $\forall|x| &lt; N$ such intervals are contained in $(F(-N),F(N^+))$ and so  $$\sum_{|x|&lt;N}[F(x^+)-F(x^-)] \leqslant F(N) - F(-N) &lt; \infty. $$ Hence the set $\{ x \in (-N,N) : F(x^+) \neq F(x^-)\}$ is countable. Construct a Borel set on R such that it intersect every open interval with non-zero non-"full" measure How to twist radial vector to make spirals? Measuring accuracy of latitude and longitude? I am trying to add smoke to a cigarette. I've created a Cylinder, hit space and chose quick smoke while this sphere was selected. It created a transparent bigger sphere and it is emitting smoke in solid and texture mode. But when I try it out in render mode, it won't show the smoke for some reason. Here is my setup:    The cylinder has a basic white material. Thanks! Theorem 3.2 Rudin -- How is 0 concluded? I'm having trouble understanding why the arbitrariness of $\epsilon$ allows us to conclude that $d(p,p')&lt;0$. It seems we could likely conclude a value such as $\frac {\epsilon}{100}$ couldn't we?? The other idea that would normally work is the limit (as $n$ approaches $\infty$, $p$ approaches $p'$) but that would mean we are further in another sequence which would have same problem Thanks in advance   $\ $  $\ $  $\ $   Definition of Convergence     A sequence $\{ p_n \}$ in a metric space $X$ is said to converge if there us a point $p \in X$ with the following property: For every $ \epsilon&gt;0$ there is an integer $N$ such that $n \ge N$ implies distance function $d(p_n, p) &lt; \epsilon.$ Alternative Method to Acquire El Capitan Upgrade Pass php variables to js without drupal behaviour I stand on the following tricky situation:  I have a node with geofield coordinates attached. I am constructing an array of points. Something like:  Array ( [86] =&gt; Array     (         [0] =&gt; Array             (                 [lat] =&gt; 39.1641410477                 [lon] =&gt; -2.633972168             )          [1] =&gt; Array             (                 [lat] =&gt; 41.0420738489                 [lon] =&gt; -2.633972168             )          [2] =&gt; Array             (                 [lat] =&gt; 41.0420738489                 [lon] =&gt; 1.2524414063             )          [3] =&gt; Array             (                 [lat] =&gt; 39.1641410477                 [lon] =&gt; 1.2524414063             )         [4] =&gt; Array             (                 [lat] =&gt; 39.1641410477                 [lon] =&gt; -2.633972168             )     )  [85] =&gt; Array     (         [0] =&gt; Array             (                 [lat] =&gt; 39.1641410477                 [lon] =&gt; -2.633972168             )          [1] =&gt; Array             (                 [lat] =&gt; 41.0420738489                 [lon] =&gt; -2.633972168             )          [2] =&gt; Array             (                 [lat] =&gt; 41.0420738489                 [lon] =&gt; 1.2524414063             )          [3] =&gt; Array             (                 [lat] =&gt; 39.1641410477                 [lon] =&gt; 1.2524414063             )         [4] =&gt; Array             (                 [lat] =&gt; 39.1641410477                 [lon] =&gt; -2.633972168             )     ) )   I want to pass this to my-googlemaps.js in order to be used by google's init map Google map is defined as:  my-map:   header: true js:   js/my-googlemaps.js: { }   https://maps.googleapis.com/maps/api/js?key=my_key&amp;callback=initMap: {type: external, attributes: {defer: true,async: true}} dependencies:   - core/drupal   - core/drupalSettings  my-googlemaps.js:   console.log(Drupal.settings);   function initMap() {}   This way I get Drupal.settings undefined, which makes sense I guess. On the other hanve if I place initMap into a behavior It can not be seen as a callback as defined in googleapis.com before.  Has anyone stumbled with this before? Any idea how to attack the problem? I want to use the get_option() function of wordpress in one of my theme's files, which is not related to WP, it is just located in the same directory of the other theme files. I need this file because of some extra IPN paypal related actions, but I need some values from the options table that exists in WP to be called in this page in order for it to work. I know I can't just use get_option() as this file is overlooked by wordpress. Is there any approach by including some parts of wordpress in my theme to make this functionality only work? I want to get random decimal digits out of a 6-faced die.  Let's say the die is fair, with an equal probability for each outcome. (But feel free to share any consequences of that not being true, if you feel like it.)  I will represent the outcome of a die roll as a base-6 number:   In base-6 there are only 6 possible digits: $\{0,1,2,3,4,5\}$. The die has faces numbered 1 to 6. Face $f$ corresponds to digit $f-1$.   Thus, I can represent as many die rolls as I like with a base-6 number:   If the die is rolled once:   Let's say the die stopped on face $5$. The final base-6 number will be $4$.  If the die is rolled twice:   Let's say the die stopped on face $5$. And then on face $3$. The final base-6 number will be $42$.  If I roll the dice 10 times:   Let's say the die stopped sequentially on faces $5$, $3$, $4$, $6$, $2$, $3$, $3$, $3$, $2$, and $4$. The final base-6 number will be $4235122213$.    Since I want decimal digits, I need to convert to base-10.   Base-6: $4235122213$ Base-10: $44753985$   For any given number of die rolls, how many different combinations exist? If there are $r$ die rolls, the total of possible combinations is $6^r$.   $r$ rolls — $6^r$ different combinations. $0$ rolls — only $1$ combination. $1$ roll — $6$ different combinations. $2$ rolls — $36$ different combinations. $3$ rolls — $216$ different combinations. $4$ rolls — $1296$ different combinations. $5$ rolls — $7776$ different combinations. $6$ rolls — $46656$ different combinations. $7$ rolls — $279936$ different combinations. $8$ rolls — $1679616$ different combinations. $9$ rolls — $10077696$ different combinations.   $n_r$ ($\in \mathbb{N_0}$) is the number obtained after $r$ die rolls through the process described previously: "If the die is rolled once, twice, ..."  It is impossible for $n_r$ to reach the number of possible different combinations ($6^r$). It will be always short by least $1$:  $$ 0 \leqslant n_r &lt; 6^r $$   $r$ rolls — $n_r$ never surpasses $6^r-1$. $0$ rolls — $n_r$ never surpasses $0$. $1$ roll — $n_r$ never surpasses $5$. $2$ rolls — $n_r$ never surpasses $35$. $3$ rolls — $n_r$ never surpasses $215$. $4$ rolls — $n_r$ never surpasses $1295$. $5$ rolls — $n_r$ never surpasses $7775$. $6$ rolls — $n_r$ never surpasses $46655$. $7$ rolls — $n_r$ never surpasses $279935$. $8$ rolls — $n_r$ never surpasses $1679615$. $9$ rolls — $n_r$ never surpasses $10077695$.   I can never trust the leftmost nor the rightmost digit (fringe digits), since the possible values are potentially restricted.   For $0$ rolls, the outcome is always $0$. For $1$ roll, the fringe digit never surpasses $5$. For $2$ rolls, the leftmost digit never surpasses $3$, and the rightmost, $5$. For $3$ rolls, the leftmost digit never surpasses $2$, and the rightmost, $5$. For $4$ rolls, the leftmost digit never surpasses $1$, and the rightmost, $5$. For $5$ rolls, the leftmost digit never surpasses $7$, and the rightmost, $5$. For $6$ rolls, the leftmost digit never surpasses $4$, and the rightmost, $5$. For $7$ rolls, the leftmost digit never surpasses $2$, and the rightmost, $5$. For $8$ rolls, the leftmost digit never surpasses $1$, and the rightmost, $5$. For $9$ rolls, the leftmost digit never surpasses $1$, and the rightmost, $5$.   The other digits seem perfectly random to me though. Am I wrong? It would help everyone if we provided a mechanism that people could use to flag their post if English is language they are not comfortably fluent in. A lot of non-English speakers have to go to English forums for tech support and find it embarrassing to ask questions in broken Englis.   Worse, people reading a post often cannot tell if a badly-worded post results from a poor English or just laziness and sloppiness on the part of a native English speaker. Personally, I will take the time to puzzle out a poorly-worded post if I know the author is struggling with English, but if I think they're just lazy and careless I won't bother.   A simple check box could flag the author as a non-English speaker and allow everyone to adjust accordingly.   Edit01:  Some answers below have accused me of being 'elitist'. I'm not sure where they got the idea that I was sneering down at anyone because their abilities at either English or coding. That was not my intent.   When I said I would not bother with post that appeared to incoherent owing to laziness or carelessness, I am not being elitist. I'm giving priority in my time budget to people who are respectful enough of my time to spend the their time writing as clear a question as their grasp of English and coding allows. Why should I spend time answering a careless and slapdash post when I could spend that time helping posters who took more of their time writing their questions?   I am perfectly willing to burn a lot of time helping someone struggling to write code in their non-native language. I have a hard enough time coding myself in English that I can't even imagine what a dog's breakfast I would make of it if I had to code in, say, Korean.    I have seen many instances in which questions have been downvoted when a quick glance at the poster's profile gives a strong hint they are not native English speakers. I would like a system that would spare those posters from being downvoted or ignored by using an interface element that clearly communicates in a standardized way whether the poster natively speaks English or not.   I don't see what's elitist about that.    Edit02:   (original unedited) I'm talking about:     Hy, I have a childe view that put it   self over other brother views. The   problem is that when i touch it the   brother also reacts at the touch   event. How can I disable touch   propagation on the underlieng brother   views?   I'm not even exactly sure what he is describing. I can guess that he has a sibling view that extends over its siblings but I'm not sure. If I edited it, I might not end up asking the same question the poster intended.   To answer the question, I will either have to (1) first ask for more detail and then keep checking back until I get it or (2) try to answer what I think the question is and possibly mangle it then have to come back and edit my answer all the while risking a downvote because I answered the wrong question.   I will take the time and the risk of down vote if the poster is not a native English speaker (or is a child) and the confusing question represents their honest best effort. If they're just being lazy, I have other people to help.   I would like a mechanism that would help me decide how to allocate my time and would protect the non-English speaking posters from unjust downvotes. I use wubi to install Ubuntu 10.10 on my ntfs partition. So I want to change the home folder to a folder on the ntfs partition. I could keep the personal configuration, software and so on after reinstalling the Ubuntu.  So I use ntfs-config to manage the disk partition, it's mounted when system is startup. And the permission of all files and directories are 777.  Then I modified the /etc/passwd to set the home folder to the folder on the ntfs partition. I can successfully login the account, however it looks like the .bashrc and .profile are not loaded correctly. I can't use the input method(even can't configure ibus), no sound device. However everything works well after changing the home folder back to /home/.  Could anybody give me a hint to make it work? Thanks.