I am using the command texdoc on stata to generate LaTex code. However, whenever I try running the code using pdfLaTex on TexWorks, I get an error saying that the package stata.sty could not be found when I try to use package stata. The code looks something like:  \documentclass{article} \usepackage{stata} \usepackage{graphicx} \begin{document} \section{For Q1} In this section, we cover the following information: \begin{enumerate} \item HH availability and consent, by surveyor \end{enumerate} \end{document}   I have tried changing document class to statapress and using various other packages such as pagedims and sj, based on suggestions on this forum, but it doesn't seem to help. I also tried installing sjextra on stata, but that doesn't work either. Any suggestions would be greatly appreciated!  Thanks, Smriti


Why didn't any Death Eaters come back as ghosts?

In the wizarding world, it's possible to come back as a ghost, and remain in the world we know. Since ghosts are rare, it can be deduced that most people wouldn't choose to become one, but some of the Death Eaters might have feared death enough to consider it. In addition, the Death Eaters who died all died before the Dark Lord himself did, so why didn't the more devoted ones decide to come back to help him?


ls: show file size with thousand separator

Is there some simple way to make ls display the file size number with thousand (and million, billion, ...) separator? A sample output should look like this:  $ ls -lAF /bin/ -rwxr-xr-x 1 root root 975,488 Dec 30  2012 bash* -rwxr-xr-x 3 root root  31,184 Jul 29  2012 bunzip2* -rwxr-xr-x 3 root root  31,184 Jul 29  2012 bzcat*   This would, in my opinion, greatly increase the readability of ls output, especially with large files. Without the thousand (and million, billion..) separator, it is almost impossible to correctly read the magnitude of a big file.


What are the most upvoted/downvoted questions and answers on the sites?

What are the most downvoted questions and answers on Stack Overflow, Server Fault, Meta, and Super User history to date?  Similarly, what are the most upvoted questions and answers on SO, SF, Meta, and SU to date?


How to examine pixel size (degree or length) under different projection in QGIS?

In ArcGis, we can check x y size of each pixel in raster property. How to check in Qgis?


What is wrong with the word "performant"?

I keep getting the red underlining in Word whenever I write the word "performant". Here I intend to refer to something that performs well or better than something else (i.e., it's more performant).  Is there something wrong with that word? Does it mean what I actually want it to say?


OS X 10.11 unable to press "allow" on Keychain Access dialogs

I'm running into an issue where keychain password verification box does not verify password - does not shake for incorrect password and nothing happens when I press "allow". I'm using iCloud keychain.  What could make the Keychain Access wants to... dialog box to not verify the password?  Nothing happens when I press "Allow" with password enters. The box does not shake when password is incorrect:


Ubuntu will not boot into busybox for remote LUKS decryption using dropbear

I want to unlock an encrypted LVM at startup on a headless Ubuntu 16.04 server. This is a fairly fresh install. The only installs I have done are mate-desktop, xrdp, dropbear, and busybox. My client is PuTTY on a Windows machine. I am fairly new to Linux, but here is the progress I have made:  Installed dropbear and busybox  Used puttygen to generate a key pair  Copied public key to ~/.ssh/authorized_keys and set proper permissions (700 on directory, 600 on file)  Copied public key to /etc/initramfs-tools/root/.ssh/authorized_keys and set proper permissions (700 on directory, 600 on file)  Confirmed my keys are good by successfully connecting to normal user session via PuTTY using key authentication  Created the script and modified the config files as outlined at  (Note: I did not perform step 8, but my /var/log/auth.log file did not contain the errors showcased in the Troubleshoot section of that blogpost if step 8 is not performed.)  Updated initramfs   When the system boots and shows the graphical LUKS unlock prompt, I get no response from the server when I try to connect via PuTTY. The connection times out. I have not been able to find any resources that deal with dropbear/busybox not running on boot. I am certain that if I could get a response, my key would work and I could unlock without problems. How can I find out why dropbear/busybox isn't running at boot? (For clarification, I can still unlock at the server and SSH into user session.)


How can I access each value of the enum by the index?   for instance,  enum food{PIZZA, BURGER, HOTDOG};   as we all know, the index of the first element starts from 0 unless initialized.  How can I get the string value of the enum from the index?   How can I get it to print the PIZZA?   cout << food(0);   I know it's not correct, but please advise me thanks.


What happens to body chemistry at the speed of light?

Assume that I'm traveling at the speed of light in one direction. My brain is also traveling at the speed of light in that direction. Presumably there is at least one receptor site in my brain that is oriented in such a way that particles would need to travel faster than the speed of light to reach their destination receptor.  What would happen to those particles? Would my brain cease to function because these particles couldn't reach their destination?


Using @Named and @Inject in Java SE application

Can I use @Named and @Inject in Java SE application?  Something like this:  import javax.inject.Inject; public class ThreadA implements Runnable {      @Inject     private MySignal sharedSignal;      @Override     public void run() {          while (!sharedSignal.hasDataToProcess()) {             try {                 Thread.sleep(1000);             } catch (InterruptedException e) {                 e.printStackTrace();             }         }          System.out.println("Finished");      };  }  import javax.enterprise.context.ApplicationScoped; import javax.inject.Named;  @Named("sharedSignal") @ApplicationScoped public class MySignal {      protected boolean hasDataToProcess = false;      public synchronized boolean hasDataToProcess() {         return this.hasDataToProcess;     }      public synchronized void setHasDataToProcess(boolean hasData) {         this.hasDataToProcess = hasData;     }  }  public class Main {     public static void main(String[] args) {         Thread a = new Thread(new ThreadA());         a.start();     } }   I get this error:     Exception in thread "Thread-0" java.lang.NullPointerException     at   ThreadA.run(ThreadA.java:11)  at java.lang.Thread.run(Unknown Source)


How can I delete/uninstall ubuntu from single boot laptop and install Windows 8.1? I have tried to do some responses posted before but coudln't make it.


Use $\alpha, \beta, \gamma $ roots of a polynomial to construct another polynomial

Let $\alpha, \beta, \gamma $ be roots $\in \mathbb{C}$ of $x^3-3x+1$. Determinate a monic polynomial, degree $3$, witch roots are $1- \alpha^{-1},1-\beta^{-1},1-\gamma^{-1}$  The catch is that i can't use any formula to calculate the roots of $x^3-3x+1$ unless using the quadratic formula or the gauss theorem (though it might not be necessary)


How do I remove "Update and Shut Down" from the power options in Windows 10?

I've been scouring the internet the last few months in an attempt to block windows from doing automatic updates and generally running expensive processes in the background. It's just my preference. I've Enabled the policy of "Do not Display Install Updates and Shut Down" option in my Group Policy editor. However, the options still remain. I have also deleted all contents in C:\Windows\SoftwareDistribution\ and periodically clear them out manually. In the past this has worked, but the options remain. I have set my power button (the physical one) options to just shut down, and I can use this to turn off my PC without updates. So, my PC has been turned on and off multiple times, so I don't believe there is any sort of "Refresh" solution that would cause the options to realize there is no pending update. I know that recently windows has been more aggressive in denying me access to my own computer by way of restrictions on the registry editor and tamper-proof process that turn other processes back on. I've tried it every-which-way. Disabled actions via group policy editor, disabled services in the registry editor, disabled scheduled tasks that turn these back on automatically, but to no avail. Is there any way to remove the "Update and Shut Down" options from the start menu? And additionally, is there any way for windows to stop checking for updates and reminding me about them?


I am currently working on the sketch below using pfgplots.   \begin{tikzpicture}   \begin{axis}[     hide axis,     scale=2,     view={120}{40},     xmin=-4,xmax=4,     ymin=-4,ymax=4,     zmin=-2,zmax=10,     trig format plots=rad,   ]   \addplot3 [ surf, colormap/bone, domain=-4:4, domain y=-4:4,               samples=30, samples y=30,               variable=\u, variable y=\v,               point meta=u*v]             ( {u}, {v}, {cos(u) + cos(v)} );    \addplot3[black, dashed, thick, variable=\t, domain=-1:1] ( {1}, {t}, {cos(1) + cos(t) - 2});   \addplot3[black, dashed, thick, variable=\t, domain=-1:1] ( {-1}, {t}, {cos(1) + cos(t) - 2});   \addplot3[black, dashed, thick, variable=\t, domain=-1:1] ( {t}, {1}, {cos(1) + cos(t) - 2});   \addplot3[black, dashed, thick, variable=\t, domain=-1:1] ( {t}, {-1}, {cos(1) + cos(t) - 2});    \addplot3 [ surf, domain=-1:1, domain y=-1:1,               samples=30, samples y=30,               variable=\u, variable y=\v,               point meta=u*v]             ( {u}, {v}, {cos(u) + cos(v)} );    \addplot3[black, thick, variable=\t, domain=-1:1] ( 1, t, {cos(1) + cos(t) + 2});   \addplot3[black, thick, variable=\t, domain=-1:1] ( -1, {t}, {cos(1) + cos(t) + 2});   \addplot3[black, thick, variable=\t, domain=-1:1] ( {t}, 1, {cos(1) + cos(t) + 2});   \addplot3[black, thick, variable=\t, domain=-1:1] ( {t}, -1, {cos(1) + cos(t) + 2});    \addplot3[black, thick, variable=\t, domain=-1:1] ( 1, {t}, {cos(1) + cos(t)});   \addplot3[black, thick, variable=\t, domain=-1:1] ( -1, {t}, {cos(1) + cos(t)});   \addplot3[black, thick, variable=\t, domain=-1:1] ( {t}, 1, {cos(1) + cos(t)});   \addplot3[black, thick, variable=\t, domain=-1:1] ( {t}, -1, {cos(1) + cos(t)});    \addplot3[black, thick, variable=\t, domain=0:2] ( 1, 1, {2*cos(1) + t});                \addplot3[black, thick, dashed, variable=\t, domain=0:2] ( 1, 1, {2*cos(1) - t});    \addplot3[black, thick, variable=\t, domain=0:2] ( 1, -1, {2*cos(1) + t});                \addplot3[black, thick, variable=\t, domain=0:2] ( 1, -1, {2*cos(1) - t});    \addplot3[black, thick, variable=\t, domain=0:2] ( -1, 1, {2*cos(1) + t});                \addplot3[black, thick, variable=\t, domain=0:2] ( -1, 1, {2*cos(1) - t});    \addplot3[black, thick, variable=\t, domain=0:2] ( -1, -1, {2*cos(1) + t});                 \end{axis} \end{tikzpicture}   The black lines should represent a "box" that goes across the surface. The problem is that when I draw these black curves with \addplot3 I would like to get the "arch" only, but it draws a line between the endpoints as well so I end up with all these straight lines in my plot. In addition, it does not draw dashed curves. As to draw the blue surface I took an example from another post, I tried playing with the options of the axis to see which of them were necessary and if they fixed my problem, but I didn't succeed.  Thank you very much in advance!


have mouse move proportionately between two screens?

I have a computer with two screens..  A laptop with its screen. And another screen that I have connected to it that is much larger.  I can move my mouse from screen 1 (The laptop screen), left to screen 2.  But the problem is that if I move my mouse to near the bottom of screen 2, and right, I cannot get to screen 1. I'd like it so that if my mouse is, at the bottom of screen 2, and I move my mouse right, i'd get to the bottom of screen 1.  And that if my mouse was 5% up screen 2, and I moved it to the right, i'd get 5% u pscreen 1.   At the moment, there is a border the right edge of screen 2 at the portion where there's no screen 1.  If I am at the bottom of screen 1, and I move my mouse left, I don't get to the bottom of screen 2, (as you can see from the ctrl panel display it's obvious why). though i'd like to.  As you can see the way Windows works is the border that is shared by screen 2 and screen 1, no issue. The mouse moves across though if it's half way up one screen and you move it across it may not be halfway up the other screen. But where the border isn't shared, then one screen you hit the border, the other screen you get across.  I would like the screens to relate to each other, so that at any position on one screen you can move to the side to the other screen. So the top of one screen relates to the top of the other screen. The bottom of each screen relate. The middles relate. So that even with different sized screens there isn't a portion of a screen where you can't go across.  Is that possible?


How does someone go to the bathroom on a Puddle Jumper?

Unlike the shuttles of "Star Trek", which are warp-capable, the Puddle Jumpers of "Stargate: Atlantis" require a gate for interstellar travel. There are numerous episodes where someone - typically 4-6 people at a time - have to spend hours or days aboard a Puddle Jumper to reach their destination.  Given that a Puddle Jumper is only two small rooms (four seats in the front and two benches in the back), and that the entire craft is only a little larger than a , it leaves the question of where - or how - going to the bathroom works. I was wondering if this situation was ever addressed in the franchise or extended universe.  How does someone go the bathroom while in a Puddle Jumper for hours or days?  As far as I know, we never see bedpans or bags specified for that purpose, although granted there is a lot of stuff stored in the upper compartments of the rear area.


I am a returning student to the US. My passport suffered water damage but the personal details and US visa page is legible. I have applied for a new passport .   My question is: Can I travel to the US with the new passport and the original with the valid US visa?


Why do you need $ when accessing array and hash elements in Perl?

Since arrays and hashes can only contain scalars in Perl, why do you have to use the $ to tell the interpreter that the value is a scalar when accessing array or hash elements? In other words, assuming you have an array @myarray and a hash %myhash, why do you need to do:  $x = $myarray[1]; $y = $myhash{'foo'};   instead of just doing :  $x = myarray[1]; $y = myhash{'foo'};   Why are the above ambiguous?   Wouldn't it be illegal Perl code if it was anything but a $ in that place? For example, aren't all of the following illegal in Perl?  @var[0]; @var{'key'}; %var[0]; %var{'key'};


Why is pkexec preferred over gksudo for graphical applications?

Please provide Ubuntu documentation that refutes this:  Why, on my fully updated 13.04 system, does pkexec not function?  $ pkexec gedit somefile.txt No protocol specified  ** (gedit:13135): WARNING **: Could not open X display Cannot open display:  Run '/usr/bin/gedit --help' to see a full list of available command line options


How to show $f(x)$ is $0$ in following problem?

Let $f$ be a continuous function defined on $[a, b]$. Assume that there exist constants $α$ and $β$ with $(α ≠ β)$ such that   $$\alpha\int_a^x f(u)du + β\int_x^bf(u)du = 0 $$ for all $x$ belonging to $[a,b]$. Show that $f(x) = 0 $ for all $x$ belonging to $[a,b]$.   My attempt: if we take $x = a$, then we get $\int_a^bf(x)dx = 0$. However this does not imply $f(x)$ is $0$.


Annihilation cross-section of neutrino-antineutrino pairs

Presumably this should be a tiny cross-section (or not?), but presumably it should be at least qualitatively similar to the 511 keV line that clearly distinguishes electron-positron annihilation, although by the upper mass bounds on the different types of neutrinos, such line should be presumably be somewhere in the microwave region or below. Even if the rate is tiny, it could be detectable cosmologically, if we knew in what region of spectra to look On the other hand, considering that the inverse process (photon to neutrino-antineutrino pair $\gamma \gamma \rightarrow \nu \bar{\nu} $) could only be experimentally tested with left-handed $\nu$, right-handed $\bar{\nu}$ pairs, we should expect to see at least half the rate since theoretically the pair production channel toward right-handed-neutrino-left-handed-antineutrino pairs should not be suppressed in this case, correct? and at least from our galactic frame of references, those chiralities should behave as sterile neutrinos


I just upgrade from Ubuntu 17.10 to Ubuntu 18.04, there is an issue when playing youtube video.The video stops play but audio playing, then I move the cursor & video is playing...... What should I do??


How does one have custom LS_COLOR work for ZSH?

I wanted to make custom colors for the ls command with zsh, but I find that all the previous answers to this do not work for me.  I tried all these options:  Option 1)  #LS_COLORS='no=00;37:fi=00:di=00;33:ln=04;36:pi=40;33:so=01;35:bd=40;33;01:' #export LS_COLORS #zstyle ':completion:*' list-colors ${(s.:.)LS_COLORS}   Option 2)  #LS_COLORS='di=1:fi=96:*.m=31:*.py=32:*.txt=36:*.out=35' #export LS_COLORS #zstyle ':completion:*' list-colors ${(s.:.)LS_COLORS}    Option 3)  #zstyle ':completiom:*' list-colors 'di=1:fi=96:*.m=31:*.py=32:*.txt=36:*.out=35'   Option 4)  #zstyle ':completion:*' list-colors 'di=34:ln=35:so=32:pi=33:ex=31:bd=46;34:cd=43;34:su=41;30:sg=46;30:tw=42;30:ow=43;30'   but all result of the ls command are displayed as if no color option was turned on.  The only thing that seems to work to change the colors at all is this:  unset LSCOLORS export CLICOLOR=1 export CLICOLOR_FORCE=1   which I found from another answer somewhere that I can't find. However, what I want is to use my own custom colors indicated by:  #LS_COLORS='di=1:fi=96:*.m=31:*.py=32:*.txt=36:*.out=35'     Appendix   For completness I also saw someone suggest to use gls but I had issues brew installing it so I gave up on that. Sorry can't find the link to that anymore.     Cross posted:   reddit:  Quora:


I'm looking for a textbook that covers, at least for a large part, special relativity with tensors/a geometrical approach. Most textbooks I have found develop tensors for the purposes of GR; I'd like a book that goes through this exercise for the purposes of understanding SR. I'll then feel more comfortable moving on with the GR bit.  Ideally, the textbook/resource will first cover tensors, and then move on to discuss tensor analysis in SR.  Any suggestions?


Is there any way to verify a cashier cheque?

There are plenty of warnings around about forged cashier's cheques, and that if you deposit a forged one your bank will "hold you responsible".   What does it mean that the bank will "hold you responsible"? Clearly the money won't be credited. Will you be charged a fee like an NSF cheque? Will they try to prosecute you? Is there any way to confirm whether a cashiers cheque is forged? Could you for example tell your bank that you were uncertain of the origin, and ask them to confirm it? Can you call the issuer and verify (from the serial number) that they did in fact issue a cheque for that amount with you as the payee?


To prove that $(F,+)$ and $(F-\{0\},\cdot)$ are not isomorphic as groups.

Let $(F,+,\cdot)$ be a field.   Then to prove that $(F,+)$ and $(F-\{0\},\cdot)$ are not isomorphic as groups.  I am facing difficulty in finding the map to bring a contradiction!!


When I joined Programmers SE, I earned 100 points reputation bonus. However, the icon still shows that I only gained +94. Even considering last week's activity, this count is unexplainable. Did I find a bug? It's happened to me a lot, but I finally decided to report it.


I posted this question nearly 10 days ago, but am still really not satisfied with the answers I got, I have no prior education in abstract algebra, group theory, or other abstractions, and most of the answers I got involved defining sets, groups and other things I am unfamiliar with, my question was,  How does one know the notion of real numbers is compatible with the axioms defined for complex numbers, ie how does one know that by defining an operator '$i$' with the property that $i^2=-1$, we will not in some way contradict some statement that is an outcome of the real numbers.  For example if I defined an operator x with the property that $x^{2n}=-1$, and $x^{2n+1}=1$, for all integers n, this operator is not consistent when used compatibly with properties of the real numbers, since I would have $x^2=-1$, $x^3=1$,thus $x^5=-1$, but I defined $x^5$ to be equal to 1.  How do I know I wont encounter such a contradiction based upon the axioms of the complex numbers.  I reiterate here again, Please don't use terminology, or abstract math, that hasn't been taught in say a thorough collage level calculus 1 course.  Here's a link to the same question I asked 8 or so days ago:


Prove the following for $\Re(z) >0$  $$ \log(\Gamma(z)) = 2\int_{0}^{\infty} \tan^{-1} \left(\dfrac{t}{z}\right)\dfrac{\mathrm{d}t}{e^{2\pi t} - 1} + \dfrac{\log(2z)}{2} + \left( z - \dfrac{1}{2} \right)\log (z) -z  $$  I found this identity on Wolfram Functions . I can't see where to start solving this problem.    I'm looking for elementary solution, I haven't learned about Complex Analysis or Abel Plana formula yet.  Please help. Thanks.


I have a few vertices selected, obviously in edit mode.  Running bpy.ops.info.select_all(action='INVERT')  in the Python console gives me a RuntimeError: Operator bpy.ops.info.select_all.poll() failed, context is incorrect though ? That's exactly the command the GUI shows me when hovering Select > Invert, and doing it though the GUI works of course.


Ubuntu 18.04 LTS booting very slow after recent update

Ubuntu 18.04 LTS is booting very slow after a recent update. Below is systemd-analyze blame output:  6min 36.404s plymouth-quit-wait.service     3min 36.636s snapd.seeded.service          35.386s snapd.service           6.287s NetworkManager-wait-online.service           1.780s dev-sda5.device           1.255s dev-loop4.device           1.233s dev-loop3.device           1.229s dev-loop0.device           1.220s dev-loop2.device           1.216s dev-loop7.device           1.216s dev-loop5.device           1.216s dev-loop1.device           1.202s dev-loop8.device           1.200s dev-loop6.device           1.157s dev-loop9.device            744ms fwupd.service            650ms apparmor.service            476ms systemd-rfkill.service            402ms udisks2.service            333ms systemd-journal-flush.service            297ms networkd-dispatcher.service            275ms plymouth-start.service            255ms accounts-daemon.service   Kindly help  Thank you


Is "It is you who are mistaken!" correct?

Possible Duplicate:          This is a line spoken by the . I always wondered if this is grammatically correct.  Luke says something like "You are mistaken ..." which the Emperor answers with     No, it is you who are mistaken!   Why wouldn't he say     No, it is you who is mistaken!   instead?  I don't know what rules apply here but my stomach tells me the latter is (at least also) correct, although you would say "you are mistaken". It feels as if he should be referring to "you" in the third person.  Could you please shed some light? Are both correct or – if not – which one is correct? And why?


Let $A$ be the set of all functions $f:\mathbb{R}\to\mathbb{R}$ that satisfy the following two properties.

Let $A$ be the set of all functions $f:\mathbb{R}\to\mathbb{R}$ that satisfy the following two properties:  (1) $f$ has derivative of all orders, and  (2) for all $x,y \in \mathbb{R}$, $f(x+y)-f(y-x)=2xf'(y)$.  Which of the following sentences is true?  (a) Any $f\in A$ is a polynomial of degree less than or equal to 1  (b) Any $f \in A$ is a polynomial of degree less than or equal to 2  (c) $\exists f \in A$ which is not polynomial  (d) $\exists f \in A$ which is a polynomial of degree 4  It is a problem from TIFR GS-2018. I have found polynomials upto degree 2 hold this properties but have to exclude the possibility of (c) and (d). I also found out if $f'(x)$ has at most one real root and clearly graph of $f$ is symetric about that root. How can I proceed further?


Eclipse - Java - Import class that is not in any package

As the title says, I have a public class that is not part of any package. I need to test this class, and for that I need to import it.   How can I achieve this? Thanks.


ifconfig no inet no inet6 after newly install Ubuntu 14.04

I have installed Ubuntu 14.04 myself. After reboot  the network (wifi) doesn't work anymore, I do not have cable, so haven't tried  ifconfig  the eth0 doesn't have inet or inet6 item   and  lspci -knn! grep Net -A2  03:00.0 Network controller (0280): Broadcom Corporation BCM43142 802.11b/g/n (14e4:4365) (rev 01) Subsystem: Lenovo Device (17aa:0611) Kernel driver in use: bcma-pci-bridge   quite emergency. How could I deal with it ?


When I run  sudo apt-get update   I always get this output:  ...  E: Failed to fetch http://ppa.launchpad.net/q-quark/equalx/ubuntu/dists/xenial/main/source/Sources  404  Not Found E: Some index files failed to download. They have been ignored, or old ones used instead   How could I fix it?


Calculating large Bell number modulo a composite number

I have been trying to solve   It is not an ongoing contest problem.  We can calculate $n$th Bell number modulo a prime number greater than $10^7$ in $O(n)$ arithmetic operations, using this formula $$B_n=\sum_{k=1}^{n}\frac{k^n}{k!}\sum_{j=0}^{n-k}\frac{(-1)^j}{j!}$$ We can store the partial inner sum for future use, without calculating again and again. For example $B_{10^7}$ $\text{mod}$ $1000000007$ $=29987405$.  But in the problem the modulus is $30!$, so we can't do modular inverse operations. I tried to reduce the formula to $$B_n=\sum_{k=1}^{n}\frac{k^n!(n-k)}{k!(n-k)!}=\frac{1}{n!}\sum_{k=1}^{n}\binom{n}{k}k^n!(n-k)$$ $!n$ denotes subfactorial function.  I am stuck here. Can anyone help?


Examples of rings having reducible primes

In domains, all primes are at the same time irreducible.   What happens when the ring is not a domain?    I need a practical example of this kind of ring. Thanks


I want to implement a "remember me" function in my site with PHP.   My thought is to store the username and hashed password string in cookies. But anybody can still get the cookie's value and set the cookie from another computer (using the browser's debug console) to reload the page and log in, right? How to prevent this?


I was wondering if somebody could guide me with this question. A recent survey examined the working arrangements of married households. It was found that 88% of the households had at least one working member. In 20% of the households with the woman not working, the man also does not work. In 40% of households in which the man does not work, the woman also does not work. What is the probability the man does not work and the woman works in a randomly selected household?


"Twilight Zone" episode with time-stopping aliens, a test pilot and a woman wonder at how marvelous things look while stopped

There is an old black and white episode of The Twilight Zone in which a test pilot and a woman in a car find themselves stopped a mere instant before a devastation crash would have surely killed them. They are in separate locations but close enough to eventually meet up. They quickly realize that time has stopped though they are still moving normally.   During this time they explore a small town and marvel at how everything looks while stopped. As I remember, they find the control room for some sort of experiment that was being conducted. This is where the aliens come in. If I remember right you never really clearly see the aliens but their voices can be heard. The man and woman also discover multiple accidents about to occur but they are powerless to stop them. I distinctly remember a little girl on a tricycle riding on the sidewalk in front of a fire station and an unmanned fire engine about to roll over her.


How to type in Hindi using Libre Office Writer

I'm currently using Libre Office 5. I was hoping someone here can help me out.


I am currently using mint.How can I replace it with ubuntu without any data,files loosing? Can anyone tell me how to boot only ubuntu without  any personal data loss? Thanks!


Can you beat the market by investing in double long ETFs?

Certain ETFs double the daily rate of return of certain indices.  Can you use such ETFs to beat the market (not on a risk-adjusted basis, just in terms of pure returns)?   I have  that      When based on high volatility indexes, 2x leveraged ETFs can also be expected   to decay to zero   But I don't see why this can be true.  My rationale is the following: My assumption is that typically, markets have a positive return expectation (otherwise, prices should drop such that this is true).  If, on a daily basis, the expected return is positive then it should be profitable to double that return. And if this is true for one day, then surely this should be true for longer periods of time.  If you can win by following such a strategy, then who loses?


how do I distinguish in a simple way a number in an input?

I am learning now how to make my program distinguish two types of input in one function... I know its possible but how can I actually do it ;-; Heres abit of my code:  def alphanumeric_input_detection(base_input):     if (type(base_input)==str):         return (print("you've written it wrong you dumm dumm"))     else:         return(print("thats correct input"))  base_input=input("please write a number")  alphanumeric_input_detection(base_input)


I had just upgraded from using blender version 2.75 to 2.77 and I immediately found a difference between the two. Here are the differences:    default perspective 2.75    default for 2.77  When I do a custom rotation using the same coordinates, the view becomes different.   2.75   2.77  In 2.77 it's no longer rotating directly along the z-axis.  How can I rotate the viewport on the z-axis in 2.77 as it was on 2.75 (or 2.76?)


I'm a new user and recently I installed Debian Wheezy in PCs. I'm in charge of a computer center in a public school, and I need a software which control another ones. The trouble is I have been finding one which control "Linux to Linux", not "Linux to Windows". In youtube only appears videos about SSH terminal mode and Linux to Windows.  All machines have Debian wheezy and my pc desktop has Ubuntu 14.04. I need to know what my students are doing, and to have a better control over those machines.


How to see a YouTube video in  from a non-3D Android device? I am not able to enable Anaglyph mode from the YouTube application.


Is there another proof for Euler–Mascheroni Constant?

Problem Prove that the sequence $$x_n=1+\frac{1}{2}+\frac{1}{3}+\cdots+\frac{1}{n}-\ln n,~~~(n=1,2,\cdots)$$is convergent. One Proof This proof is based on the following inequality  $$\frac{1}{n+1}<\ln \left(1+\frac{1}{n}\right)<\frac{1}{n}$$  where $n=1,2,\cdots$, which will be used repeatedly. On one hand, we obtain that $$\ln 2-\ln 1<1,~~\ln 3-\ln 2<\frac{1}{2},~~\ln 4-\ln 3<\frac{1}{3},~~\cdots,~~\ln (n+1)-\ln n<\frac{1}{n}.$$ Adding up all of these，we have that $\ln(n+1)<1+\dfrac{1}{2}+\dfrac{1}{3}+\cdots+\dfrac{1}{n}.$ Hence,$$x_{n+1}=1+\frac{1}{2}+\frac{1}{3}+\cdots+\frac{1}{n}+\frac{1}{n+1}-\ln(n+1)>\frac{1}{n+1}>0.$$ This shows that $x_n$ is bounded below. On the other hand,$$x_n-x_{n+1}=-\frac{1}{n+1}+\ln(n+1)-\ln n=\ln \left(1+\frac{1}{n}\right)-\frac{1}{n+1}>0.$$ This shows that $x_n$ is decreasing. Combining the two aspects, according to Monotone Bounded Theorem, we can assert that $\lim\limits_{n \to \infty}x_n$ exists. Let $\gamma$ (so-called Euler–Mascheroni Constant) denote the limit, i.e. $$\gamma=\lim_{n \to \infty}\left(1+\frac{1}{2}+\frac{1}{3}+\cdots+\frac{1}{n}-\ln n\right),$$which equals $0.577216 \cdots$. We may also express that as $$1+\frac{1}{2}+\frac{1}{3}+\cdots+\frac{1}{n}=\gamma+\ln n+\varepsilon_n,$$where $\varepsilon_n$ represents an infinitesimal related to $n$ under the process $n \to \infty$.


I wanna use HP Laserjet 500 MFP on my Ubuntu 20.04 device. Unfortunately hplip does not support Ubuntu 20.04 yet. Can you help? My error code running the installation script for hplip (sh ./hplip-3.20.9.run) is:     Running 'sudo apt-get install --assume-yes python-pyqt5'     Please wait, this may take several minutes...     error: Package install command failed with error code 100  Also installing hplip from the repository through (sudo apt-get install hplip) and running the command hp-plugin is not successful. When running the command hp-setup the printer does not seem to be recognized.


What limits a motherboard from supporting more memory?

My specific question is with the ASUS M3N78-VM motherboard that my home server uses. I currently have 4x2GB installed for a total of 8GB but I was hoping to upgrade to say 16GB (4x4GB). The official specifications of that motherboard says it only supports up to 8GB but it was released back when only 2GB sticks were available. What, if any, would prevent it from working with 4GB sticks now that 4GB sticks are available?  My general question is with motherboards in general... what would prevent a motherboard from working with bigger sticks if its all just the same type (DDR2 for example and same speeds) of memory?


How to prove the the addition of tangent is the same as the multiplication?

If A,B,C are angles of a triangle show that:  $$\tan A+ \tan B+\tan C = \tan A \tan B \tan C $$  I've tried this many times but I cannot seem to prove it, can someone show me how to solve this problem?


What is the minimum set of hypotheses which the present physics is based on?

Based on nowadays human understanding, what are the most fundamental hypotheses or principles in present physics which could deduce all other formula/theorem/details/applications?


How to perform two-sample t-tests in R by inputting sample statistics rather than the raw data?

Let's say we have the statistics given below  gender mean sd n f 1.666667 0.5773503 3 m 4.500000 0.5773503 4   How do you perform a two-sample t-test (to see if there is a significant difference between the means of men and women in some variable) using statistics like this rather than actual data?  I couldn't find anywhere on the internet how to do this. Most of the tutorials and even the manual deal with the test with the actual data set only.


Entered USA with esta, leaving to Canada for 2 days and come back

I am visiting my brother here in the US, and I am staying for 3 weeks. I used esta in order to come to the US. We want to visit Montreal (Canada) for two days and come back to the US. (We are going there by car)  Will I have problem coming back to the US? I mean esta doesn't expire for at least 2 more months, but if I leave the states, and come back two days later, would esta still be valid? can I come back? Thanks!


Determinant of a matrix will all off-diagonal elements equal

Consider matrices of the following form: \begin{bmatrix} a & x & \cdots \\  x & b & x &\cdots \\ \vdots & x & c &\cdots \\   & \vdots & x & \ddots & \\ \end{bmatrix} where all $x$ are the same scalar. Is there anything that can be done to calculate the determinant easily? Obviously if $$x=a=b=c=\cdots $$ then the matrix is singular and the determinant is zero. Assume this is not the case.   Do they have any other interesting properties?


Proving the characteristic function involving sequence of 2 iid variables

We have an iid sequence with: $X_1,X_2,...$ with mean $\mu$ and variance $\sigma^2$.  We have another similar sequence: $$Y_1,Y_2,...$$.  We have a sequence $U1,U_2,...$ where, $U_n=1/\sqrt(2(n\sigma^2))(\Sigma X_j-\Sigma Y_j)$  We also have   $$W_n=1/\sqrt(n\sigma^2)(\Sigma X_j-n\mu)$$  and   $$Z_n=1/\sqrt(n\sigma^2)(\Sigma Y_j-n\mu)$$  How do we show that $\psi(U_n)(\theta)=\psi_(W_n)(\theta/\sqrt2).\psi_(Z_n)(-\theta/\sqrt2) $  ie the characteristic function of $U_n(\theta)$ evaluated at theta is equal to the product of the characteristic functions of $W_n$ and $Z_n$ evaluated at theta over root 2 and minus theta over root two repectively?  This question is about proving the characteristic function of $U_n$ can be shown as a product of the characteristic functions of $W_n$ and $Z_n$.  Approach so far:  I started trying to derive the characteristic function of Un by doing this:  $$ ψ_(U_n ) (θ)=E[e^iθX ]=∫e^iθx U_n dx =E cosθX+iE sinθX$$  $$=∫cosθx  U_n dx+i∫sinθx  U_n dx$$  $$=∫cosθx  1/(√(2nσ^2 )  ) (∑X_j-∑Y_j )dx + i∫sinθx 1/(√(2nσ^2 )  ) (∑X_j-∑Y_j)dx $$  But then i got stuck trying to integrate the sigmas. I also doubted that this was the correct approach given that this is a sequence of variables we are talking about.


so I'm making a drink scene, but it looks like there are very weird dots around, near the glass. It seems I need to do something to get rid of the white dots.


Linear algebra, matrix in $\mathbb{C}^n$

, Can you help me with the following exercise?  Show that doesn't exists matrix $A,B\in M_n(\mathbb{C})$ such that $$AB-BA=I$$  Has something to do with the annihilator? Thanks !


Erratum in Griffith's Introduction to Electrodynamics

Applying the divergence to Eq. $47$, we obtain $$ \mathbf{\nabla} \cdot \mathbf{B} = \frac{\mu_{0}}{4\pi} \int \nabla \cdot \left( \mathbf{J} \times \ \frac{\hat{\mathbf{r}}}{r^2}\right) d\tau^{'}. \tag{48}$$ Invoking the product rule number $6$, $$\nabla \cdot \left(\mathbf{J} \times \ \frac{\hat{\mathbf{r}}}{r^2}\right)=\frac{\hat{\mathbf{r}}}{r^2}\cdot(\nabla \times \mathbf{J})-\mathbf{J}\cdot\left(\mathbf{\nabla} \times \frac{\hat{\mathbf{r}}}{r^2}\right)\; .\tag{49} $$ But $\nabla \times \mathbf{J}=0$, because $\mathbf{J}$ doesn't depend on the unprimed variables, while $\mathbf{\nabla} \times \frac{\hat {\mathbf{r}}}{r^2}=0$, so $$\mathbf{\nabla} \cdot \mathbf{B}=0\;.\tag{50}$$  I have the Fourth Edition of Introduction to Electrodynamics by David J. Griffiths, published by Pearson. I have found this erratum in Chapter 5 Magnetostatics, page 234 . It's just a normal triple product manipulation, i.e. $$ \vec a \cdot \left(\vec b \times \vec c \right) = \vec b \cdot \left( \vec a \times \vec c \right) = \vec c \left(\vec b \times \vec a\right)$$ Therefore, I think that an "equal to" sign is missing between the expressions on the RHS of Eq. $(49)$. I searched for  but couldn't find it.


If a question can be asked on multiple websites with a little tweaking what should be done?

I had a question that could have been asked on either of these 3 websites - codereview, programmers, codereview with a little tweaking. I decided to post on codereview. So far I got only one answer even after placing a bounty. To get more answers I thought of  but it seems that isn't possible or desirable.  So what should be done in case I have such a question? Should I reword the question and request a migration? Should I cross-post? Should I make a feature-request that cross-SE bounties be allowed between these 3 websites? How about  of questions with some minimum upvotes?  Any suggestions?  This is .   This question isn't specifically about cross-posting. I am asking for alternatives present in this situation   cross-posting cross-SE bounty soft-migration complete migration


How do I respond to "how do you like your program" if I completely hate it?

I hate my PhD program. I absolutely despise the program and many people in it. Sometimes at conferences, with new faculty, etc. I get asked what I think of my program. The real answer is "it's horrible, I despise it and I  totally regret going. Please stay far away".   I don't want to lie and many people seem genuinely curious especially new grad students/faculty etc.  When I say things like this, the conversation either turns really awkward or they start asking questions. I really just want to keep my head down, do my job, and finish. I don't want to complain. I don't want to cause problems. I just want to do my job.   Many people seem genuinely interested like new faculty etc. I hate lying. And I especially would hate saying anything good about the program after being burned. I felt like when I was choosing grad programs people lied to me about this one and I'm super resentful. I never want to do that to someone.   I also don't really want to elaborate because some things are sensitive. Say, a professor is a jerk and is screwing me over somehow. I don't really want word to get out that I'm talking about that person.   I've found answers like "Well, I'm working on a cool project right now" or other deflecting responses sometimes work but some people keep pushing and really want to know.      How to I respond to this question without lying?


Difficulty in understanding the proof : S must have infinitely many accumulation points.

"Let S be an uncountable subset of R. Prove that S must have   infinitely many accumulation points. Must it have uncountably many?"   This question was already asked on this website before. I have some difficulty in understanding the proof. Here is the accepted answer:       Let $T$ be the set of elements of $S$ that are not accumulation points   of $S$. Then for each $x \in T$ there exists $\epsilon > 0$ such that   the interval $I(x,\epsilon) = (x-\epsilon,x+\epsilon)$ contains no   other points of $S$. The intervals $\{I(x,\epsilon/2) | x\in T\}$ are   disjoint, and each contains a rational number; so there can only be a   countable number of them.      Hence $T$ is countable, and the set of accumulation points of $S$,   which contains $S-T$, is uncountable.     I can not understand why:   The intervals  $\{I(x,\epsilon/2) | x\in T\}$  are disjoint.   Second question: Each $I(x,\epsilon)$ contains a rational number due to the denseness of $\mathbb{Q}$ in $\mathbb{R}$ but why does it imply that there is only countable number of them.   Thanks a lot.


Prove that the set of powers of a set, $\{ A^n : n \in \mathbb{N} \}$ exists by using ZFC axioms (without replacement).

I need to prove that the set $\{A^n : n \in \mathbb{N} \}$ using the ZFC axioms (without Replacement).  My (rough) plan would be to construct some set containing "more" sets than necessary, then use the comprehension axiom to remove the undesirable sets. Something like: for some $Y$, $\{ X \in Y : \exists n \in \mathbb{N}, X = A^n\}$.  I know how to prove that any one of these sets (e.g., $A^2$), exists, but I have no idea how to prove that the set containing all of these powers exists.


Merge a dict in Python using 1 dict as base

I am looking for feedback on my Python code. I am trying to merge two dictionaries. One of the dictionaries controls the structure and the default values, the second dictionary will overwrite the default values when applicable.  Please note that I am looking for the following behaviour:   keys only present in the other dict should not be added nested dicts should be taken into account   I wrote this simple function:  def merge_dicts(base_dict, other_dict):     """ Merge two dicts      Ensure that the base_dict remains as is and overwrite info from other_dict     """     out_dict = dict()     for key, value in base_dict.items():         if key not in other_dict:             # simply use the base             nvalue = value         elif isinstance(other_dict[key], type(value)):             if isinstance(value, type({})):                 # a new dict myst be recursively merged                 nvalue = merge_dicts(value, other_dict[key])             else:                 # use the others' value                 nvalue = other_dict[key]         else:             # error due to difference of type             raise TypeError('The type of key {} should be {} (currently is {})'.format(                 key,                 type(value),                 type(other_dict[key]))             )         out_dict[key] = nvalue     return out_dict   I am sure this can be done more beautifully/pythonic.


80s movie where the main character has fast healing or is immune to harm

The details of this movie are specially fuzzy on my mind.  I saw it at some point in the 80s I think and I can only remember very vague facts.   Main character has immunity to harm. I “think” is more like super fast healing, à la Wolverine. At one point in the movie he has to go from one place to another and there’s a remark in the sense since he doesn’t fatigue, he’ll be able to run at peak human velocity all the way and hence make it in time. I seem to recall he runs through a forest and it is elated to save his son. There’s a girl, some kind of scientist that’s helping him but I don’t think it was the mother. The main character has a son. In his early teens. At the end of the movie, this is the scene I remember more vividly, the son wants to know if he’s inherited the healing powers of his dad, so he purposely cuts himself on the hand washing on the kitchen sink. The main character comes running to find him holding the hand under water and he confesses what he has done and why. When he shows the hand, the injury is gone, implying he does, indeed, share his dad’s ability.


I got an error message I do not understand

I am getting an error message when I try to run my code   Attempt to invoke virtual method 'android.view.Window$Callback android.view.Window.getCallback()' on a null object reference   Here is the code:  @Override protected void onCreate(Bundle savedInstanceState) {     super.onCreate(savedInstanceState);     setContentView(R.layout.activity_the_game);      Button l = (Button) findViewById(R.id.Edit);     l.setOnClickListener(new View.OnClickListener() {         @Override         public void onClick(View v) {             Intent i = new Intent(theGame.this, EditWords.class);             startActivity(i);         }     });   And here is the code for EditWords.java:      @Override     protected void onCreate(Bundle savedInstanceState) {         super.onCreate(savedInstanceState);         setContentView(R.layout.activity_edit_words);           Button l = (Button) findViewById(R.id.add);         l.setOnClickListener(new View.OnClickListener() {             @Override             public void onClick(View v) {                 Intent i = new Intent(EditWords.this, AddWord.class);                 startActivity(i);             }         });          Button x = (Button) findViewById(R.id.delete);         l.setOnClickListener(new View.OnClickListener() {             @Override             public void onClick(View v) {                 Intent i = new Intent(EditWords.this, DeleteWord.class);                 startActivity(i);             }         });          Button b = (Button) findViewById(R.id.Back3);         b.setOnClickListener(new View.OnClickListener() {             @Override             public void onClick(View v) {Intent i = new Intent(EditWords.this, theGame.class);                 startActivity(i);             }         });     } }


Is there any fast way to find the power of 2 nearest to a large given number?

I tried doing it in fastest way possible but have dead end. Please shed some light.  private static int nFind(long n) {         long a,t = 0;         for(long i=1; i<n; i++)         {             t = (int) Math.pow(2, i);             a = n/t;             if(a==1)             {                 break;             }         }         return (int) t;     }   Time Complexity is the issue.


A baseball diamond is a square with side length $90$ ft. A batter hits the ball and runs toward first base with a speed of $f(t)$ ft/s after $t$ seconds. At what rate is the batter's distance to second base decreasing when the batter is halfway to first base? This is not a duplicate, because the speed is varying in this question compared to the one you guys linked it to.


Discover whether user is a member of an AD group via jquery

Using jquery and/or spservices, how can I know whether the current user is a member of an AD group?  , but I think it only checks for membership in a Sharepoint group.


Coordinate Conversion - identifying source spatial reference

I recently acquired a shapefile that when added in ArcMap 10.2, the software says it has an unknown spatial reference system. The X and Y coordinates are both 6 digit coordinates (for example, 712568.799, 257083.471).  I would like to be helped on how to convert these coordinates to Arc 1950 UTM Zone 36s which is a system used in Malawi. If the Y coordinate had 8 in front it could have worked perfectly but this is not the case.


How do I move my website to a new server without interruption to email?

I have a corporate website on a server that also hosts all our email. I have no idea how diligent all the employees have been about backing up their email / leaving old messages on the server, etc. In fact, I'd like to avoid all that hassle and keep the old email running on the old server.  I just want to move the website to a new, more reliable server, leaving the emails running on the old server.  How can I do this? When I point the DNS to the IP address of the new virtual host, once it propagates, will it cut off the email to the old server? The server admin of the old server seems to think so.  What's the solution here, operating on the principle that we want the LEAST amount of change / reconfiguration / data loss for our staff?


How can I install MySQL 5.7 on Ubuntu 20.10

I am wanting to install MySQL 5.7 on Ubuntu 20.10 but have not been able to find any tutorials etc on how to do this. So far I keep trying different approaches based on 20.04 but there doesn't seem to be a simple solution if you are running Groovy. Is it possible? Many thanks for any help.


How to check the current mouse button state Using Javascript

I want the state of mouse on Down state or on up state  document.onmousemove = mouseMove; document.onmousedown = mouseDown; document.onmouseup   = mouseUp;  function mouseMove(ev) {      mouseState="";     //How can I know the state button of mouse button from here      if(mouseState=='down') {         console.log('mouse down state')     }      if(mouseState=='up')  {         console.log('mouse up state')     } }  function mouseDown(ev) {     console.log('Down State you can now start dragging');     //do not write any code here in this function }  function mouseUp(ev) {     console.log('up state you cannot drag now because you are not holding your mouse')     //do not write any code here in this function }    When I moved my mouse, program should show the required value of mouseState up or down on console for now


The multiplicative groups $\mathbb{Q}^\ast$ and $\mathbb{R}^\ast$ are not isomorphic

Of course, since the cardinality of $\mathbb{R}$ exceeds the cardinality of $\mathbb{Q}$, there does not exist a bijection between $\mathbb{Q}^\ast$ and $\mathbb{R}^\ast$, let alone a group isomorphism.  My question is whether it is also possible to prove that these multiplicative groups are not isomorphic without using a cardinality argument.


$a_n = 2a_{n-1} + 1, a_0 = 0, a_1 = 1$  So to get the closed form of this recurrence relation, I would usually try to get it into the form of $a_n = ra_{n-1}$ and then $a_n = r^na_0$. But what am I supposed to do with the $1$?  Thanks!


If $F\subset D \subset E$ then $D$ must be a field

Let $F$ a field and $E$ a finite extension of $F$. I need to show that, if $D$ is a integral domain such that $F\subset D\subset E$ then, D is a field.  My attempt: As $E$ is a finite extension, it is a algebraic extension. Let $\alpha\in D$, it is sufficient to show that each element of $D$ has a inverse. So, take $\alpha\in D$ so $\alpha$ is algebraic over $F$. Suppose that $\deg(\alpha,F)=n$, then every element of $F(\alpha)$ can be written as $a_0+a_1\alpha+\cdots+a_{n-1}\alpha^{n-1}$ where $a_i\in F$. Therefore, $F(\alpha)\subset D$ and as $F(\alpha)$ is a field and it contains the inverse of $\alpha$.  I have troubles with my proof because a don't see where the fact that $D$ is integral domain is important.


I have a method rotateImage that returns an int[][] array, I am having trouble understaing how to display the actual values of the array instead of just the hashcode:  [I@548c4f57 [I@1218025c [I@816f27d   I tried doing this:   Arrays.stream(rotateImage(matrix)).forEach(System.out::println);   but that only returns the hashcode, not the actual numbers themselves. I also tried using to Arrays.toString() method in several ways but always get an error.


I know how to split strings in Python using square brackets ( [3:] ) / whatever number you want, but I cannot find how to do that in JS. Nothing seems to match what I am looking for. I am not very experienced in JS so I apologise if this has a very obvious answer.


Word for high volume but low information density communication

I'm trying to find a single word to describe a communication style that is high volume, low information density that is more formal than windbag.   Loquacious is the best I've come up with so far but I don't feel like it captures the low information density by itself.  Basically trying to find a an eloquent way to capture Homer's "You take forever to say nothing."


Clipping line layer based on polygons with QGIS?

I have a line layer and a polygon layer. Both files have the same SRS. I want in a new shape file only the lines covered by the polygons.   I tried in QGIS the Vector -> Geoprocessing -> Clip tool but I only get an empty shapefile.  How do I do this with QGIS?


Why cant my code check if the number is odd or even? The alert always says that the number is odd.  The result is the same whether I have x in the function brackets or not.   <!DOCTYPE html> <html> <head>  <script>   function check(x){    if(x % 2 == 0){     alert('even');    } else{     alert('odd');    }   }   function store(x){    function save(x){     var x = document.getElementById('x');     localStorage.setItem('x',x.value);    }    save(x);    check(x);   }  </script> </head> <body>  <form id="form" onsubmit="store()">   <label>x=</label>   <input type="text" id="x">   <input type="submit">  </form> </body> </html>


Bridge edge loops results in deformed path

I want to have uniformed section between edge loops, you can check my screen shot, on the right side are two cylinders with the same size, I want to connect them, then the left side is how it looks like, the path in between got deformed, how to get uniformed cross section(cycle) along the path. Another problem is the joint is too hard, is there any way to make a smooth transition?


Let $a_1=10, a_2=20$ and $a_{n+1}=a_{n-1}-{4\over a_n}$ for $n>1$  Find the smallest value of $k$ for which $a_k=0$


Java Scanner Null Pointer Exception in while (line != null) loop

I try to find how many fender words in my txt file but I get nullPointerException. I m waiting for your helps. Thank you :)  public class ScanTxt {  private static BufferedReader buffer; static int count=0;   public static void main(String...args) throws IOException{ readFile(); } public static int readFile() throws IOException {     buffer = new BufferedReader(new FileReader("C:/Users/ASUS/Desktop/myfile.txt"));          StringBuilder strbuild = new StringBuilder();         String line = bufferr.readLine();          while (line!=null) {             strbuild.append(line);             strbuild.append("\n");             line = buffer.readLine();             if(line.equalsIgnoreCase("fender")){                 count++;             }         }         return count;   }


Ways to cure a body part that was turned to stone?

During the very first session of my current campaign, my character's fist was turned to stone.  Quite a few sessions later, I'm getting a bit irritated with only having one functioning hand. What ways are there to restore my hand?  We're level 8, playing 5th edition, set in the Forgotten Realms. My fist was turned to stone by a dragon. We're playing Storm King's Thunder. What happened to my character was one of the characters provided by the module. At least I assume that. Haven't actually checked that to avoid spoilers for it.


I'm trying to make a longtabu that is wider than the textwidth at a certain moment. I've tried different things always ending up with a different problem:  First possibility: If I use the adjustwidth environment the longtabu does not align correctly. The left margin stays fixed and the right margin gets out of the page. This in contrast, if I do the exact same thing to make a tabu(instead of longtabu), it works perfectly. I think using the adjustwidth is the best way to go, but I can't manage to get it working.  Second possibility: I've found a solution using the fullwidth package. That package does the trick, but using endhead and endfirsthead is completely ignored. So it does not help me either, because I need that.  Final possibility: Using the geometry package does the trick, but that package adds a pagebreak when I start using it, I can't have that. It has to be directly under some text, which has a narrower textwidth.  Cheers.  I add a little example:  \documentclass[a4paper]{article} \usepackage{longtable} \usepackage{chngpage} \usepackage{lipsum} \usepackage{tabu}  \begin{document} \section{This is the original textwidth.} \lipsum[1]  \section{This is the width I need for my longtabu} \begin{adjustwidth}{-1in}{-1in}     \begin{tabu} to \linewidth {*{13}{|X[l]} |}     01 & 02 & 03 & 04 & 05 & 06 & 07 & 08 & 09 & 10 & 11 & 12 & 13 \\     01 & 02 & 03 & 04 & 05 & 06 & 07 & 08 & 09 & 10 & 11 & 12 & 13 \\     01 & 02 & 03 & 04 & 05 & 06 & 07 & 08 & 09 & 10 & 11 & 12 & 13 \\     01 & 02 & 03 & 04 & 05 & 06 & 07 & 08 & 09 & 10 & 11 & 12 & 13 \\    \end{tabu} \end{adjustwidth}  \section{This is what happens} \begin{adjustwidth}{-1in}{-1in}     \begin{longtabu} to \linewidth {*{13}{|X[l]} |}     01 & 02 & 03 & 04 & 05 & 06 & 07 & 08 & 09 & 10 & 11 & 12 & 13 \\     01 & 02 & 03 & 04 & 05 & 06 & 07 & 08 & 09 & 10 & 11 & 12 & 13 \\     01 & 02 & 03 & 04 & 05 & 06 & 07 & 08 & 09 & 10 & 11 & 12 & 13 \\     01 & 02 & 03 & 04 & 05 & 06 & 07 & 08 & 09 & 10 & 11 & 12 & 13 \\     \end{longtabu} \end{adjustwidth}  \end{document}


Is there a theorem that tells us that $\widehat{f\circ g}=\hat f(\hat g)$?

Is there a theorem that tells us that $\widehat{f\circ g}=\hat f(\hat g)?$ Here, $\hat f$ denotes the Fourier transform of $f$.


How can I prevent installation of a specific package on Linux Mint?

TL;DR  Question: How can I disallow installing of the package intel-microcode in the future? With my bad memory, I may try installing it someday, again.    Long story  Yesterday, I installed the intel-microcode package on Linux Mint 18.3 using driver-manager.  Problem: in this laptop's case, it causes a complete system freeze.  Reproducible: Yes, after each boot.  When: Every time the system boots up. More specifically, sometimes at loading initramfs, more often very soon after login (up to some 5 minutes).    Kernel: 4.13.0-38-generic.  Hardware: not old but not new laptop Lenovo IdeaPad Z50-70, exact model 59-432384.  BIOS: 9BCN31WW.  Note for BIOS upgrade: Since Lenovo provides BIOS upgrades for Windows only, I can't upgrade. The latest BIOS is dated 24 Sep 2015, which is long time ago anyways, .  CPU: i7-4510U, .  dmidecode, relevant CPU part:  Processor Information         Socket Designation: U3E1         Type: Central Processor         Family: Core i7         Manufacturer: Intel(R) Corporation         ID: 51 06 04 00 FF FB EB BF         Signature: Type 0, Family 6, Model 69, Stepping 1         Flags:                 FPU (Floating-point unit on-chip)                 VME (Virtual mode extension)                 DE (Debugging extension)                 PSE (Page size extension)                 TSC (Time stamp counter)                 MSR (Model specific registers)                 PAE (Physical address extension)                 MCE (Machine check exception)                 CX8 (CMPXCHG8 instruction supported)                 APIC (On-chip APIC hardware supported)                 SEP (Fast system call)                 MTRR (Memory type range registers)                 PGE (Page global enable)                 MCA (Machine check architecture)                 CMOV (Conditional move instruction supported)                 PAT (Page attribute table)                 PSE-36 (36-bit page size extension)                 CLFSH (CLFLUSH instruction supported)                 DS (Debug store)                 ACPI (ACPI supported)                 MMX (MMX technology supported)                 FXSR (FXSAVE and FXSTOR instructions supported)                 SSE (Streaming SIMD extensions)                 SSE2 (Streaming SIMD extensions 2)                 SS (Self-snoop)                 HTT (Multi-threading)                 TM (Thermal monitor supported)                 PBE (Pending break enabled)         Version: Intel(R) Core(TM) i7-4510U CPU @ 2.00GHz         Voltage: 0.7 V         External Clock: 100 MHz         Max Speed: 2600 MHz         Current Speed: 1900 MHz         Status: Populated, Enabled         Upgrade: Socket BGA1168         L1 Cache Handle: 0x000B         L2 Cache Handle: 0x000C         L3 Cache Handle: 0x000D         Serial Number: To Be Filled By O.E.M.         Asset Tag: To Be Filled By O.E.M.         Part Number: To Be Filled By O.E.M.         Core Count: 2         Core Enabled: 2         Thread Count: 4         Characteristics:                 64-bit capable                 Multi-Core                 Hardware Thread                 Execute Protection                 Enhanced Virtualization                 Power/Performance Control     Temporary solution: I was lucky, that one time the computer booted fine and I was fast enough to uninstall this package, again, through driver-manager.


standardising non normally distributed predictors for regression

In regression, standardization is recommended in ordered to assess the relative importance of predictors. However there seems to be an assumption of normality? How would the interpretation work for predictors following different non normal distributions? It seems confusing...


Windows 7 "freezes" (chills?), and then "unfreezes" after about 1 minute

I have an Acer Timeline 1810T netbook (4GB RAM) with Windows 7 x64.  About once or twice a day, it "freezes" - the reason I put this in quotation marks is that it does not really freeze, as I you cant move mouse, etc.  I can move my mouse and jump between different applications, but I cant use the applications for anything. So I can jump between notepad and Firefox, but I cant browse to a new web page.  I have been trying to determine the source of this misery for a while now, and I suspect it has something to do with the hard drive - indirectly if not directly. Here are some screen shots of the resource monitor during a "freeze" and during normal operation:  Freeze:    Normal operation:    As you can see, CPU is fine during freeze, but the disk is going bananas.. Does anyone have an idea of what these reading means, or about the problem in general? There seems to be no specific activity that sets this off - it can be during browsing, or during media playback with nothing else open.  The fact that I can see navigate to applications but not use them might suggest a hard drive problem as well? Maybe I can access the stuff that is in RAM, but not anything that would require interaction with the drive.


Link between distance of a stabilizer code and number of errors it is able to correct

I am confused by a property.  In the N&Chuang it is said that an $[n,k,2t+1]$ stabilizer code is able to correct up to $t$ errors. But for me if the code has distance $d$ it should be able to correct up to $d-1$ error.  Indeed, the distance of a quantum code is defined as the minimal weight of an element in $Z(S)-S$ (uncorrectable errors).  But then, if my error has a weight $d-1$, it is not in $Z(S)-S$ and I will be able to correct it ? Thus an $[n,k,d]$ code is able to correct up to $d-1$ error.  Where is my mistake ?


Force Accepted Answers on Questions by Inactive Users

As a disclaimer, I must admit this may benefit me (I haven't checked), but probably not as significantly as most others. This issue is also something that has prevented me from answering questions by users with 1 rep in the past, especially if they are poorly fashioned. The Problem New users with a programming question find SO from various methods, such as google. They ask a question with haste, hoping for a quick answer -- which they usually receive. Many of these users have no interest in Stack Overflow itself, but are simply interested in getting the solution they require. As a result of this, they'll check the site regularly for the first day or two until a sufficient answer has been posted. Once they get what they need, they bail; without the required rep or understanding that they should up-vote and select a response as the answer. The Result A great many questions on SO are abandoned by users with no intention of ever coming back. The answer they require has been provided, but for one or more reasons they have neglected their duty of contributing back by way of awarding reputation. The Reach (Since Jeff loves Datum) Some queries on the data dump examine the reach of this 'problem'. The query I used is based on extensions of the following base query; SELECT p1.Id, p1.Score, p1.OwnerUserId, p2.OwnerUserId, p2.Score FROM posts p1  INNER JOIN posts p2 ON (p1.Id=p2.ParentId) LEFT JOIN users ON (p1.OwnerUserId=users.Id) WHERE p2.Score >= 2  AND p2.Score = ( SELECT MAX(p3.Score) FROM posts p3 WHERE p3.ParentId=p1.Id ) AND users.Reputation < 15 AND p1.PostTypeId = 1 AND p1.AcceptedAnswerId = 0  Result: 3,288 Questions by users with under 15 rep which have answers with 2+ up votes that have no accepted answer. Adding: AND (users.LastAccessDate-p1.LastActivityDate) < 604800 // 1 week AND p1.CreationDate < 1249084800 // 1249084800 is 1 week before latest dump data  to the where clause further reveals that 877 questions that have answers with 2+ up votes have no accepted answer, and the owner of the question has not returned since the week the question was asked. Modifying there where clause, and removing the left join: AND p1.OwnerUserId = 0    Reveals a staggering 3,675 questions with answers of 2+ votes by deleted users.  These are questions that were probably answered but the users who did the work can never be recognized. Building off the previous and using an even more restrictive WHERE clause WHERE p2.Score >=5  Still 1,178 posts that can never have an accepted answer. How many posts are there with over 5 up votes that don't provide the correct answer? Modifying the where clause for Reputation to AND users.Reputation = 1  Still reveals 388 questions by users with 1 rep have been abandoned. Solution Similar to how bounty questions work, if a user has abandons the site (not active since x time after the question was asked) with a question that has answers with 2+ up votes, force the answer with the most up votes to be the selected answer. This will reduce the amount of questions that are unanswered, and also give users more of an incentive to answer questions by new users without extra hesitation.  Update Added more statistics for deleted users.  Please feel free to add/remove rules to make this a truly practical feature.


I have been stuck trying to write PHP code inside some HTML tags I set up.   I have a variable inside a .php file called $content, and I have a HTML page code inside this variable in the following way:   $content = <<<HTML        some html code in here         HTML;  Now, within that HTML tag I wanted to add some PHP code, tried using <?php    .....     ?>, however I wasn't successful with it. Can anyone help?


I am working on a navbar for a website. It contains 3 dropdowns (and a bunch of other stuff I removed to keep the code concise). I want to be able to close the dropdowns by clicking outside of them. I have found many solutions which dealt with this (including the ones on this site), but all of them only accounted for having one such dropdown and I was unable to adapt them to my situation. What I want to achieve is:   If you click one of the buttons, it gets a is-active class (which makes its dropdown visible via a sibling selector in CSS) and removes it from all other buttons in the menu. If you click on an open dropdown window, nothing happens. If you click outside of any dropdown buttons and windows, the is-active class gets removed from all the nav buttons that have it.   No matter which recommended solution I tried, one or more of these stopped working as expected. Could anyone help me figure it out?    $('[data-toggle]').click(function() {     var params = $(this).data('toggle');     $(params['target']).toggleClass(params['class']); })

             <button class="main-nav__button" data-toggle='{"target":"[data-toggle-target=\"books\"","class":"is-active"}' data-toggle-target="books">Knihy</button>
                 // Dropdown contents

             <button class="main-nav__button" data-toggle='{"target":"[data-toggle-target=\"info\"","class":"is-active"}' data-toggle-target="info">Informácie</button>
                 // Dropdown contents

             <button class="main-nav__button" data-toggle='{"target":"[data-toggle-target=\"profile\"","class":"is-active"}' data-toggle-target="profile">                              </button>
                 // Dropdown contents

     This code just toggles the dropdowns. My attempts at autoclosing functionality were in separate functions, but I no longer have them, since none of them worked - sorry.  A bonus question: Is there a way of putting the self keyword into an HTML data-attribute?


How can I determine all the matrix A 3x3 in R such as AB=BA for all B 3x3 in R (without determinants)

Determine all the matrix A 3x3 in R such as AB=BA for all B 3x3 in R (without determinants)


How to create a graph with two Y axis with different values in Excel

How do you make a scatter graph with 2 Y axis (one on the left and one on the right)? I have 2 scatter graphs that I want to combine. I need to have 2 lines, both lines have the same dependent variable but have their own independent variable. Click the link "graph" below to get an idea of what I'm looking for.  (I'm using google sheets but I can also find a computer with Excel if needed)


Will using LINQ to SQL help prevent SQL injection

I'm setting up a public site and the first thing on my mind is SQL injection. I have some text fields I'm saving and am using linq to update/write to the database. Am I safe using linq?   This example is creating the user account.   Data.MemberRegistrationDataContext context = new MemberRegistrationDataContext(); Data.tbl_Member_UserProfile profile = new tbl_Member_UserProfile(); profile.SSN = Convert.ToDecimal(Session["tempMemberSSN_Registration"]); profile.UserName = userName; profile.Password = password; profile.EmailAddress = email; profile.QuestionID = qID; profile.QuestionResponse = securityAnswer; profile.LastModDt = DateTime.Now; profile.LastModBy = "web"; context.tbl_Member_UserProfiles.InsertOnSubmit(profile); context.SubmitChanges();   This example is changing the password     MemberRegistrationDataContext dc = new MemberRegistrationDataContext();    var mProfileRecord = dc.tbl_Member_UserProfiles.Single(c => c.SSN == sSSN);    mProfileRecord.Password = sNewPassword;    dc.SubmitChanges();   Are these safe? Does LINQ parameterize the SQL it generates automatically?


I'm using Ubuntu 12.04 with Pitivi 0.94 and I just created a new project and did some video editing in it. Now I want to render a video file in any format, but that seems to be not so easy.   I tried nearly all formats and codecs provided by pitivi and each of them either renders video with rubbish quality (about 1 kbps, no matter what bitrate I set in pitivi) or just crashes. Searching online I didn't find any render setting that would produce acceptable video quality.  So the question is: has anyone ever managed to get watchable quality output from pitivi and if so, what settings should be used for this?


If I have a series of points (coordinates), how do I find the location of a new point as far away from all the other points as possible?

If I have a map with a series of locations and I want to find a new point which is at the maximum distance away from all of these points but within the interior of the boundary made up of the outermost points. In layman's terms, how would i go about this? Apologise if there is lack of clarity, I haven't done much maths for a while! Thanks in advanced!


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?


Torsion on $\pi_1(X)$, $X$ connected and open in $\mathbb{R}^n$

Can the fundamental group of an open connected subset $X$ of $\mathbb{R}^n$ have a torsion element?


What is the 'best' package for typesetting chemical formulas? (I don't need anything but the chemical formulas.)  Assume I want to typeset     The dissociation of a AgBr molecure requires an energy of $E = \SI{123456789}{\J}$.   I am using the  package for the physical quantity but what about AgBr?


Removing the Bracket from the First Line of bmatrix

How can I write a matrix with a header line that is not bracketed? I have used the following code to produce the results below. In addition of being ugly, it is impractical when I need to align the first row, n1, ..., n6 with the matrix columns.  \documentclass{book}  \usepackage{amsmath}    \begin{document}    \[ \ \ \ \ \ \ \ n_1\ \ \ \ \ \ \ \ n_2\ \ \ \ n_3\ \ \ \ \ \ \ \ \ n_4\ \ \ \ n_5\ \ \ \ n_6\]     \[ \begin{bmatrix}         1 & -1 & 0 & 0 & 0 & 1\\         0.960 & -0.977 & 0 & 0 & 0 & 0.983\\         0 & 1 & -1 & -1 & 0 & 0\\         0 & 0.977 & 0 & -0.983 & 0 & 0\\         0 & 0 & 0 & 1 & -1 & -1\\         0 & 0 & 0 & 0 & 0 & 1\\        \end{bmatrix}        \begin{bmatrix}n_1\\n_2\\n_3\\n_4\\n_5\\n_6\end{bmatrix} =        \begin{bmatrix}0 \\ 0 \\ 0 \\ 0 \\ 0 \\ 100\end{bmatrix} \]  \end{document}


cd - can switch between current dir and previous dir.  It seems that I have seen - used as arguments to other commands before, though I don't remember if - means the same as with cd.  I found that - doesn't work with ls.  Is -  used only with cd?


How to install Ubuntu to a hard drive without the installer process

So for various reasons I can't boot off an install usb. So instead I have been taking the Hard drive out of my laptop and then writing to it with Universal USB installer. The result though is that I can boot up on my computer into an installer but I cant run it because it would install on the very HD im installing from.  How can I run the installer you normally get when you boot up onto the HD on windows?


How many positive numbers need to be added together to ensure that the sum is infinite?

The question in the title is naively stated, so let be make it more precise: Let $\sum_{n\in\alpha}a_n$ be an ordinal-indexed sequence of real numbers such that $a_n>0$ for each $n\in\alpha$, where $\alpha$ is an ordinal number. What is the smallest $\alpha$ which guarantees that $\sum_{n\in\alpha}a_n$ diverges? Since bijections correspond to rearrangements of the sum, and since the $a_n$ are positive, the sum is either absolutely convergent or diverges to $+\infty$ regardless of the order, so it follows that $\alpha$ is a cardinal number. My intuition tells me that $\alpha=\omega_1$, but I can only prove that $\alpha\le\frak{c}^+$, as follows:  Let $\sum_{n\in\frak{c}^+}a_n$ be a sum of positive reals with $\frak{c}^+$ terms, and let $s_\beta=\sum_{n\in \beta}a_n$ be the sequence of partial sums, so that $s_{\beta+1}=s_\beta+a_\beta$. Then if $\beta<\gamma$, $s_\beta<s_\beta+a_\beta=s_{\beta+1}\le s_\gamma$, so in particular, the $\{s_\beta\}$ are all distinct, and $|\{s_\beta\}|=\frak{c}^+$. If $\sum_{n\in\frak{c}^+}a_n=A$ is finite, then every partial sum is less than $A$, so $\{s_\beta\}\subseteq [0,A]\subseteq\mathbb{R}$, so $\frak{c}^+=|\{s_\beta\}|\le|\mathbb{R}|=\frak{c}$, a contradiction. Thus $\sum_{n\in\frak{c}^+}a_n$ is not finite.  As indicated above, $\alpha\ge\omega_1$ is obvious because $\alpha$ is a cardinal, and $\sum_{n\in\omega}2^{-n}=2$ is finite, so $\alpha>\omega$. Can anyone prove that $\alpha\le\frak{c}$ or that $\alpha=\frak{c}^+$? I can't imagine any set of positive numbers indexed by reals whose sum could possibly be finite, so I lean strongly toward $\alpha\le\frak{c}$, but I don't know how to prove it.


Object locks instance member to synchronize access to it

Is it neccessary to create a placeholder lock object to for thread-safety (and correctness) or is it sufficient to lock on the resource itself (assuming no other code will need it).  locking a System.Random  private static readonly Random rnd = new Random(); public static int Rand(int min, int max) {     lock(rnd) {         return rnd.Next(min, max);     } }   using a separate placeholder/dummy lock object  private static readonly Random rnd = new Random(); private static readonly object rndLock = new object() public static int Rand(int min, int max) {     lock(rndLock) {         return rnd.Next(min, max);     } }   this may seem trivial but i'm concerned with if the first code-block is susceptible to deadlock or other issues


When I press brightness contrast button to reduce and increase the brightness in Ubuntu it is neither showing any brightness bar nor having any effect on brightness.  However, when I manually change my brightness, it is working.


Error in Connect to the Access Database In Vb.net

I made a Database in access and i saved it in my Desktop then in Data Grid View I clicked Choose Data Source and then Clicked Add Project Data Source... Then I Clicked New Connection and i choose Microsoft Access Database File (OLE DB) then I Choose My Database From Desktop... Now What user name & password I have to write???My Username & Pass in windows??? I Clicked Test Connection then a message Show :  The 'Microsoft.ACE.OLEDB.12.0' provider is not registered on the local machine.   What can i do?? Thank You So much :X


How do I fill table cells with a background color?

I'd like to fill the cells of a table with a background color. How can this be done?


How to install LibreOffice 4.1 in Ubuntu?

I downloaded LibreOffice 4.1 and I want to install it in Ubuntu. I read its readme file. It said I have to first uninstall previous LibreOffice but I don't know how to do uninstall it.


I am travelling from Canada to Mumbai next month via Munich in AIr Canada.  I would like to take one day break at Munich, for a sight seeing.  What all are the formalities for this?. Do i need a transit visa for this?.


BibLaTeX: bibliography not appearing in table of contents

I have a report created in Latex:  \documentclass{report} \usepackage[backend=bibtex]{biblatex} \addbibresource{testbib.bib} \begin{document} \tableofcontents \chapter{First chapter} For more information see \cite{ahu61}. \printbibliography \end{document}     The Bibliography is not present in the Table Of Contents. How to fix?


Prove or disprove that every even integer is the difference of two squares.

I don't know where to start. Let $2k$ be an even integers and $a^2 - b^2$...


Does anyone know any fun dice/card/gambling games that i can throw into my campaign for some good flavor?  Here are a few links to a  that I posted and a  of dice games.  If you've got any other good ones, please share!


These symbols are in the Word 2010:  Then how should I find them for LaTeX ?


What is the term for repetition of an initial syllable in successive words?

In Anne Tyler’s , one character comments on the name of another     Carla Carlucci: alliteration. Or something more than alliteration, but I don’t know the term for it.    is     the use of the same consonant (consonantal alliteration) or of a vowel, not necessarily the same vowel (vocalic alliteration), at the beginning of each word or each stressed syllable in a line of verse, as in around the rugged rock the ragged rascal ran.   Collins    is      the use of word-endings that are similar or the same, either intentionally for rhetorical effect or by mistake during copying of text.   Collins  An example is found in Ursula K. LeGuin's      He arrived at ideas the slow way, never skating   over the clear, hard ice of logic, nor soaring   on the slipstreams of imagination, but slogging,   plodding along on the heavy ground of existence.   Obviously there is alliteration present in Ms. Tyler’s example, but it does seem like something more, deserving of its own nomenclature. Is there a standard term for the repeated use of a syllable at the beginning of successive words?


I've written an exam paper for my students, using the  class with fairly standard options, and specifically using the 12pt class option for 12 point type. I've just been informed that a student has vision problems that require an 18pt main font. What is a good way to achieve this? Some things that might be of impact:   I don't make much use of smaller fonts (e.g., \small, etc.) but redefining just normalsize would not be sufficient since question headings, etc., use a larger size (mostly \large). Probably the cover page could remain the original size - it's the main question text that really matters Something a bit more that 18pt would be fine I do not want to switch classes, as my existing source depends upon the exam class I have been asked to keep to the original A4 page size, rather than scaling everything up to a larger page, because exam desks have limited size.


When you promote a product or service that a user hasn't experienced yet, would you use 'Guarantee to love' or 'Guaranteed to love'?


I have a html string, where i need to grab the src and href values, if they meet a pattern. The pattern is;  /myfolder/[gu-id]/[image,file]   The gu-id is in the pattern of '65f2383b-de39-4a9c-8e8c-de1c06e469ca' The image or file can be any jpg,gif,pdf,doc,xlsx.png,txt,zip and so on.  My current regex is this: ((\/myfolder\/[({]?[a-fA-F0-9]{8}[-]?([a-fA-F0-9]{4}[-]?){3}[a-fA-F0-9]{12}[})]?\/?.*\.(?:png|jpg|pdf|gif|jpeg|xls|xlsx|word|doc|txt|zip)))  But in a string with multiple files, it ends with the last one, as the end of the first match - so it only finds one match, but the end point, is another file.  How can I make it match every file, and not only one?


I am getting the "wrong input table name" when use TRUNCATE as following:  TRUNCATE `stats`   The table should bans.  How to recover stats table?  I am using CentOS 6, and MySQL-Server.


I am new to bash. Need suggestion for the following problem.   So I want to execute the script in this way   ./myscript --bootstrap bootstrap.exe --vmmount ./vmmount --image /dev/sdb2 --target-exe installer.exe [--internal-exe] param1 param2 param3 ...   Argument parser i have done:  VMMOUNT="" BOOTSTRAP="" IMAGE_FILE="" TARGET_EXE="" INTERNAL_EXE="" while : ; do if [ "$1" = "--vmmount" ] ; then     [ -n "${VMMOUNT}" ] && usage     VMMOUNT="$2"     shift     shift elif [ "$1" = "--bootstrap" ] ; then     [ -n "${BOOTSTRAP}" ] && usage     BOOTSTRAP="$2"     shift     shift elif [ "$1" = "--image" ] ; then     [ -n "${IMAGE_FILE}" ] && usage     IMAGE_FILE="$2"     shift     shift        elif [ "$1" = "--target-exe" ] ; then     [ -n "${TARGET_EXE}" ] && usage     TARGET_EXE="$2"     shift     shift elif [ "$1" = "--internal-exe" ] ; then     [ -n "${INTERNAL_EXE}" ] && usage     INTERNAL_EXE="true"     shift     shift else     break fi done my_method "${IMAGE_FILE}" "${VMMOUNT}" "${BOOTSTRAP}" "${TARGET_EXE}" "${INTERNAL_EXE}"    Now I have confusion in parsing the parameters param1 and param2 etc. How to parse them ? Can I use $@ to take the params as array or any other efficient way ?


I need to factory reset my Macbook but cannot recall the password. So I used Cmd+R during startup and go to terminal and typed 'resetpassword' according to this advice    Now 'Reset Password' application appears but there is nothing where I have to select the volume containing the user account. Why does this happen?


Just a few questions about Hyper-V virtual machines and clustering

I have been using Microsoft’s Hyper-V technology for a little while now, but I am just now dipping my toe into clustering.  In particular, I am trying to implement a fault-tolerant SQL DB. This involves setting up two VMs, clustering them via Failover Cluster, and then installing SQL Server in some fashion. I have two physical machines - one high-end and rather beefy “heavy lifter” to contain the majority of the VMs, and another “backup” (a repurposed desktop) to hold the essential “secondary” (or failover) AD-DC, SQL and FS VMs.  The main reason why I find the failover cluster at the VM level so attractive is that it presents a single IP and DNS entry to the network as a whole - if one machine (physical or virtual) goes down, you might loose some ping and the connections get reset, but the network applications (Microsoft RMS connection to backend SQL) can still connect to a viable DB without having to mess around with the settings at all.  My first question is in terms of SQL Server itself. If I have a cluster between two VMs, does it make more sense to install the SQL Server in Failover Cluster configuration or should I simply install it in a stand-alone config and mirror the DBs? For example,  suggests just mirroring the DBs, but do I just mirror standalone DBs on standalone VMs, or can I get the network and failover benefits of clustered VMs while still utilizing (on each clustered VM) standalone DBs that have been mirrored between each other?  As well, I have come across a lot of documentation about SQL clustering, but most assume a number (#>2) of physical machines to hold not only the actual SQL VMs but also the Quorum and Witness stores. I will not be able to muster more than two physical machines. As such, I will have to be satisfied with a VM cluster that does not exceed two VMs (one for each physical machine).  Another issue involves MSDTC - the Distributed Transaction Coordinator. When attempting to install the SQL Failover Cluster (I never completed it for this reason) it threw a hissy fit because MSDTC had not been clustered. Search as I might, I have not yet found a way to do so under Windows Server 2012 R2. I have found , but these instructions don’t align with 2012 R2 (at least, not in a way that allows me to successfully cluster MSDTC). Plus,  that I have found for SQL Server Failover Cluster installation suggest that a third “network device” - shared network storage (a SAN) - is required for the DB itself (and other functionality). I do not have this, and won’t be getting this. Most of my storage exists on the “heavy lifter” that was designed for all of the “primary” VMs. If that physical machine goes down, so does the storage. The secondary server does have enough resources for an AD-DC Server, an SQL server and a File Server, so it will handle the “secondary” failover versions of those VMs (clustered or not).  My final question involves file servers. If I cluster file servers between two VMs (one on my “heavy lifter” and another on my “backup”, how do I mirror the data between them? Clustering VMs only provides a single point of access on the network for a resource, it doesn’t exactly replicate data between the two - that is left to the services that serve up that data. I am unsure how I can ensure that file server data between two clustered file server VMs can be properly mirrored. Remember, I only have two devices to be used here - my primary machine and a backup secondary. There is no chance of me obtaining a SAN or any other type of network attached storage. What exists on the machines must act as the storage.  Thanks in advance for any suggestions.


Difference between c.toArray(new String[size]) and c.toArray(new String[] {})

I can't seem to find an explanation for this. Does new String[] {} provide a more efficient way of providing the type of array?


What are the pros and cons when shooting in RAW vs JPEG?

In general shooting in RAW format uses a lot more file storage than JPEG. What am I gaining when shooting RAW? Besides file size are there any downsides to shooting RAW?


The sum of an infinite series containing a finite series in each denominator

Evaluate   $$\frac{1}{1^2}+\frac{1}{3^2}+\frac{1}{6^2}+\frac{1}{10^2}+\cdots+\frac{1}{\left[\frac{k(k+1)}{2}\right]^2}+\cdots$$    to $\infty$, where $k$ is the $k$th term of the series.   Using Microsoft Excel, I found that the sum of the first $100$ terms $=1.15947\dots$.  Does the convergence value have an exact form? If yes, what is it?


smallest number divided by $10,9,8,7...2$ with remainder $9,8,7,6...1$

What is the smallest whole number such that, when divided by each of $10,9,8,7,...,2$ gives a remainder of $9, 8,7,6,...,1$, respectively?  One can use the Chinese remainder theorem for each pair of $3$ or $4$ numbers, but for $9$ numbers it'll take quite a while. Is there another way or formula to do this problem? Thanks.


Standard Deviation. Why do we take the square root of the entire equation?

Please forgive my lack of maths knowledge,  It is my understanding that:  Standard Deviation is the average distance from the mean in a data set of numbers.  Therefore it stands to reason that working out the standard deviation of the data set $x_i = \{1,2,3,4,5\}$ would involve the following.  First working out the mean $\mu(x_i) = 3$ and Then working out the sum of the distance from the average $\sum{|x_i-\mu|} = 6$ then we do $\frac{\sum{|x_i-\mu|}}{N} = \frac{6}{5} = 1.2$  This means that, according to my method/thinking, 1.2 is the standard deviation.  However when using the formula $\sqrt{\frac{\sum{(x_i-\mu)}^2}{N}}$ I get $1.414$  Can someone explain why I'm wrong in layman terms. Thankyou


how can I increase my RAM size with a swap partition?

Presently my RAM is 2GB. I heard that in linux we can get extra memory to RAM from the harddisk by using swap partition. What is the procedure for that?   here in the pics i'm giving my system info.


Bash prompt error when pressing up arrow

I've written this nice and colorful prompt for my OS X terminal:   parse_git_branch() {     git branch 2> /dev/null | sed -e '/^[^*]/d' -e 's/* \(.*\)/ [\1]/' }  export PS1="\e]2;\w\a\e[1;30;1m\][\u@\[\033[0;36m\]\h\e[1;30;1m\]:\[\033[0;35m\]\w\e[1;30;1m\]] \[\033[0;31m\](\t) \[\033[0;33m\]\$(parse_git_branch)\n\[\033[0m\]\e[1;30;1m\]\$\[\e[0m\]"   I source ~/.bash_profile it and it works fine. except when I use the arrow up to navigate the history I get a weird thing happening.   basically the beginning of the source ~/.bash_profile command in the history, becomes part of the prompt. when I ctrl+c or enter it returns to normal, but as soon as I see the history of the source command the prompt changes again.   Here's an example where I've seen the history and then ctrl+u and typed ls:   [user@host:~/Documents] (14:01:40)  [branch] $source ~/.ls   Any clue about this?


Need to prove or disprove an alternative group definition.

Let be the non empty set $G$ with the operation $*$ satisfy the following 3 conditions:  $a(bc) = (ab)c$, for all $a, b, c \in G$ (associative law). For every $a,b$ there is $c$ such that $ac = b$. ($c$  is the "path" from $a$ to $b$). For every $a,b$ there is $d$ such that $bd = a$. ($d$ is the "path back" from $b$ to $a$).   Prove or disprove: $G,*$  is a group.  Asociativity: Proof: from 1) Identity element: Proof: According to 2) For every $a,a$ there is $e$ such that $ae = a$. Let proof $ea=a$. According to 2) For every $e,e$ there is $X$ such that $eX= e$. Let's check the two possibilites:  $X=a,$ $X\neq a$  If 1) then $ea=a$ proved. If 2): $eX=e$ then what? Every try failed. Someone can do it?


What exactly is the color charge in QCD?

I don't have strong background in particle physics. Though, I had learnt a little of it. I have gone through the basic of these stuffs (pretty OK). If I have done my homework right, color charge (R,G,B and their anti-colors) has nothing to do with "colors". They pair up in some fashion to form a gluon, which are 8 in number. Gluons are the force carriers between the quarks. But my question is : "What exactly is the color charge? How do they name the colors? Is naming arbitrary?"  Question like this has been asked already  but I hardly think these answers address my question.


Changing color within word in script font

I am writing some text for our school and it needs to be in some German-Script-Font (Schulausgangsschrift) which I do using the package "Schulschriften". Some letters of the words need to be colored, some don't. But if I change the color using \color or \textcolor the script letters are not properly connected anymore. Do you have any advice? Here are my results:  And here is my code to get this: \documentclass[28pt,a4paper,]{article} \usepackage{wesa} \usepackage[latin1]{inputenc} \usepackage{color}  \begin{document}  This Text ist in one color, so the last o is correctly connected to the t:\\ \wesa Boot  \normalfont Using color: o and t are not properly connected:\\ \wesa  B\color{red}oo\color{black}t  \normalfont Same with textcolor:\\ \wesa B\textcolor{red}{oo}\textcolor{black}t  \end{document}


In the context of speech, is there a word like *dictator* to describe a person who *dictates* (a person who speaks, says something, etc: *dictator*)?

In the context of speech, is there a word like dictator to describe a person who dictates (a person who speaks, says something, etc: dictator)?   I tried to research this, but it seems that the word dictator is used only to describe a person who behaves in an autocratic way.


Why does tasksel remove so many packages when switching from xubuntu to vanilla gnome?

I ran tasksel, then deselected Xubuntu desktop and selected Vanilla GNOME and now observing it is deleting a lot of packages, which look irrelevant, like samba, pulse audio and etc. Why?


Two versions of Eulers theorem and how they relate.

I am familiar with the following Euler Theorem: (Note: In the following ø(n) is the Euler function) version i) If gcd(x,n)=1, then $x^{ø(n)} = 1$ (mod n). Version ii) However, I have seen the following version described as Eulers theorem too: if $a = b$ (mod ø(n)), then $x^a = x^b$ (mod n) if gcd(x,n)=1. My question is then, if they are equivalent, how can i show that version i) implies version ii) ? Thanks,


I'm interested in cutting edge string theory studied by research physicist. I'm wonder what  mathematics is needed and how far am I in terms of mathematics background needed and how much more mathematics do I need in order to study it properly and reach my goal. My mathematics level is at calculus/Linear algebra.


I can get the project to run but it breaks once the question pops up

I keep getting a : java.lang.NullPointerException error message.  the: healthDamage(selectedCardOption.GetHealthAdjustment());  Then the error says "Null pointer access: The variable selectedCardOption can only be null at this location"  I guess I'm not sure why it keeps breaking the game. Also, where would I even add the option in to make it work?   I tried making a local variable field and it didn't work.   // Gather input from player   Integer input = scanner.nextInt();          // Showing Player Number They Selected         System.out.println("You've Selected Option: " + input.toString());         System.out.println("");          // Process Card Option         CardOption selectedCardOption = null;         for (int i = 0; i < card.getOptions().size(); i++) {             CardOption cardOption = card.getOptions().get(i);              if (cardOption.GetInput() == input) {                 selectedCardOption = cardOption;             }         }         // Only process if valid         if (selectedCardOption != null) {             if (selectedCardOption.GetIsExit()) {                 System.out.println("You've chosen to leave.. Thanks for playing!");                 running = false;             }         } else {             // Adjust Health and Skill based upon selection             healthDamage(selectedCardOption.GetHealthAdjustment());             System.out.println(                     "You've taken" + Integer.toString(selectedCardOption.GetHealthAdjustment()) + "Damage!");              skillIncrease(selectedCardOption.GetSkillAdjustment());             System.out.println(                     "You've added" + Integer.toString(selectedCardOption.GetSkillAdjustment()) + "this time");             // TODO: Logic to handle sub cards         }         if (selectedCardOption.getCards() != null && selectedCardOption.getCards().size() > 0) {             Random r = new Random();             int cardIndex = r.nextInt(selectedCardOption.getCards().size());             card = selectedCardOption.getCards().get(cardIndex);         }   The game is supposed to bring up a series of questions. It breaks upon starting.


What is the difference between union and union all in mysql?

Can anyone please tell me the difference where to use union and where to use uinon all in mysql


What will happen if I install more RAM than specified in manual?

I just installed a new motherboard, MSI K9N Neo V3 with an Athlon X2 4400+. I bought a 2GB stick of RAM (), with the intention of ordering 3 more when I have the extra money, for a total of 8GB. The problem is, in the manual for this board, it said that the maximum RAM is 4GB. So is there a chance it will work with more than 4? Its kind of an old board, I thought maybe at the time they wrote the manual, the maximum available was 1GB per stick.