Prove $2^{(n+1)}>n^2$, for all $n \in \mathbb{N}$.   I started by verifying the condition for $1$.   $$P(1):2^{1+1}>1^2$$ $$P(1):4>1$$  That is true.  Then I supposed $P(k)$ true, for some $k \in \mathbb{N}$. Now I've to prove $P(k+1)$:  $$2^{k+1+1}>(k+1)^2$$ $$2\cdot 2^{k+1}>(k+1)^2$$  By the hypotesis one known that $2^{k+1}>k^2$ so,  $$2\cdot2^{k+1}>2k^2$$  Now one needs to prove that $2k^2\geq(k+1)^2$ to conclude that $2^{k+2}>(k+1)^2$. But I'm having some trouble to prove this inequality.  Thanks for the help.

How do I prove the following statement by induction?  $$n^2 \lt 2^n$$  $P(n)$ is the statement $n^2 \lt 2^n$  Claim: For all $n \gt k$, where $k$ is any integer, $P(n)$  (since $k$ is any integer, I assume I have to prove this for positive and negative integers)  So let base case be $P(1)$, and I have to prove $P(n)$ for $n \ge 1$ and $n \lt 1$  $P(1)$ is $1^2 \lt 2^1$ which is clearly true.  Induction hypothesis: $k^2 \lt 2^k$  Inductive step $(k+1)^2 \lt 2^{(k+1)}$  $(k+1)^2 = k^2 + 2k + 1$  $k^2 + 2k + 1 \lt 2^k + 2k + 1$ by inductive hypothesis  Not sure how to proceed. Is my previous intuition that I have to prove this for $n \ge 1$ and $n \lt 1$ correct?


today I installed Ubuntu 18.04 on my laptop, I installed it from liveUSB and it is dual booted along with Win 10. When I restart my computer and grub shows up, there is no Win 10 option. I tried many things online, boot repair, i tried   sudo update-grub   and   sudo os-prober   , but it doesn't show anything at all. I will provide further details when you ak about them, but please keep in mind I'm a beginner when it comes to Ubuntu. Thank you.  Edit: SecureBoot is disabled (which is the output of the command mokutil --sb-state), when I type   ls /sys/firmware/efi/   it shows  config_table  efivars  esrt  fw_platform_size  fw_vendor  runtime  runtime-map  systab  vars   I don't think I installed Ubuntu in legacy mode, I checked it before but I'm not sure how to check it once again, to be sure.  Edit 2: The result of a command cat /etc/default/grub is  # If you change this file, run 'update-grub' afterwards to update # /boot/grub/grub.cfg. # For full documentation of the options in this file, see: #   info -f grub -n 'Simple configuration'  GRUB_DEFAULT=0 GRUB_TIMEOUT_STYLE= GRUB_TIMEOUT=10 GRUB_DISTRIBUTOR=`lsb_release -i -s 2> /dev/null || echo Debian` GRUB_CMDLINE_LINUX_DEFAULT="quiet splash" GRUB_CMDLINE_LINUX=""  # Uncomment to enable BadRAM filtering, modify to suit your needs # This works with Linux (no patch required) and with any kernel that obtains # the memory map information from GRUB (GNU Mach, kernel of FreeBSD ...) #GRUB_BADRAM="0x01234567,0xfefefefe,0x89abcdef,0xefefefef"  # Uncomment to disable graphical terminal (grub-pc only) #GRUB_TERMINAL=console  # The resolution used on graphical terminal # note that you can use only modes which your graphic card supports via VBE # you can see them in real GRUB with the command `vbeinfo' #GRUB_GFXMODE=640x480  # Uncomment if you don't want GRUB to pass "root=UUID=xxx" parameter to Linux #GRUB_DISABLE_LINUX_UUID=true  # Uncomment to disable generation of recovery mode menu entries #GRUB_DISABLE_RECOVERY="true"  # Uncomment to get a beep at grub start #GRUB_INIT_TUNE="480 440 1"   the GRUB_TIMEOUT_STYLE= line was changed by me, original value is hidden, I changet so the GRUB would always appeared on restart, before that it didn't even show up.

I recently got a computer from school. It came with Windows 8.1 installed. I then installed another copy of Windows 8.1 (so it would use the built-in Windows Pro license) and upgraded it to Windows 10. I then installed Ubuntu alongside both Windows 8 and 10. Note that I made a separate 255MB ext2 partition for /boot. Now, when I boot the computer, I first see a GRUB prompt (I already un-hid the grub prompt 'cuz I like it that way) with Windows 8 and Ubuntu options. However, there is no Windows 10 option. If I select Ubuntu, the computer boots into Ubuntu. However, if I select the Windows 8 option, I then get sent to the Windows bootloader, where it then gives me options to boot either Windows 8 or Windows 10. (However, by this point, the computer has already loaded the kernel and all. Apparently Microsoft misunderstood the concept of a bootloader and decided that that meant "boot practically the entire system before actually showing the bootloader". Typical Microsoft.) How can I disable the Windows bootloader and add a Windows 10 option to GRUB? EDIT: Someone has answered telling me to disable the Windows bootloader. However, I still do not know how to add Windows to the GRUB OS list. Can anyone help with this? EDIT 2: After removing Windows 10 from the Windows bootloader with EasyBCD, it seemed that, after a few reboots, it would continually unhide itself and Windows 10 would reappear. However, I then later deleted Windows 10 from the list of OSes in msconfig, and it seems to have stayed deleted. However, I STILL have not managed to get Windows 10 to appear in GRUB. It's as if GRUB simply doesn't detect it. Also, I'll put this in the question so that people see it - I have tried using boot-repair, however, it has NOT helped any.


I learned that Bayes theorem was defined as follows :  $$p(\theta\mid y)=\frac{p(y\mid\theta)p(\theta)}{p(y)}$$  But then today I came across definition with likelihood:  $$p(\theta\mid y)=\frac{L(\theta\mid y)p(\theta)}{p(y)} = \frac{L(\theta\mid y) p(\theta)}{\int L(\theta\mid y) p(\theta) d\theta }$$  What is the link between the two?

The  claims that likelihood and probability are distinct concepts.     In non-technical parlance, "likelihood" is usually a synonym for "probability," but in statistical usage there is a clear distinction in perspective: the number that is the probability of some observed outcomes given a set of parameter values is regarded as the likelihood of the set of parameter values given the observed outcomes.    Can someone give a more down-to-earth description of what this means?  In addition, some examples of how "probability" and "likelihood" disagree would be nice.


I have a taxonomy term with hierarchy (two levels, mother and children). When I set a relationship and say "Require relationship", all items dissapear which do not fit the relationship (Content having this taxonomy). But the content is associated to a child of the parent taxonomy, so in some sense, it would have to show the parent term of the taxonomy. Example: I have Taxonomy: Fiction, with children: Sci-Fi, Terror, Romantic.  I associate a content (book) with Sci-Fi. I would like that in the listing, there would appear Fiction and Sci-Fi and not only Sci-Fi. Assigning the book to both Fiction (parent term) and Sci-Fi does not seem the best option and it is not elegant.  Note: there is a suggested , but I think that proposal does not fit my case, because I don't want the parent taxonomy to be repeated for each book. In fact, I print a listing of taxonomies, Fiction, then the children (Sci-Fi, Terror, etc.), and in each, the products (books). I don't want the word "Fiction" to be repeated over and over.

I am using a JSON plugin to Views to output taxonomy terms as a JSON object for Javascript manipulation. I was to be able to include the parent ID in this output.  In view I see "Taxonomy term: Parent term" under relationships and I have added that to the view. But under "Fields" -> "Add" there is still no "Parent term" listed in the available fields. I'm pretty sure the "pid" should be available. Is there some other way of accessing that field via the Views UI?


I have a list of 21 grayscale images. I want to determine and save all the possible 3 layer combinations out of these 21 images. Can anyone a suggest a way in python?

I have a list with 15 numbers in, and I need to write some code that produces all 32,768 combinations of those numbers.   I've found  (by Googling) that apparently does what I'm looking for, but I found the code fairly opaque and am wary of using it. Plus I have a feeling there must be a more elegant solution.  The only thing that occurs to me would be to just loop through the decimal integers 1–32768 and convert those to binary, and use the binary representation as a filter to pick out the appropriate numbers.   Does anyone know of a better way? Using map(), maybe?


Given two free modules $R^n$ and $R^m$ over a commutative ring $R$, it's true that $R^n \cong R^m$ if and only if $n=m$. However every proof I've seen of this fact assumes that we've first proven it when $R$ is a field. Although this is probably true (most of us see linear algebra before commutative algebra), this sort of proof is a bit unsatisfactory to me.   Is there a (nice) proof of $R^n \cong R^m$ if and only if $n=m$ that doesn't assume we know it's true when $R$ is a field?  $\bf{Edit}$ Though the linked question implies a proof that does not use the result for $R$ a field, such an implication doesn't mean that the questions are duplicates of one another.

I'm trying to prove that if $A\neq 0$ is a commutative ring and there is an injective $A$-module homomorphism $A^m\hookrightarrow A^n$ then $m\leq n$ must necessarily hold.    This is exercise 2.11 from Atiyah and MacDonald's Introduction to Commutative Algebra, but unfortunately all the solutions available online are either very sparse with regard to this question or seem to use (to my surprise) a generalized version of Cramer's rule. Is there perhaps some other "cleaner" approach to solving this problem?


We know that a moving source of sound waves produces , so that sound waves are closer-together in the front and farther apart behind, creating a difference in pitch.  Let's consider a situation where I generate a sound pulse (lasting one second). If I'm stationary, then you'll be hearing my pulse for exactly 1 second. If I'm moving towards you, then it will be heard for some time less than a second. If I'm moving away from you, then it will be greater than a second. For now, let's assume that I'm moving towards you.  If the sound waves are traveling at a constant speed and are closer together, then you'll hear all of it in a shorter amount of time. So, as my speed approaches very close to Mach 1, the waves would be so close together that the sound you hear will be almost instantaneous (something like a "bang!").  At Mach 1, all the waves would be stacked right on top of each other, thus creating a sonic boom. Now, as my speed exceeds Mach 1, (proceeding with the same logic), the sound should probably be reversed. Because, the wave that's been produced recently would be in front of its ancestor, so that information from the latest wave is received first, followed by the previous wave, followed by its previous wave, and so on.  So when we reach Mach 2, we should hear the original sound pulse backwards. Because, as we approached Mach 1 from Mach 0, the pitch increased, the waves bunched and we heard a bang! So, as we approach Mach 2 from Mach 1, the pitch should decrease back to the original pitch (because the time delay between the latest wave and the previous wave should increase, since the source is moving relatively faster) and now you should hear the same pulse backwards (a good example might be that if I shout "God" at Mach 2, you'll probably hear "Dog").  Getting deeper with this logic, as my speed exceeds Mach 2, the pitch of the sound you hear should be further reduced.  Summing everything up,  Mach 0.0 - sound is normal Mach 0.5 - sound is sped up and high pitched Mach 1.0 - sound is a boom! Mach 1.5 - sound is sped up, high pitched and reversed Mach 2.0 - sound is reversed Mach 2 + - sound is slowed down, lower pitched and reversed   Am I right with my logic?

Would you, as a stationary observer, hear a sound in reverse when the source of the sound travels with twice the speed of sound? Of course, he wouldn't hear anything at all before the airplane passed by and the sound reaches him, but what about after? Does it reverse due to the Doppler effect?


This is not a duplicate, because previously such question was asked at July 27. The answer was "only several hours passed, you should just wait". Now this answer does not fit.  The question is different when asked on August 6 than when it is asked on July 27.  It is August 6, 12:15 UTC time.  I try to upgrade from 16.04.5 to 18.04.1, with do-release-upgrade, and receive "No new release found."  They said that the upgrade will be ready "several days" after 18.04.1 release.  The release was in June 26. It is August 6 now. 11 days passed. Several days?  So the question is, is it only my problem? Or it is a bug in do-release-upgrade?  Or they have a problem which they cannot solve yet, and I should just wait a bit more?

I understand that the first point release of Ubuntu 18.04, namely 18.04.1 is now available and that my system should now offer it as an update.  My current OS version is 16.04.5 LTS. In System Settings/Software and Updates I have set 'Notify me of a new Ubuntu version' to 'For long term support versions'. I have tried both the main server and the server for United Kingdom, neither offers an update when Software Updater is clicked or via the Ubuntu Software icon.  Can anyone please tell me why I don't get the option of updating to 18.04?  Edit:  I don't remember the details exactly, but I think that my last LTS point release update was offered automatically a lot sooner after the published release date than where we are now with 18.04.1.  Edit 10th August  It appears that there has been some problem with the update process and that it should be fixed next week, see:    Edit 14th August 18.04.1 LTS now available from UK server,


You've got macaroni spilt all over your house. Which one would be a correct version?    These are too much macaroni. These are too many macaroni. It's too much macaroni.

Possible Duplicate:             Is it proper to say spaghettis for more than one spaghetti noodle?  What about macaronis as a plural for more than one macaroni noodle?


If the input is  foo,bar,baz bar,baz,qux qux,quux,baz bar,foo,qux waldo,fred,garply   the output should be  foo,bar,baz bar,baz,qux waldo,fred,garply   As you can see, records are deduplicated based on the 3rd column's value. If multiple records have the same 3rd column value, pick a random one (or the first one; doesn't matter)

I have large 3-column files (~10,000 lines) and I would like to remove lines when the contents of the third column of that line appear in the third column of another line. The files' sizes make sort a bit cumbersome, and I can't use something like the below code because the entire lines aren't identical; just the contents of column 3.  awk '!seen[$0]++' filename


I have a site which is multilingual. I need to target it for visitors from different countries, including United Kingdom and USA.  The problem is that if I make the main site for USA, and subdomain uk. for UK, it will contain the same content, and Google will treat it as a duplicate.  I want to also link my subdomains in a footer, like:  our site in spain, our site in english, our site for UK etc.   Will it help in this case or should I use some special meta-tags like <link rel="alternate" hreflang="..." href="..." /> to avoid actions from Google?  Or should I write different content for every english language version? (other languages' versions will be just translations from the main).

When I set up a site in multiple languages, how should I set up my URLs for search engines and usability?  Let's say my site is www.example.com, and I'm translating into French and Spanish. What is best for usability and SEO?  Directory option:  http://www.example.com/sample.html http://www.example.com/fr/sample.html http://www.example.com/es/sample.html   Subdomain option:  http://www.example.com/sample.html http://fr.example.com/sample.html http://es.example.com/sample.html   Filename option:  http://www.example.com/sample.html http://www.example.com/sample.fr.html http://www.example.com/sample.es.html   Accept-Language header:  Or should I simply parse the  header and generate content server-side to suit that header?  Is there another way to do this? If the different language versions don't have different urls, what do I do about the search engines?    UPDATE 2011-12-06  Google has new recommendations for meta tags for explicitly pointing to other language content: .  UPDATE 2012-05-25  Related but not precisely:   UPDATE 2013-06-12  includes discussion of several URL schemes directly relevant to the question.


I'm looking to do personal modifications to a DEM (Aster global elevation model). I want to select an rectangular area & reduce its recorded elevation by 20m. There are other parts on my map I want to raise in elevation, but I think if I learn how to reduce, I will be able to do the process in reverse and increase the elevation. Is this possible?

I am in QGIS. I have a raster layer of mountains and a lake. I have a vector layer (shapefile) of the lake. It sits nicely where it supposed to be over the raster level. I am going to convert this height map to an STL so that I can cnc this out of wood, so I'd like the actual lake to be something like 200 feet lower than it shows on the raster layer so that I can fill it with blue epoxy. I have read a lot of clipping and everything else, and I am lost.


I am making a 2D simulation of an ensemble of electric dipoles as a free-choice project in numerical science. I plan to calculate forces applied to each end of the dipole. The trouble is that I don't know how to apply forces that are not aligned with the center of mass.    In the diagram above we have a free-floating object with center of mass, $C$, and moment of inertia. Force $F$ is applied at displacement $R$ from the the center of mass. What is the force and torque applied at the center of mass?  I presume the force exerted parallel to $R$ is just $F$ projected on $R$ Torque is possibly $F$ times $R$ times the sine of the angle between $R$ and $F$

Say I have a rigid body in space. I've read that if I during some short time interval apply a force on the body at some point which is not in line with the center of mass, it would start rotating about an axis which is perpendicular to the force and which goes through the center of mass.  What is the proof of this?


Or "When would an expression like ###1 be useful?"  In macro programming, it's a well-known rule that you need to double your parameter identifiers with each successive layer:  \def\insult#1#2{%   #1 says #2 is a quack.%   \def\response##1##2{%     #2 refutes #1's claim, saying, ``#1 is a ##1 ##2''.     \def\response####1{#1 says,       ``I'm not a ##1 ##2, but a simple ####1.''       (#1 leaves.)}%     Rock on, #2.}}   Why must each layer of definitions double the number of #s necessary?  The only reason I can think of is to allow 'variadic parameter insertion', but this fails on the first case:  \def\use#1#2#3#4#5#6#7#8#9{I want ##1.} \use{3}cbdefghi   obviously does not expand to I want b.  So why is this doubling necessary?

Introduction: When you use \renewcommand within another macro or environment, one needs to double up the ## to access the parameters of the inner macro.  This serves as a way to distinguish the inner macros ##1 with the outer macros #1 (even if the outer macro does not have any parameters, it provides for error checking). For example: \newcommand*{\OuterCommand}{%     \renewcommand*{\SomeCommand}[1]{\color{red}##1}%     .... }%    The references below provide more details on this. Issue: It appears that the same doubling up of the # is needed within a \foreach loop as illustrated in the MWE below. This took me quite some time to figure this out as the error message that the MWE below gives is:  Illegal parameter number in definition of \pgffor@body  This was within a very deeply nesting of \foreach loops, so I was sure the problem was that I was nesting the \foreach too deeply.  Surprisingly, if you skip past the error, the output is still correct, so this made it even harder to locate the problem. Questions:  Since the \foreach does not have parameters like #1 (as \newcommand does), why is it necessary to double up the # within a definition within a \foreach? How is that the output is still correct, if you simply ignore the error and hit return to continue processing?  References:  . . .  Code: \documentclass{article} \usepackage{xcolor} \usepackage{pgffor}  \newcommand*{\MyList}{A,B,C}% \newcommand{\SomeCommand}[1]{#1}%  \begin{document} \foreach \x in \MyList {%     \renewcommand*{\SomeCommand}[1]{\color{red}#1}%  Using ## here eliminates the error.     \par\SomeCommand{\x}% }% \end{document}


I would like to have a symbol like \blacksquare at the end of the environment \newtheorem{example}{Example}. However, this symbol should be well-behaved in presence of formulae (i.e. no white space between the formula, and the symbol).  For example, the following line of code does not behave correctly, as can be easily checked.  \documentclass[11pt]{article}  \usepackage{mathtools}  \newcommand\xqed[1]{%   \leavevmode\unskip\penalty9999 \hbox{}\nobreak\hfill   \quad\hbox{#1}} \newcommand\demo{\xqed{$\diamond$}}  \newtheorem{example}{Example}  \begin{document}  \begin{example}  \begin{align*} f(x) &= \bigg( g(x) \bigg) \\ h(x) &= \bigg(r(x) \bigg). \end{align*}  \demo \end{example}  \end{document}      How can I achieve what I am looking for?   Any feedback is greatly appreciated. Thank you for your time.

What is the etiquette to denote the end of an example or remark? For proofs, it's the QED symbol (white box). I know it's not necessary for everyone, but I would like to use it to break up the text a little. What should I use? A circle or filled box or what?


Remove duplicates from a List in C#  I have a data reader to read the string from database.  I use the List for aggregate the string read from database, but I have duplicates in this string.  Anyone have a quick method for remove duplicates from  a generic List in C#?  List<string> colorList = new List<string>();      public class Lists     {         static void Main()         {             List<string> colorList = new List<string>();         }     }      protected void Page_Load(object sender, EventArgs e)     {         if (!Page.IsPostBack)         {             colorList.Add(variableFromDB.ToString());                      foreach (string color in colorList)                     {                       Response.Write(color.ToString().Trim());                     }         }     }

Anyone have a quick method for de-duplicating a generic List in C#?


I have a scenario where i need to generate a unique key for which i am using Guid.NewGuid() in C#, and sending this key to the user via an email when user request for it and for next 48Hrs that user will be identified by this unique key. There is no limit for the user to request for this key but only the latest one will be a valid key to identify the user. My question is when C# reached the limit to generate new key what happens then?. Do i really need to worry about it?

I'm working on a database in SQL Server 2000 that uses a GUID for each user that uses the app it's tied to. Somehow, two users ended up with the same GUID. I know that microsoft uses an algorithm to generate a random GUID that has an extremely low chance of causing collisons, but is a collision still possible?


I tried this:  ➜  /etc dpkg -l |grep php rc  php7.1-cli                        7.1.17-1+ubuntu17.10.1+deb.sury.org+1   amd64        command-line interpreter for the PHP scripting language rc  php7.1-fpm                            7.1.17-1+ubuntu17.10.1+deb.sury.org+1   amd64        server-side, HTML-embedded scripting language (FPM-CGI binary) rc  php7.1-json                           7.1.17-1+ubuntu17.10.1+deb.sury.org+1   amd64        JSON module for PHP rc  php7.1-mysql                          7.1.17-1+ubuntu17.10.1+deb.sury.org+1   amd64        MySQL module for PHP rc  php7.1-opcache                        7.1.17-1+ubuntu17.10.1+deb.sury.org+1   amd64        Zend OpCache module for PHP rc  php7.1-readline                       7.1.17-1+ubuntu17.10.1+deb.sury.org+1   amd64        readline module for PHP rc  phpmyadmin                            4:4.6.6-5                               all          MySQL web administration tool   And then I tried this:  ➜  /etc apt remove php7.1-cli php7.1-fpm php7.1-json php7.1-mysql php7.1-opache php7.1-readline phpmyadmin Reading package lists... Done Building dependency tree Reading state information... Done E: Unable to locate package php7.1-opache E: Couldn't find any package by glob 'php7.1-opache' E: Couldn't find any package by regex 'php7.1-opache'   How can I remove the remaining?  Edit: Sorry for the typo, but I corrected and ran it again. This is what I got:  ➜  /etc apt remove php7.1-cli php7.1-fpm php7.1-json php7.1-mysql php7.1-opcache php7.1-readline phpmyadmin Reading package lists... Done Building dependency tree Reading state information... Done Package 'phpmyadmin' is not installed, so not removed Package 'php7.1-readline' is not installed, so not removed Package 'php7.1-mysql' is not installed, so not removed Package 'php7.1-fpm' is not installed, so not removed Package 'php7.1-cli' is not installed, so not removed Package 'php7.1-json' is not installed, so not removed Package 'php7.1-opcache' is not installed, so not removed 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.

I suspected that installing xfce4 cause some issues in Ubuntu so I removed them using apt-get remove xfce4 xfce4-goodeis.  But when I ran 'dpkg -l' I still can see some libraries and packages for xfce4:  $ dpkg -l | grep -i xfce rc  libexo-1-0:amd64                              0.10.2-2                                 amd64        Library with extensions for Xfce rc  libgarcon-1-0                                 0.2.1-1                                  amd64        freedesktop.org compliant menu implementation for Xfce rc  libxfce4ui-1-0                                4.11.0-0ubuntu1~ppa0.13.10.1             amd64        widget library for Xfce - Gtk+2 variant rc  libxfce4ui-common                             4.11.0-0ubuntu1~ppa0.13.10.1             all          common files for libxfce4ui rc  libxfce4util6                                 4.10.1-1                                 amd64        Utility functions library for Xfce4 rc  libxfcegui4-4                                 4.10.0-2                                 amd64        Basic GUI C functions for Xfce4 rc  libxfconf-0-2                                 4.10.0-2                                 amd64        Client library for Xfce4 configure interface rc  mousepad                                      0.3.0-2                                  amd64        simple Xfce oriented text editor rc  thunar                                        1.6.3-1ubuntu1                           amd64        File Manager for Xfce rc  xfce4-appfinder                               4.10.1-1                                 amd64        Application finder for the Xfce4 Desktop Environment rc  xfce4-clipman                                 2:1.2.3-2ubuntu1                         amd64        clipboard history utility rc  xfce4-mixer                                   1:4.10.0-1ubuntu2                        amd64        Xfce mixer application rc  xfce4-notes                                   1.7.7-3ubuntu2                           amd64        Notes application for the Xfce4 desktop rc  xfce4-panel                                   4.10.1-1ubuntu1                          amd64        panel for Xfce4 desktop environment rc  xfce4-power-manager                           1.2.0-2ubuntu1                           amd64        power manager for Xfce desktop rc  xfce4-session                                 4.10.1-1ubuntu1                          amd64        Xfce4 Session Manager rc  xfce4-settings                                4.11.1-0ubuntu1~ppa0.13.10.1             amd64        graphical application for managing Xfce settings rc  xfce4-terminal                                0.6.2-3ubuntu1.1                         amd64        Xfce terminal emulator rc  xfce4-volumed                                 0.2.0-0ubuntu1                           amd64        volume keys daemon rc  xfdesktop4                                    4.11.2-0ubuntu1~ppa0.13.10.1             amd64        xfce desktop background, icons and root menu manager rc  xfwm4                                         4.11.1-0ubuntu1~ppa0.13.10.1             amd64        window manager of the Xfce project   I copy-pasted all these packages\libraries to form an apt-get remove command to remove all of these dependencies, and the command ran normally, but running dpkg -l | grep -i xfce showed these dependencies again !  Why are these dependencies still installed ?


Is " him" correct in the sentence " I solved the question more quickly than him" ?  Very often, I see 'objective case' being used. Shouldn't there be the nominative case of pronoun (he) ?

Consider the sentence "I can run faster than 15 miles per hour." Its meaning is clear and to my eyes obviously grammatically correct. Now let me present some variations that have given me trouble for a long time.  I am faster than 15 miles per hour. – To me this is clearly incorrect. Directly comparing me to a speed doesn't seem right. We need to compare my speed to a speed, or me to another person.  I can run faster than him. – Compared to the base sentence, there is a distinct shift in meaning of the comparison. While before I named a speed faster than which I can run, now I am naming a person. It doesn't seem quite right. I realize the parts of speech can change, but my initial objection is that "him" is not a speed.  I can run faster than he. – This seems most correct to me, but still somehow feels objectionable. Is this in fact the correct way to say it? And if so, is it proper as is or need I say "... faster than he can" or even "... faster than he can run?"  I am faster than him. – With "am" instead of "can run" it now seems slightly more correct. But is it?  I am faster than he. – I'm in doubt here. It doesn't seem wrong to me to say, "I am faster than he is" or even "I am faster than he is fast." (Though I suppose that is a given since I could hardly properly compare to some other category as in "I am faster than he is smart.")  My speed is faster than his. – Hmm. This seems more proper as "my speed is greater than his."   So which of these constructions is correct and which is incorrect? Is there a general rule that I can follow? UPDATE The scholarly article  may be of great interest to some readers!  Once we accept that the elided constituent and its antecedent can differ in form, it becomes reasonable to ask how large this difference can be. The answer in Rooth (1992), Fiengo and May (1994), Chung et al. (1995) and subsequent work is that the wiggle room is actually quite small: the elided constituent and its antecedent are allowed to differ only in the realization of inﬂectional morphology. Other than that, both constituents have to be syntactically and lexically isomorphic.


When an account is deleted it has an ID like user123456. Is there a way to search for questions whose OP has deleted the account? In other words, I want to list all the questions from deleted accounts. How can I do that?

We can do searches for content by user with the syntax user:xxx where xxx equals the user number. However, this does not work with deleted users.  This could be useful for the same reasons the user-based search is useful in general, of course. In the case of deleted users, this can sometimes be especially useful, though; for 10k and diamond users doing moderation duties, in particular.  In fact, this would also be a great thing to simply link directly to on the moderator's page for deleted users (perhaps in conjunction with showing deleted posts)


I just want to ask, since i started working i never asked for debit card because i was thinking of just opening bank account for my "savings" because i am saving money to travel to UK this year but i just saw one of the discussions about bank statements that the final balance doesn't matter but what matters is the cash flow on the account but on my case the account i opened is a checking account.. Would that be a problem when i apply for uk visa? Please help i am worried :'(

The UK Visas and Immigration Directorate publishes  that provides helpful tips that can result in successful visa applications. Section 2 of this guidance opens is entitled "other documents you may want to provide" (emphasis mine).  Section 2: other documents you may want to provide – all visitors This section provides guidance on the types of documents that you may want to provide to help us consider your application against the Immigration Rules. Previous travel documents/passports, which show previous travel. Financial documents showing that you have sufficient funds available.  These must clearly show that you have access to the funds, such as:  bank statements building society book proof of earnings such as a letter from employer confirming employment details (start date of employment, salary, role, company contact details) where a third party (who is either in the UK or will be legally in the UK at the time of your visit) is providing financial support to you e.g. a business, a friend or a relative, documents to show that they have sufficient resources to support you in addition to themselves and any dependant family should be provided   The first item is "bank statements" and this ties in with the , which says...  evidence that you can support yourself during your trip, eg bank statements or payslips from the last 6 months  (Note 'eg' is a Latin abbreviation meaning "for example"; this appears to be optional rather than a fixed requirement.) Question: How should someone interpret this such that the chances of success are maximized? How many statements should I submit? What are they looking for and what do my bank statements tell about me?


I know that internal forces can't do work on a system but can it do work on the bodies in a system? For example, for a ball-earth system, even though gravitational force is internal, it still did work onto the ball. So, i'm assuming that internal forces are able to do work onto an object/objects in a system?

My Mechanics textbook claims that the sum of the work by internal forces is not generally zero.  translated to English the paragraph reads:     Notice about the work by internal forces: the work by the internal forces is in general not equal to zero although the sum of the internal forces is always equal to zero. Since the work also depends on the relative displacement of the two pointmasses in the material system, the work provided by these 2 internal forces will generally not be equal to zero.   Other sources claim that the work done by internal forces is always zero.  (answer by Mark Eichenlaub)     Then I didn't do any work on the system at all since, by definition, only external forces can do work.        the net work done by internal forces is zero since they do not cause motion of the object.   To me it would seem that these sources contradict eachother. Do they? If so, which one is correct? If not, please explain why they don't contradict eachother.


Let $A \in M_{n,m}$. Is this true that $\operatorname{rank}A=\operatorname{rank}(AA^*)$?

How can I prove $\operatorname{rank}A^TA=\operatorname{rank}A$ for any $A\in M_{m \times n}$?   This is an exercise in my textbook associated with orthogonal projections and Gram-Schmidt process, but I am unsure how they are relevant.


l@ubuntu:/opt$ sudo apt-get install libx265-36 Reading package lists... Done Building dependency tree        Reading state information... Done The following packages were automatically installed and are no longer required:   fonts-cabin fonts-comfortaa fonts-dejavu-extra fonts-freefont-otf   fonts-gfs-artemisia fonts-gfs-complutum fonts-gfs-didot   fonts-gfs-neohellenic fonts-gfs-olga fonts-gfs-solomos fonts-inconsolata   fonts-junicode fonts-lato fonts-linuxlibertine fonts-lobster   fonts-lobstertwo fonts-oflb-asana-math fonts-sil-gentium   fonts-sil-gentium-basic linux-headers-3.13.0-32   linux-headers-3.13.0-32-generic linux-image-3.13.0-32-generic   linux-image-extra-3.13.0-32-generic texlive-fonts-extra-doc   ttf-adf-accanthis ttf-adf-gillius Use 'apt-get autoremove' to remove them. The following NEW packages will be installed:   libx265-36 0 upgraded, 1 newly installed, 0 to remove and 9 not upgraded. 5 not fully installed or removed. Need to get 0 B/455 kB of archives. After this operation, 2,224 kB of additional disk space will be used. (Reading database ... 335140 files and directories currently installed.) Preparing to unpack .../libx265-36_1.4~20141102~trusty~ppa1_amd64.deb ... Unpacking libx265-36:amd64 (1.4~20141102~trusty~ppa1) ... dpkg: error processing archive /var/cache/apt/archives/libx265-36_1.4~20141102~trusty~ppa1_amd64.deb (--unpack):  trying to overwrite '/usr/lib/x86_64-linux-gnu/libx265.so', which is also in package libx265-32:amd64 1.3~20140923~trusty~ppa1 Processing triggers for libc-bin (2.19-0ubuntu6.3) ... Errors were encountered while processing:  /var/cache/apt/archives/libx265-36_1.4~20141102~trusty~ppa1_amd64.deb E: Sub-process /usr/bin/dpkg returned an error code (1)

For example:  $ sudo apt-get install curl Reading package lists... Done Building dependency tree Reading state information... Done You might want to run 'apt-get -f install' to correct these: The following packages have unmet dependencies: bsh : Depends: libjline-java but it is not going to be installed groovy : Depends: libjline-java but it is not going to be installed rhino : Depends: libjline-java but it is not going to be installed E: Unmet dependencies.   Try 'apt-get -f install' with no packages (or specify a solution).   I get the same or similar errors when I attempt to install clojure1.3, leiningen, and several other packages.   When I try the suggestion made in the error message, this is what happens:  $ sudo apt-get -f install  Reading package lists... Done Building dependency tree        Reading state information... Done Correcting dependencies... Done The following packages were automatically installed and are no longer required:   diffstat linux-headers-3.2.0-26-generic linux-headers-3.2.0-26 dh-apparmor dkms html2text libmail-sendmail-perl libsys-hostname-long-perl Use 'apt-get autoremove' to remove them. The following extra packages will be installed:   libjline-java Suggested packages:   libjline-java-doc The following NEW packages will be installed:   libjline-java 0 upgraded, 1 newly installed, 0 to remove and 0 not upgraded. 23 not fully installed or removed. Need to get 0 B/72.0 kB of archives. After this operation, 129 kB of additional disk space will be used. Do you want to continue [Y/n]? Y (Reading database ... 226243 files and directories currently installed.) Unpacking libjline-java (from .../libjline-java_1.0-1_all.deb) ... dpkg: error processing /var/cache/apt/archives/libjline-java_1.0-1_all.deb (--unpack):  trying to overwrite '/usr/share/java/jline.jar', which is also in package scala 2.9.2-400 Errors were encountered while processing:  /var/cache/apt/archives/libjline-java_1.0-1_all.deb E: Sub-process /usr/bin/dpkg returned an error code (1)  $ sudo apt-get upgrade Reading package lists... Done Building dependency tree        Reading state information... Done You might want to run 'apt-get -f install' to correct these. The following packages have unmet dependencies:  bsh : Depends: libjline-java but it is not installed  groovy : Depends: libjline-java but it is not installed  rhino : Depends: libjline-java but it is not installed E: Unmet dependencies. Try using -f.


I have a player in my campaign who has recently wanted to use manacles. While the Player's Handbook entry for  describes in a pretty detailed way how difficult it is to escape from manacles, it  an unwilling creature, particularly in the chaos of lots of things happening at once that we call combat.  But that's okay: I'm a DM, and I can make something up. But I feel that I'm not really sure how to assess the difficulty of this, especially as I have no idea about how manacles actually worked in the medieval era that D&D is inspired by, beyond a general idea that "it's an old-fashioned form of handcuffs". Here are a few ideas I have:   Treat this as an improvised-weapon melee attack roll. While there really isn't a "called shot" mechanic in D&D 5e, this may be roughly the difficulty of trying to hit somebody with a stick, or maybe impose disadvantage due to the difficulty of needing to specifically get the manacles over the wrists. I'd probably require a separate attack for each wrist. That is, when a hit with manacles happens, one wrist gets enclosed in the manacles rather than it dealing damage. Treat this as a contest similar to a grapple. The rules specifically call out that  one can do. Using Strength for the character attempting to place the manacles makes some amount of sense as it's trying to "" to solve a problem, though allowing use of a proficiency in Athletics seems a little odd as it's not really a "wrestling" kind of move, and in fact the finesse needed to place the manacles where needed might almost make sense as a  check instead. For the creature attempting to avoid getting the manacles, opposing with their choice of Strength (Athletics) or Dexterity (Acrobatics) as in a grapple still seems to make sense to me. This probably would also require a separate contest per wrist. Maybe manacles aren't just "slap them on" like modern handcuffs might be. I should just disallow any attempt to put manacles on an unwilling or unrestrained creature.   How should I handle players attempting to put manacles on an unwilling creature during combat? I know that this may be a bit subjective, and I can ultimately do anything reasonable here without the world ending, but I'm hoping there are some  answers out there of people who can "back it up" with their experience of handling either manacles specifically (as I'm guessing this isn't the only group with a player who saw manacles on the equipment list and started getting ideas), or at least experience with creating new "contests" that inhibit opponents.

I can't quite find in the PHB or DMG how to slap manacles onto someone during combat. PHB 152 describes how to break out of mundane manacles, while DMG 165 shows how Dimensional Shackles work (they are essentially magic manacles -- use 1 action to bind an Incapacitated target).  Is there an official rule on how to use manacles in combat, or do we have to use house rules?


I am making a Nintendo 64/ PS1 inspired game in Unity. I know that those consoles did not have lighting and instead used vertex colors on textured models to add variations in light and in color to save on space. Like Banjo-Kazooie, TLOZ: Ocarina of Time, Spyro, etc.  Here is another example:   I would like to use this technique in my level models and then export them to Unity, but I can't find a way of doing it. The best I could find is this video, but it doesn't work for me when I do it, and it does not explain much of what they are doing:  If anyone knows how to do this, please do tell. Thanks!

In order to demonstrate my problem, I created a simple scene with a cube and I used Vertex Paint to color one corner.    When I export to COLLADA, I make sure that "Include Material Textures" is checked.    The vertex colors are not saved properly.  I've verified this by importing the COLLADA file back into a new Blender file and also by importing it into MeshLab, Sketchup, Photoshop and 3DS Max, none of which showed colors.  I know the Stanford PLY format also supports vertex colors (and it worked well for this same cube), but the actual scene I'm dealing with has thousands of little complex objects and PLY can only export one object at a time.  I could write a script to export each object, but I'd rather get into one file.  (using Blender 2.69, Linux 64-bit, any more info needed?)


When I check permission of less files from the command line on my Snow Leopard OSX system using Bash I see -rw-r--r--@ for certain files and for others I just see -rw-r--r-- What does the @ mean here?

I am using Mac OSX. When I type ls -l I see something like   drwxr-xr-x@ 12 xonic  staff    408 22 Jun 19:00 . drwxr-xr-x   9 xonic  staff    306 22 Jun 19:42 .. -rwxrwxrwx@  1 xonic  staff   6148 25 Mai 23:04 .DS_Store -rw-r--r--@  1 xonic  staff  17284 22 Jun 00:20 filmStrip.cpp -rw-r--r--@  1 xonic  staff   3843 21 Jun 21:20 filmStrip.h   What do the @'s mean?


Given any strictly-increasing continuous function $f$ such that $f(0) = 0$ and $f(1) = 1$, show that $$\int_0^1 [f(x)+f^{-1}(x) ]dx= 1.$$  I tried using mean value theorem but it won't work. I tried few examples it is correct.   Edit:  If I draw  graph of picture, and seeing integral as area, we can see the integral is just area of the square $\{(0,0),(0,1),(1,1),(1,0)\}$.   Please give me a hint to attack this problem analytically.

If $a,b$ are fixed points of $f$, then $$ \int_a^b \left[ f(x) + f^{-1}(x) \right] \, \mathrm{d}x = b^2 - a^2 $$   In the words of 2014 MIT Integration Bee Champion (Carl Lian), the above property was responsible for the champion's victory in the 2013 MIT Integration Bee. How does one go about proving this property?


As you can see the proof is divided into 2, the first part consists on proving that $\rho(x,y)$ is a metric  My attempt  i) $\rho(x,y) \geq 0$, which is clear since $d(x,y)$ is a metric, and it is $0$ if and only if $x=y$  ii) Symmetry, which also comes from the fact that $d(x,y)$ is a metric  iii) The triangular inequality, for which I have already proven that $f(x)=\frac{x}{1+x}$ is non decreasing, however I am stuck proving f(x) is concave. A fact that I need in order to show that $f(d(x,y)) \leq f(d(x,z)) + f(d(y,z))$ which I need to show the triangular inequality. I know how to prove a function is concave, I am only getting a little bit stuck on the algebra.   For the second part, I know that the $\rho(x,y) , d(x,y)$ metrics are equivalent if $\exists c_1, c_2 \in \mathbb{R}$ such that $c_1d(x,y)\leq \rho(x,y) \leq c_2d(x,y)$   I have proven that $\rho(x,y) \leq d(x,y) $ since $\frac{1}{1 + d(x,y)} \leq 1$ Hence, $c_2 = 1$. However I can't get the other inequality.

Let $(X,d)$ be a metric space and for $x,y \in X$ define $$d_b(x,y) = \dfrac{d(x,y)}{1 + d(x,y)}$$ a) show that $d_b$ is a metric on $X$  Hint: consider the derivative of $f(t)$ = $\dfrac{t}{1+t}$  b) show that $ d$ and $ d_b $ are equivalent metrics. c) let $(X,d) $ be $(\mathbb{R}, |\cdot|)$ Show that there exists no $ M>0$ such that $ |x-y| $ $\leq$ $Md_b$ $(x,y)$ for all $ x,y$ $\in$ $\mathbb{R}$  I have calculated $f(t)$ and $f'(t)$ and from this I know $f(t)$ is an increasing function as $f'(t)$ is strictly positive. But I don't know where to go from here or how to do parts b) and c)


I'm trying to model a spaceship and I ran into this weird predicament. I'm using a mirror modifier as can be seen and I get this annoying crease:   If I enter edit mode, you can see that the verticies are connected:   And adding mean crease doesn't fix much:   What's a good way to fix it?

was following a tutorial where I stumbled into this weird line in my mirrored mesh (sorry for the feet lol)      You can also download the blender file


I'm getting and object from an api that looks like this -  data = {    ...    filter: "[1,2,3]"    ... }  Now, i want to take that string of array and convert it to array of numbers, that is [1,2,3].  Thanks a lot

Given a string of JSON data, how can I safely turn that string into a JavaScript object?  Obviously I can do this unsafely with something like:  var obj = eval("(" + json + ')');   but that leaves me vulnerable to the JSON string containing other code, which it seems very dangerous to simply eval.


I'm looking for a book I read when I was younger, around 2000 or 2001. (It was for an assigned reading group in elementary school, so it's about on a similar reading level as The Supernaturalist by Eoin Colfer, which was assigned for the same group but otherwise has nothing to do with the book I'm looking for.)  The book was about a girl and her little brother. I don't remember what happened to their parents, but the pair wound up on the run, hiding from society because they both had magical talents. In the book, the countries were holding a staged war that only people with magical talents were drafted to fight in - ostensibly because people without magic would be at a disadvantage when fighting magic-users, but actually because it was a good way to kill off everyone with magic.  The two fail to escape the war, but in the chaos of battle, they cross the border and wind up in a country they've been trained to fear. They hired at a castle or very large manor, and pretend to be citizens of the new country without magic. The girl's talent is an ability to communicate with animals so she just doesn't talk to them in front of anyone, and it's not made clear until the end of the book what her brother's talent is, but suffice it to say they can reasonably pretend not to have magic when they need to. Actually, the girl and her brother briefly join a wolf pack (before they got sent to war in the first place) and the wolves tease the girl for "burning" (cooking) her meat.  The girl, of course, falls in love with the lord of the manor, and he begins to confide in her as well, and after hearing some of his secrets, she tells him most of hers.  Major plot developments included the reveal that dragon scales in the soil were responsible for people's magic talents, and that the love-interest-guy was hiding dragon hatchlings in his basement (the governments thought they had hunted dragons to extinction). Also the brother's talent turned out to be manipulating humans to do whatever he wanted; it wasn't perfect mind control but it was enough to keep people off his scent for the most part while also making his life easier.  I think the brother ran away in the end, after causing some problems. There were lots of loose ends, left wide open for a sequel, so I really want to find this book again and hopefully read the whole series. Also if I remember right, the main character's name wasn't quite Melanie, but it was similar and had a y in the middle somewhere, but I'm less sure about that detail

I read this novel when I was young. It is probably a children's or young adult novel. I think I read it in 1997 or earlier. I remember very much enjoying it, but the title and most of the details are unfortunately quite hazy for me. Here is what I have:   The main character was a girl in her early teens (I think) She was sent to live with a man who was some sort of master of dragons She may have been related to this man (his niece, perhaps), but I also may have made that up The man wore gloves at all times. When he removed them and touched someone he could see something about them. Their future, I think?   Sound familiar to anyone?   Update: Thinking back on it some more, I think I remember that the dragon lord guy and the heroine ended up in some kind of romantic relationship (making it less likely that he was her uncle). Also, he did at one point take off his gloves and touch her, seeing her future (I think).  'nother Update: It's possible that I'm confusing dragons with volcanos. Or, there may have been both. And I think they lived on an island, or a coastline?


I'm going to Canada on vacation with my significant other. I have an engagement ring and want to propose while there. We are both US citizens and I bought the ring in the US.  I'm concerned that I won't be able to bring the ring through customs at the border without alerting my significant other.  I have two questions:  1. Do I need to declare the ring?  I read the , and two places sound like the answer is "yes", but I'd like to make sure:   Duty-free allowance only applies to gifts (excludes alcohol and tobacco) valued at no more than CAN$60 each.  Does the ring qualify as a gift, even though it's for someone traveling with me? Each traveller is responsible for reporting currency and/or monetary instruments totaling CAN$10,000 or more that are in his or her actual possession or baggage.  Does the ring count as a "monetary instrument"? Its appraised value is over $10,000 CAN.   2. If I do declare the ring, will it obviously alert my significant other? In other words, would I likely need to discuss the ring with a customs officer, show appraisal paperwork, etc. in front of my significant other?

A related , made me wonder how you can hide a ring from a "special one" traveling with you to a place where you will propose and yet get it legally through security or customs? You don't want the surprise to be killed by a bureaucrat.


How did they go from (1) to (2): \begin{align*}       S_{xx} &= \sum(X_i - \bar{X})^2 \tag1 \\               &= \sum(X_i - \bar{X}) X_i \tag2 \\              &= \sum X_i^2 - \left(\sum{X_i}\right)^2/n \\              &= \sum X_i^2 - n \bar{X} \end{align*} In (2), are they simply saying that $(X_i - \bar{X}) = X_i$? Why is that so?  It is also seen here in OLS equation: $$b_1 = \frac{\sum X_i Y_i - \left[\left(\sum X_i \right) \left(\sum Y_i \right)\right]/n}{\sum X_i^2 - \left( \sum X_i\right)^2 /n} = \frac{ \sum\left(X_i -\bar{X}\right) \left(Y_i - \bar{Y}\right)}{\sum \left(X_i - \bar{X} \right)^2}$$  The technique is used again in the denominator, when they go from middle equation to the right. Why is it?

A probably very easy computational question, but I don't really understand how it's done:  I try to compute the point estimates of a normal distribution as $N \sim (\beta, \sigma)$. Using the method of moments, we get:  $$\frac{1}{n} \sum_{i=1}^{n} X_{i} = \hat{\beta}$$  $$\frac{1}{n} \sum_{i=1}^{n} X_{i}^{2} = \hat{\sigma}^2 + \hat{\beta}^2$$  Solving the two equations for the two parameters, we get:  $$\hat{\beta} = \overline{X} $$   and   $$\hat{\sigma}^2 = \frac{1}{n} \sum_{i=1}^{n} (X_{i} - \overline{X}_n)^2 $$  My question is: How do we get to the term of $\hat{\sigma}^2$? If I try to compute it, I get:  $$\hat{\sigma}^2 = \frac{1}{n} \sum_{i=1}^{n} X_{i}^2 - (\frac{1}{n} \sum_{i=1}^{n} X_{i} )^2 $$  Can someone show me how to simplify the last term to what is stated above and what "rule" or law" is used there? Since it is used so often, I really wanna understand this.


I'm having hard time understanding difference between $@ and $* when passing them to functions.  Here is example:  function a {     echo "-$1-" "-$2-" "-$3-"; }  function b {     a "$@" }  function c {     a "$*" }   If calls:  $ b "hello world" "bye world" "xxx"   It prints:  -hello world- -bye world- -xxx-   If calls:  $ c "hello world" "bye world" "xxx"   It prints:  $ c "hello world" "bye world" "xxx" -hello world bye world xxx- -- --   What happened? I can't understand difference and what went wrong.

I have a complex command that I'd like to make a shell/bash script of.  I can write it in terms of $1 easily:  foo $1 args -o $1.ext   I want to be able to pass multiple input names to the script. What's the right way to do it?    And, of course, I want to handle filenames with spaces in them.


I recently attempted to make  which required procuring some special ingredients (liquid glucose and powdered dextrose). I had high hopes for a very silky-smooth, creamy gelato. I followed the instructions closely, except I did not cool the mixture over an ice bath (I let it come to room temperature then put it in the fridge). But the result after churning and freezing was a very icy mixture that resembled more of a sorbet. The flavor was good but texture obviously off. I assumed this stemmed from the 100ml of brewed espresso which has a rather high water content, but this doesn’t seem to be too different from other coffee-flavored ice cream recipes. Any ideas of where I went wrong?

I have bought a electric ice-cream churner, I have tried so many different flavours, different recipes, used alcohols. Have read previous questions and a don't believe that leaving ice-cream out to thaw -scoop then refreeze is the only answer.How do the commercial companies keep them soft. I generally find the next day it is fairly reasonable to scoop, but day after day -the longer it stays the harder it becomes.


I am trying to read a file that contains an ASCII header and binary data sections, but the Python interpreter appears to close the file prematurely (i.e. before the end of file is reached). Here is my code, developed in Python 2.7.12:  fileSize = os.path.getsize(filename) # file size in bytes bytesRead = 0L content = [] with open(filename,'r') as f:     content = f.read()     bytesRead += sys.getsizeof(content)  print 'File size:',fileSize print 'Total read:',bytesRead   However, the file is closed prematurely after around 1MB of the total 77MB of the file has been read.  print 'File size:',fileSize print 'Total read:',bytesRead   produces: File size: 76658457, Total read: 1165436  It exits within one of the binary sections. I moified the original program to iteratively re-open the file from the point that it was closed, as follows:  fileSize = os.path.getsize(filename) # file size in bytes bytesRead = 0L content = []  try:     while True:         count += 1         with open(filename,'r') as f:             f.seek(bytesRead+1)             newContent = f.read()             content.append(newContent)             bytesRead += sys.getsizeof(newContent)             print count,' Total read:',bytesRead except Exception,e:     print e  print 'File size:',fileSize print '% read = ',bytesRead*100./float(fileSize) print 'count: ',count   This gave:  1 Total read: 1165436 2 Total read: 1180218 3 Total read: 1181902  ... [many more iterations] ...  25564 Total read: 77925641 25567 Total read: 77926615 25568 Total read:Exception: I/O operation on closed file  File size: 76658457 % read =  101.65429721603 count:  25568   Any idea how I can persuade Python not to keep closing the file, and just read it all in one go?

I have the following file:  abcde kwakwa <0x1A> line3 linllll   Where <0x1A> represents a byte with the hex value of 0x1A. When attempting to read this file in Python as:  for line in open('t.txt'):     print line,   It only reads the first two lines, and exits the loop.  The solution seems to be to open the file in binary (or universal newline mode) - 'rb' or 'rU'. Can you explain this behavior ?


I would like for the focal length of the camera to shift from 20 to 200 as the animation progresses.  Is this possible ?  Thank you!

Is it possible to animate zooming in on an object, or is moving the object the only option available to get it to appear closer to the camera?


We have a bottle of saki that I use for cooking occasionally, but I haven't used it in about 6 months, and the bottle has been in the fridge for over a year. Is this still good or can I reclaim that space in my fridge?

We've had Sake chilling in our fridge for about a year now. It has been opened. Is this still safe to drink or is it time to throw it out?


Often, if a WCF endpoint is unavailable (in my case, usually because the service host is not running), I'll get an EndpointNotFoundException after a timeout.  I'd like to have a fast way to query the service to see if it's available without having to rely on the normal timeout.  In other words, I want to keep a normal timeout for normal circumstances, but for a quick "ping" of the endpoint, I want it to fail fast if it's not available right away.  How could this be accomplished?

I want to check the availability of the WCF web service i.c service is up or down through  the C# code. How to achieve that?


Suppose it is possible, through many steps, to move from the permutation $\pi$ to the permutation $\sigma$ by multiplying, at each step, by a transposition.  Knowing that they are not necessarily conjugates, I want to find:   In how many ways (The maximum number) I can move from $\pi$ to $\sigma$.  bound the maximum number of steps needed to switch from $\pi$ to $\sigma$ (is there a reference).   EDIT 2 In other words, as  proposed:  Let $d(\pi,\sigma)$ be the length of the smallest sequence of transpositions we need to multiply by the permutation $\pi$ to take it to $\sigma$.    How can I bound or even calculate the number of sequences of length $d(\pi,\sigma)$ which take $\pi$ to $\sigma$? (I am looking for any idea) How can I bound or even calculate $d(\pi,\sigma)$ (This one is answered as explained above)?    It is known that the number of transpositions in the symmetric group $S_n$ is $\frac{n(n-1)}{2}$ and also it is possible to decompose a certain permutation into disjoint cycles, but I don't how to collect these results to answer my question!  Any kind of help is appreciated.  EDIT 1: I don't think my question is a duplicate! it consists of two parts and the marked question answers only one question! The linked question is not talking about the first part of my question!

For a permutation on $n$ elements, what is the worst-case minimal number of transpositions that need to be multiplied to give the permutation? The transpositions do not need to be adjacent.


I might be getting things wrong, but I know at least that I don't want this behaviour.  I have a while loop in JS, inside a function. Global vars are passed into the function.  Yet when the loop runs, the global variables are changed, alongside the ones inside the function.  Example  var arr = [0, 1, 2, 3, 4, 5]; var i = 0;  function test(myArr) {     while(i < 2)     {         myArr.pop();         i++     }      console.log(arr);     console.log(myArr); }  test(arr);   The console spits out  [ 0, 1, 2, 3 ] [ 0, 1, 2, 3 ]   Why is the global being affected?

The primitive types (number, string, etc.) are passed by value, but objects are unknown, because they can be both passed-by-value (in case we consider that a variable holding an object is in fact a reference to the object) and passed-by-reference (when we consider that the variable to the object holds the object itself).  Although it doesn't really matter at the end, I want to know what is the correct way to present the arguments passing conventions. Is there an excerpt from JavaScript specification, which defines what should be the semantics regarding this?


I need to get  string array from string line. It is possible ?  main(){  string x = "This is string";   //do something, function or... i don't know...  //result   cout << string[0] << string[1] << string[2] << endl;   //cout << "This" << "is" << "string" << endl; }   How to do this array ??! Ty ;)

I'm trying to iterate over the words of a string.  The string can be assumed to be composed of words separated by whitespace.  Note that I'm not interested in C string functions or that kind of character manipulation/access. Also, please give precedence to elegance over efficiency in your answer.  The best solution I have right now is:  #include <iostream> #include <sstream> #include <string>  using namespace std;  int main() {     string s = "Somewhere down the road";     istringstream iss(s);      do     {         string subs;         iss >> subs;         cout << "Substring: " << subs << endl;     } while (iss); }   Is there a more elegant way to do this?


The question:   Determine the number of positive integers that divide at least one of the numbers $3680$ and $100$.  The answer:   We have that $3680 = 2^5\cdot5\cdot23$ and $100 = 2^2\cdot5^2$  The number of positive integers dividing $3680$ is therefore $6\cdot2\cdot2$, the number of positive integers dividing $100$ is $3\cdot3$, and the number of positive numbers that divide both $3680$ and $100$ is $3\cdot2$. The number sought is thus $24 + 9 − 6 = 27$  What I need help with  I don't understand the resesing for dividing $3680$ is therefore $6\cdot2\cdot2$ and dividing $100$ is $3\cdot3$

I need to find the number of divisors of 600. Is there any other way to solve the problem, apart from writing them down and counting??


I got the following LaTeX-code (only an example):  \begin{align} A=&0\\ 0=& x y z re+ e\\ 0\underbrace{=}_{\text{with bla bla bla bla}& u+z-24y \end{align}   Now, I want that one equal signs is exactly the others, but the one where the underbrace is included is always shifted to the right.  Edit:   \documentclass[11pt,a4paper]{article} \usepackage[utf8]{inputenc} \usepackage{amsmath} \usepackage{amsfonts} \usepackage{amssymb} \usepackage[left=2cm,right=2cm,top=2cm,bottom=2cm]{geometry} \begin{document} \begin{align} a+b=&0\\ 0=&z+u+i+v\\ 0\underbrace{=}_{\text{inserting bla bla bla}}&43+2 \end{align} \end{document}

I want to typeset a proof and want to emphasize what I do in each step e.g. by underbracing an equal-sign when I substitute a variable. In addition I also want to align equal-signs in every line. Unfortunately I don't know how to align an underbraced equal-sign and a non underbraced equal-sign at the same time.    Question: How can I align the underbraced and the non underbraced equal-sign vertically?  \documentclass{report}  \usepackage{amsmath} % Mathe \usepackage{mathtools} % Mathe \usepackage{amsfonts} % Mathesymbole  \begin{document}  \begin{align*}     D(D^TD)^{-1} &\underbrace{=}_{\mathclap{D=B(B^TB)^{-1}}} B(B^TB)^{-1}((B(B^TB)^{-1})^TB(B^TB)^{-1})^{-1} \\       &= B(B^TB)^{-1}(((B^TB)^{-1})^TB^TB(B^TB)^{-1})^{-1} \end{align*}  \end{document}


I've built a blogging system which allows multiple short posts to be added daily, each with a photo to represent the article content.  So each photo is in JPG format and a max width of 280px, but a variable height - Possible over 2000px if it's a set of photos grouped together into one image.  So my concern is how many images to store in the blogs administative directory:  blog.com/images/2019 ( /sub-directory )   If using a simple <img src="images/<?php echo $year."/".$id; ?>.jpg" /> tag, to get and display the image, is there a point where it starts to slow down your pages photo load time if too many images are stored in /sub-directory?  Would it be recommended to split down sub-directory by month, week or even day? Having 365 folders per year seems a little extreme compared to 52, but what are yor recommendations?

how many files in a diretory will be decrease server performance? I have a website that contain hundreds thousand of images ( >a million in separated directory). I wonder if it will effect the performance.  server detail: centos, apache, php 5


I always read this (for example), but example is a countable noun. So, I think it should be 'for an example'.  Please check both sentences and let me know, which one is correct:     Knowing the weather will help you prepare your clothes, as well as   plan your commute. For example.   VS     Knowing the weather will help you prepare your clothes, as well as   plan your commute. For an example.   Please note:      My focus is just on for an example or for example. I do not care about   the entire sentence.

In formal writing, if I have 2 examples to depict what I said earlier, can I start writing a sentence using 'for another example' form after explaining my first example using 'for example'? More clearly:  for example, bla bla bla.... . for another example, bla bla bla ... .  is this construction suitable in formal writing?


If $$\dfrac1{\sin1°\sin2°}+\dfrac1{\sin2°\sin3°}+\cdots+\dfrac1{\sin89°\sin90°} = \cot x\cdot\csc x$$ and $x\in(0°,90°)$, find $x$.   I tried writing in $\sec$ form but nothing clicked. Any ideas?

Find the sum of the finite series $$\sum _{k=1}^{k=89} \frac{1}{\sin(k^{\circ})\sin((k+1)^{\circ})}$$ This problem was asked in a test in my school. The answer seems to be $\dfrac{\cos1^{\circ}}{\sin^21^{\circ}}$ but I do not know how. I have tried reducing it using sum to product formulae and found out the actual value and it agrees well. Haven't been successful in telescoping it.


I need to boot the same windows installation from my pc and laptop as well, where I will find all of my installed applications and settings and whatnot.  I have done this in the past and it has worked when moving from old pc to new one, but I don't know if this is reliable or if I am even supposed to do this every two weeks.   So far I have only worked from my desktop where I feel most comfortable working than laptops. But I need to travel more on the upcoming months and I'll be carrying a laptop. It's going to be such a pain constantly trying to sync applications and setting between every time I need to head out and come back and switch between my pc and laptop.   What should be solution here instead of syncing back and forth? Will the hard drive swapping reliable?  Should I instead setup a vm? Anyone used it so far or daily use? In my experience it seems a bit laggy.   I want to continue working on my desktop when I'm home and only use laptop on the go.  I also don't mind buying additional windows licenses if I need to.

I have a laptop in which the internal drive bay has been destroyed, but the rest of the laptop works fine. I was wondering if it's possible to do a full installation of Windows 10 on a USB flash drive.  I'm aware of Windows To Go, but I'm not sure if it's what I want. I don't need a "portable" installation of Windows, I intend for the flash drive to be permanently connected to the computer. I would prefer for the system to function as normally as possible.  If I can't figure out how to do this, I'll probably just install Linux onto the flash drive instead.


Sometimes after I do some modifications with model or duplicate and do some modifications then the origin point of the model goes out of the model and it becomes hard to rotate/scale and do anything else with the model.  Here is a screenshot:

So, I'm working creating a lamp... yes, newbie here.  After modeling for a bit, I noticed that my point of origin was no longer the center of my object:    How to I reset an object origin point to the center of it's geometry?


I'm sure it's easy to google, but I have no idea how to phrase it to find it. I'm super new to blender and trying to model a spoon, and this is where I'm stuck:     How do I get rid of this? I tried doing a loop cut, I tried removing every other edge inside, so I get 4 corners instead of 3 - it only seems to make it worse. Any tips for a beginner?

When I create a UV sphere and add the subdivision surface modifier, the following wrinkle appears.    How can I avoid it?  I've read the article  but there seems to be no clear solution.  UPDATE 1  I've used the word 'apply' in the first sentence of the initial version of this question. It's misleading since I want to preserve the modifier without 'applying' it. Rather, what I meant is 'adding' the modifier.  UPDATE 2  I followed josh sanfelici's solution, but still there is an artifact at the pole.  Here is the screen: (A rendered view with a sun lamp)    Maybe it's the limitation of the general-purpose subdivision modifier.  BTW, when the cast modifier is added after the subdivision modifier, the sphere becomes perfect (even for my original wrinkled sphere).  But since I want to edit the resulting sphere (for example, scaling X, Y, etc) while modifier is added but not applied, it's not usable.


I want to say I saw this in the mid 90's, I believe it's likely from the 90's or late 80's.  The ozone layer had become so depleted or Sun became too strong such that it would cause horrific burns, even death due to exposure. The main character was at one point, roughed up by the school bullies and left outside in the sun to suffer severe burns; he's able to free himself and tells his teacher why he's late, but they teacher doesn't believe him because it's impossible for him to be unscathed if true.   The main character is fine because his parents, a geneticist and botanist have tinkered with his genes.

Okay, this is a hard one as I don't remember very much, and can't figure out what to Google, but here goes. This is one of those 1990 straight to VHS type movies (probably) with decent production value.   From what I remember, a family moves to a dangerous, hot environment where you would be burned outside in the day in a short period of time. The father is possibly a scientist, and is working with plants (maybe reptiles) in the family's basement. The boy becomes affected by his father's work and is an outcast at school. One scene involved him being left outside to burn tied to a post, where he survived due to his affliction. His dad may form into a planet like creature in the end, or the planet is eating his family..possibly.  This may be all in my head, but I am pretty sure it was a movie.


Just to preface I'm new to blender and all 3d software. I have an object I imported into blender from SFM. I notice on some objects that there are seams when the normal map is used. Even if I just load a blank image, there are noticeable seam issues when a normal map node is connected.  I'll share several images to show what the issue is. I've tried converting to quads, removing doubles, recalculating normals and nothing seems to work. I've tried texture painting them but it doesn't work for these seams. I've manually selected faces and flipped normals and it still has a seam.  All normals are facing the right way. The normal map itself doesn't have seams (if I view it in texture painting). I imagine it's an issue with the UV mapping but I'm not sure I can fix it without a deeper understanding of UV mapping.  The first image is the normal map and texture applied showing the seam:    The second image I removed the normal map texture but there's still a seam and shadow issue:    In this image I disconnected the normal map node and it has no seam.    Here's the mesh polygons, no messed up edges or anything:    No normal map or texture, mesh looks fine:    In the final image I have no texture and no normal map texture, but the blank normal map causes these messed up seams.    For this particular model it's not really a big deal, but I have some human models that the same thing happens on. Is this just an issue of the original source or is there any options I can change to fix the issue?

I'm having a small issue with visible seams on normal maps. The map was painted on Substance Painter and has no weirdness around seams. When I plug it into a Normal Map node set to Tangent Space this happens:   (it's a horse underside)  When I set the map to Blender Object Space the seams become nearly invisible, as they should be, but the shadows also looks awful.    What can be done to minimize the issue? I need to be able to use maps on tangent space. Moving the seams or hiding them under other stuff isn't always feasible.


If $U, V, W$ are subspaces of a vector space $X$ and if $U$ is a subspaces of $W$, then $$(U+V) \cap W = U + (V \cap W)$$    Do we need also that $V$ is a subspace of $W$? I can't see how to prove this otherwise.  This is typed up by my professor so it's definitely possible there's a typo.

Let $X,Y,Z$ be subspaces of $V$ so that $X$ is a subspace of $Y$. Prove that $Y\cap (X+Z)=X+(Y\cap Z)$  I know that I need to prove that $Y\cap (X+Z)\subseteq X+(Y\cap Z)$ and $X+(Y\cap Z)\subseteq Y\cap (X+Z)$ but I´m having a hard time.  Can you lend me a hand please? I would really appreciate it


The full question states:       Show that $$\int_0^\pi f(\sin\theta)\,d\theta = 2\int_0^{\pi/2}f(\sin\theta)\,d\theta$$ for an arbitrary function $f$ defined in the interval $[-1, 1].$     Having tried out different possible functions for $f$ (rational, radical, exponential, etc.) I know that the equation indeed holds true, but I have no clue as to how to go about proving it. It has been suggested to me that the proof might involve the use of multivalued functions since a particular interval was defined but I don't see how this could be the case since neither the sine nor complex sine functions are multivalued as far as I know.  Any help would be greatly appreciated.

Any tips on how to show that $$\int_0^\pi f(\sin x) \, \mathrm{d}x = 2\int_0^{\pi/2} f(\sin x) \, \mathrm{d}x \text{ ?}$$


I am completely new to ubuntu, and I created a live usb with ubuntu 14.10. I booted up to the usb, but it was soo slow compared to using the test version of ubuntu. How can I get my live usb to run nearly as fast as the test version of ubuntu but still be able to install programs to the usb and save files without them getting deleted on restart?  A little bit of further background: I have two usb's. A two gig sd card, and a 32 gig thumb drive. I booted to the (iso) test version of ubuntu on my two gig sd card and formatted the 32 gig thumb drive and installed ubuntu 14.10 to it. I shut down and removed my 2 gig (try ubuntu) sd card. I then booted my computer back up and ran the official copy of ubuntu off of my Usb Thumb drive, but since it was no longer running from ram, it was incredibly slow and lagged so bad. I would like to have this thumb drive as a portable Operating system that I can boot to multiple computers, but I cannot run at this slow rate. Is there a way to load more data to the ram so that it runs faster? Utimately, I would like to be able to run the majority of the OS in ram, but be able to install programs to the usb thumb drive, and save files (like cpp files) to the usb as well.

I have used  to create an installable / live bootable flash drive from Ubuntu 12.04. However that didn't preserve the normal Ubuntu boot menu which allows to me to enter advanced options. It has a custom menu that I can pick from predefined choices like "Install Ubuntu" and "Try Ubuntu without installing". What I would like is to be able to boot from the USB flash drive, but then be able to remove it from the computer once the desktop has loaded. The laptop I would like to use this on does not have an optical (CD/DVD) drive - nor do I have a USB version available.  What do I need to modify on the flash drive to add an option to "Try Ubuntu (RAM)" that passes the TORAM=yes parameter to the initrd options? Are their other things I need to touch/change as well? Is it even possible? I am not restricted to version 12.04 if that makes a difference.  Bonus: I would guess the answer would also allow for other options like acpi=off as well, but if it is different I would appreciate having that answer too.


F is a Field implies F[X] is a Principal Ideal Domain. But is the converse true? Can we also always say that if F[x] is a PID then F is a Field? I follow Gallian's Contemporary Abstract Algebra wherein is a Theorem stating F is a Field implies F[x] is a PID. The converse isn't given. I had come across the converse in a few answers to the question asked here: . Hope you understand the context.

Let $K$ be a field. Then $K[x,y]$ is not a PID because $x$ is irreducible but the quotient $K[x,y]/(x)$ is isomorphic to $K[y]$, which is not a field.  So there must be an ideal in there which is not principal. What is an example of such an ideal?


Hi first of all I'm very sorry for posting question that has been asked a lot before  but none of those couldn't solve my problem I had problems with creating JAVA_HOME variable and at the meanwhile I accidentally deleted path variable in user section I'll be grateful if you can help me restore it or do something about it

I accidentally deleted the Path environment variable by creating a new one with Path name. How can I restore my old Path environment variable?


I am following the . In "II. ONLINE HANDLING OF MANUSCRIPTS " under "C. Preparation for online submission" they write:  Properly prepared manuscript/article file in LaTeX or Word format. Authors who wish to use LaTeX should use the JASA LaTeX package, which is available here: . (The requirements for a properly prepared manuscript are given further below.) It must be a single stand-alone file. If the author wishes to submit a LaTeX file, the references should be included in the file, not in a separate BibTeX file. Authors should take care to ensure that the submitted manuscript/article file is of reasonable length.  All of their supplementary materials, which can be found  only give examples using BibTex. My paper is also using BibTex. Is there any way to include the references into the tex file? Am I missing something?

I am submitting my first article to ArXiv and in the instructions they specify I have to include the .bbl file. Their instructions are:  "We do not run BibTeX in the auto-TeXing procedure. If you use it, include in your submission the .bbl file that BibTeX produces on your own machine; otherwise your references will not come out correctly. We do not run BibTeX because the .bib database files can be quite large, and the only thing necessary to resolve the references for a given paper is the .bbl file. The name of the .bbl file must match the name of the main .tex file for the system to process the references correctly."  My knowledge of LaTeX is basic, and I have not heard of .bbl file before. I am using TeXmaker. I have my tex file and my bib file. So what do I exactly do to obtain the .bbf file correctly and submit the article?  Thanks a lot!


What does the below e-mail mean?  This is an email to confirm that your UK visa application has been approved and will now be returned to the Visa Application Centre if you applied through Amman, Cairo or Beirut.  Please allow the following transit times:  Amman, Cairo, Beirut: 2 days  Erbil,  Baghdad, Basra: 5 working days Jerusalem: 5 working days.  You will be contacted by the Visa Application Centre - by e-mail - when your passport and documents are ready for collection. Please do not go to the Visa Application Centre before they have contacted you.   If you have not been contacted, please attend the application centre after the proposed transit times as stated above.  PLEASE DO NOT CALL THE LOCAL BRITISH EMBASSY OR CONSULATE GENERAL AS THIS IS A DIRECT DESPATCH FROM THE UKVI OFFICE IN AMMAN.   If applied from Iraq: Your decision will be despatched and returned to you by Aramex courier. If you have applied from Jerusalem: your decision will be returned to you by Aramex courier. If applied from Ramallah: Please note that there is a 2-3 days courier transit period from Amman to The OPTs. You can collect your decision on the next Wednesday allowing for the 2-3 days courier transit period. If you have elected to receive your decision via Aramex, please allow for 3 days and contact your local Aramex office. They should also contact you to advise you to collect your decision. Please note- as advised that there is a fee of 50 NIS on collection by Aramex and this has to be pre-arranged.    You are reminded that you should avoid making travel plans until you have collected your passport.   Please note that only your original documents will be returned. All translations, copies and letters addressed to UKVI will be retained for our records.  If you need to contact us you can do so via our International Enquiry Service at www.gov.uk/contact-ukvi-outside-uk  Kind regards,   Regards UK Visas and Immigration  British Embassy Amman www.gov.uk/ukvi

Your UK visa application has been issued.      PLEASE DO NOT GO TO THE VISA APPLICATION CENTRE BEFORE THEY CONTACT YOU.      You will be contacted by the Visa Application Centre when your documents are ready for collection, or have been dispatched via courier where this is relevant.       You are reminded that you should avoid making travel plans until you have collected your passport, as the outcome of your visa application is not final until you receive your passport.      Please ensure you check the details on your visa when collecting your passport. If you need to contact us you can do so via our International Enquiry Service at www.gov.uk/contact-ukvi-outside-uk      Kind regards,      UK Visas and Immigration   British Embassy Abu Dhabi     Your UK visa application has been issued.   I know words like processed, forwarded, received, refused but never heard anything like that, so I am confused.


Does the Spirit Guardians spell trigger its saving throw if you, as the caster, close the 15-ft. gap? Or only when the enemy uses its movement to come into the spell's radius? Spirit Guardians says:  when the creature enters the area for the first time on a turn or starts its turn there, it must make a Wisdom saving throw.  For instance, say I'm 30 feet away, and I use 15 feet of movement to bring myself within range of the monster to put it within the spell's range. Does that initiate the "when the creature enters the area for the first time on a turn" trigger for the spell's saving throw? Or would the creature have to close that gap itself?

The description of the moonbeam spell (PHB pg. 261) says:  When a creature enters the spell's area for the first time on a turn or starts its turn there, it is engulfed in ghostly flames that cause searing pain... On each of your turns after you cast this spell, you can use an action to move the beam 60 feet in any direction.  We read this to mean a creature takes damage from moonbeam when any of the following conditions are met:  It begins its turn inside the moonbeam It enters the moonbeam on its turn The creature finds itself inside the beam on another character's turn, no matter how it got there  The creature will not take damage in the following instances:  A creature moves from one part of the beam to another (obviously it had to take damage, but it won't take more damage) A creature is in the beam after having been inside the beam already on that turn.  Following these assumptions, our druid cast a moonbeam and did damage to two enemies, Bob and Frank. On their turn, they took damage again, killing Bob. Frank left the beam. On the druid's next turn, she moved the beam in a circular motion, not exceeding 60 total feet of movement, and in the process the beam came in contact with a dozen enemies and ended on Frank. All dozen enemies received damage, as they were inside the beam at some point during the turn. On Frank's next turn, he again took damage for the fourth time and died. On each of the druid's turns, she moved the moonbeam around like this until the fight ended (it did not exceed the time limit and she made all concentration checks). Is this a legitimate use of moonbeam? It seems awfully powerful for a level 2 spell.


I have a Query like this in my PDO statement:  SELECT * FROM table WHERE ? = ? ORDER BY id DESC  I wanted to bind column name to first ? and the value to second ? (column = value)  I tried many things such as below, but they all fail or return empty array (when there should be result)  This returns empty array  $query = "SELECT * FROM table WHERE ? = ? ORDER BY id DESC" $db->prepare($query); $stmt->bindValue(1, $column, PDO::PARAM_STR); $stmt->bindValue(2, $value, PDO::PARAM_STR);   and this one displays an error  $query = "SELECT * FROM table WHERE column = :value ORDER BY id DESC" $db->prepare($query); $stmt->bindColumn('column', $column); $stmt->bindValue(':value', $value, PDO::PARAM_STR);   Column is variable, so i had to bind it and can't put it in query directly.  What am I doing wrong here? I tried many things but no luck...     Please note that I know how to bind values if column is static, my issue is when column is also variable like above.

Why can't I pass the table name to a prepared PDO statement?  $stmt = $dbh->prepare('SELECT * FROM :table WHERE 1'); if ($stmt->execute(array(':table' => 'users'))) {     var_dump($stmt->fetchAll()); }   Is there another safe way to insert a table name into a SQL query? With safe, I mean that I don't want to do  $sql = "SELECT * FROM $table WHERE 1"


As per , there is a toggle that can be used to enable/disable Autoplay feature on YouTube. However, I cannot fine this toggle in :  Could someone give a hint?

When I go to a YouTube video, the video is automatically started, and I hate this. How do I disable the auto-play feature?


I recently dual booted my computer to have Windows 7 and Ubuntu 13.10 on it. I later decided that I didn't want Ubuntu so in Win 7 I went to disk management and deleted 2 volumes that were not their before I made an Ubuntu partition and then when I restarted my computer all that came up on the screen was  error no such partition grub rescue>  What does this mean? What do I do to either boot into Windows or Linux? Any help is appreciated I am very new to Linux Thank You!

I have two systems installed previously Windows 7 and Ubuntu. I was trying to reinstall Ubuntu and format the Ubuntu OS partition using a tool in Windows 7.   When I have Ubuntu ready on a USB stick and restart my laptop, it prompts me with the GRUB rescue screen. If I boot from USB to install Ubuntu, it just hangs.   Anyway, I messed up everything. So my question is how can I boot Windows 7 now?


I saw the same car as her car in the garage.   I couldn’t understand which car is in this garage the car I saw or her car? Are there two meanings in sentence?

Consider:  Some "for + nouns" are adjectival prepositional phrases; others are adverbial prepositional ones, but I am not sure which is which in these following examples:        The pension plans involve very little risk for employers.    A bank creates a reserve for loan losses.    How do investors decide on the expected returns they require for individual investments?   Regulators aim to ensure that ﬁnancial institutions keep enough capital for the   total risks they are taking.   Policyholders can often redeem (surrender) whole life policies early or use the   policies as collateral for loans.   Many exchanges on which stocks, options, and futures trade use market makers.   Typically an exchange will specify a maximum level for the size of a market maker’s bid-offer spread.   The CME has introduced contracts for 10 different weather stations.   The lesson from these losses is that it is important to define unambiguous risk limits for traders.   For similarly rated bonds and structured products, the probability distribution of losses are markedly different.         All the examples are taken from Risk Management and Financial Institutions, 3rd Ed. written by John Hull.    I have no difficulty in understanding these sentences, but it’s not easy to tell whether these "for + nouns" are adjectival prepositional phrases or adverbial prepositional ones.   I would guess this problem could cause ambiguity in some cases.


How can I make this hole shape like this image?

Foreword  First off, let me say that I am profoundly amazed at the orderliness in nature. If you haven't heard about the Fibonacci sequence (0, 1, 1, 2, 3, 5, 8, 13, ...), you should check it out.  This mathematical concept of the Fibonacci numbers can be shaped into a set of squares, where the lengths of the sides of the squares follow the Fibonacci sequence:     This is sometimes called a golden ratio. It can be formed into a (golden) spiral. (a.k.a. logarithmic spiral):      Application  I am looking for ways on how to utilize this concept in Blender. Primarily in organic modeling. The golden spiral is found all throughout nature. From flower seed heads, sea shells, and ram horns to hurricanes and spiral galaxies.  My question is: how can I model based off of one or multiple golden spirals? Specifically, I'm interested in modeling a sunflower head like the one in the following image. I'm mostly interested in the point of origin of the individual seeds (not worried about the shape). Does Blender have any features related to this?


EDIT: I could not figured out how my code is different from the link you provided and the blog, is that possible to pinpoint what/where i'm doing wrong? I'm trying to wrap my head around with promises and I have multiple serverside calls here is what I'm trying to figure out:  Only executes the second server call if the FOUND is true, for the sake of testing I have hard-coded the boolean value but in the real scenario I will be reading from server side.  Why I'm doing the conditional call? I don't want to hit the server if the first call returns false. Here is what I have done so far: Apex: public class PromiseTestController {     @AuraEnabled     public static String serverSideCall1(String message ){         return ' From Server serverSideCall1-->' +message ;     }     @AuraEnabled     public static String serverSideCall2(String message ){         return ' From Server serverSideCall2-->' +message ;     }       }  Component: <aura:component controller="PromiseTestController ">          <aura:attribute name="serverSideCall1" type="String"  default="Not started" />     <aura:attribute name="serverSideCall2" type="String"  default="Not started" />      <ui:button label="PromiseChaining " press="{!c.promiseChaining}" />           <div>         {!v.serverSideCall1}     </div>         <div>         {!v.serverSideCall2}     </div>       </aura:component>  Controller: ({           promiseChaining : function(component, event, helper) {          var found = false; //TESTING         var exeAction = component.get("c.serverSideCall1");         exeAction.setParams( {"message": 'Promise serverSideCall1'});         helper.serverSideCall(component,exeAction).then(             function(res) {                   component.set("v.serverSideCall1" ,res ) ; //RETURN FROM SERVER...serverSideCall1                 if (found) {                   var exeAction2 = component.get("c.serverSideCall2");                   exeAction2.setParams( {"message": 'Promise serverSideCall2});                   helper.serverSideCall(component,exeAction2).then (function (res) {;                    component.set("v.serverSideCall2" ,res ) ; //RETURN FRO SERVER serverSideCall2                 })                              }          .catch(             function(error) {                 component.set("v.status" ,error ) ;                  console.log(error);             }         );     },           })  Helper: ({     serverSideCall : function(component,action) {         return new Promise(function(resolve, reject) {              action.setCallback(this,                                 function(response) {                                    var state = response.getState();                                    if (state === "SUCCESS") {                                        resolve(response.getReturnValue());                                    } else {                                        reject(new Error(response.getError()));                                    }                                });              $A.enqueueAction(action);         });     },         })

When I read about , I see that they should appear as solution to prevent  and  but when I actually try to write a code which would use Lightning promises it still doesn't look like synchronous code, it still resembles both pyramid of doom and callback hell.  main: function(component, helper) {     helper.promise1(component, helper).then(         $A.getCallback(function(record) {             return helper.promise2(component, helper, record).then(                 $A.getCallback(function(){                     console.log("Success");                     helper.showToastMessage(component, "Great Success!!!!")                 }),                  $A.getCallback(function(errorMessage){                     console.log("Rejected by second promise2");                     helper.showToastMessage(component, "Failure " + errorMessage);                 })              )         }),          $A.getCallback(function(errors){             console.log("Rejected by first promise1");             let message = errors && Array.isArray(errors) && errors.length > 0 ? errors[0].message :'Unknown error';             helper.showToastMessage(component, "Failure " + message);         })      ) }   Is that possible to refactor this code to look more like synchronous code and without callback hell or pyramid of doom?


I am a bit confused because I read pretty different informations online. Let's assume this scenario:   UK passport holder. Older than 18 years old but younger than 50. Otherwise no criminal records or exceptional thing. Never visited Thailand before. Flies to Thailand (no prior visa). Gets stamped for 30 days. Before 30 days, renews other 30 days. Before 30 days, renews again (approaching 90 days now) Before 90 days, flies out (no overstay) Flies back to Thailand within one week, and repeats the same operation.   By searching for regulations online, I do not see any regulation on Thai tourist visa policy that explicitly avoids this. However, I see a lot of people online claiming in practice this cannot be done.  Are there any numbers about how often this can be accomplished? Is this in any regulation or is just randomly done by the on-duty immigration officer?

On arrival in Bangkok airport, a Thai immigration officer instructed me that I have many previous visa exempt entries in Thailand, and will need a visa for the next time. However, I could not find any official information.  Is there any regulation limiting the number of visa exempt entries, their total duration, or anything of that kind? (I am a German citizen if that is of any importance.)


Why does reflection occur on transparent materials? For example, air/glass or air/water (two different interfaces)  Mostly it's refraction that's occurring, but I also see some reflection. Why is that?

In day, when you look in the room through the window out, you can clearly see what happens outside. At night when it's dark outside but there's light inside you can look in the window but it becomes a mirror.  Why?