Should a PhD student be credited in supervisor’s article that is based on a book chapter by both?

Jane is doing a PhD and is supervised by Professor Mary. Mary asked Jane to put together a review article for a book based on a draft chapter from Jane’s thesis with additional suggestions from Mary. The book article was submitted with the authors listed as Jane and Mary (corresponding author). I am unsure whether this has actually been published, though it was submitted well before the now-published review by Mary.  Sometime later, Mary submitted a broader review article online which used large chunks of text and figures from the book article which were directly written/generated by Jane. Whole paragraphs were copied verbatim from the first article to Mary’s article, and many more paragraphs were slightly rewritten but contained exactly the same references and phrases from the first article. Mary’s paper did not cite the book review. Mary was listed as the sole author. Jane was not informed this review was being written, and was not asked for permission to include her figures or content from the book article, which were originally written by her for her thesis.   Did Jane ‘hand over’ the rights to her written material to Mary by agreeing to submit the book article under both of their names? Should Mary have credited Jane in the article as a second author because she used exact sentences from the book article which were written by Jane? Will Jane still be able to use these (her) phrases and figures in her thesis despite not being credited on Mary’s online article?


Could you recommend some classic textbooks on ordinary/partial differential equation?

I love R. Courant and F. John's Introduction to Calculus and Analysis because of its wide coverage, precise description and friendly written style.  Are there any classic textbooks like it on ODE/PDE?  thanks.


Group of order $2m$ where $m$ odd has a subgroup of index 2.

Show that a group $G$ of order $2m$, where $m$ is odd, has a subgroup of index $2$.  I am feeling a little dubious about my proof.   Let $G$ act on itself by left multiplication to induce the homomorphism $\varphi: G \longrightarrow S_{2m}$ defined by $g \mapsto \sigma_{g}$ where $\sigma_{g}: S_{2m} \longrightarrow S_{2m}$ is defined by $\sigma_{g}(x)=gx$ for all $x \in G$. Let $\psi: S_{2m}\longrightarrow \{\pm1\}$ be the sign map homomorphism. Then $\Phi = \psi \circ \varphi$ is a homomorphism from $G \longrightarrow \{\pm1\}$.   If we can show $\Phi$ is surjective then $G/\ker\Phi \approx \{\pm1\} \implies |G:\ker\Phi|=2$.   By Cauchy's theorem there exists an element $g$ of order $2$ in $G$.     (This is the part I'm questioning) We have $\sigma_{g}$ corresponds to a product of transpositions in $S_{2m}$, namely $(x_{1},gx_{1})(x_{2},gx_{2})\cdots(x_{m},gx_{m})$. Therefore $\psi(\sigma_{g})=-1$ because $\sigma_{g}$ is a product of an odd number of transpositions.   Therefore (provided highlighted part is correct) $\Phi$ is surjective and the kernel is the desired subgroup.  Does this work?  Thanks.


Why is anti-neutrino produced along side with electron in beta minus decay?

so i get that when there is an excess of neutrons, neutron is converted into a proton. An electron is produced to neutralise the +1 charge of proton. But why is an anti neutrino produced?


i am trying to install a netgear wna3100 usb adaptor

How do you install a Netgear wireless adapter on a Ubuntu 14.04 and where do I download the install package from a windows laptop?


Prove that all but finite number of members of sequence are positive if limit is positive

Prove that if $x > 0$ and $x_n$ is a sequence with $\lim\limits_{n \to \infty} x_n = x$, then there is a real number $N$ s.t. whenever $n > N$, $x_n > 0$.  This is a homework question and I'm not really sure what methods I should use to prove this, can I get a push in the right direction? I am not expecting a flat out answer as it is a homework problem, but I am stumped!


$ f:\mathbb C\rightarrow \mathbb C$ defined by $f(z)=0$, if $Re(z)=0$ or $Im(z)=0$ and $f(z)=z$, otherwise.

I was thinking about the following problem :  Define $ f:\mathbb C\rightarrow \mathbb C$ by   $$f(z)=\begin{cases}0 & \text{if } Re(z)=0\text{ or }Im(z)=0\\z & \text{otherwise}.\end{cases}$$  Then the set of points where $f$ is analytic is:     (a) $\{z:Re(z)\neq 0$ and $Im(z)\neq 0\}$,   (b) $\{z:Re(z)\neq 0$ or $Im(z)\neq 0\}$,   (c) $\{z:Re(z)\neq 0\}$,   (d) $\{z:Im(z)\neq 0\}$.   I think $f(z)=z$ if $f$ is defined on the set $\{z:Re(z)\neq 0$ and $Im(z)\neq 0\}$ and in that case $f$ is analytic. But I am not sure about the other options. So, choice (a) is right. Am I going in the right direction? Please help. Thanks in advance for your time.


How to open a PDF file in Ubuntu using terminal?

I'm using this command: gnome-open file_name.xxx(xxx file extension) command but it's not working. I'm using Ubuntu 14.04.


Elliptic Curve and Divisor Example help (Step 3)

I am reading , specifically Example 2.3 on page 9, and am having a few problems understanding a part of it     We construct an elliptic curve $E$ on $\mathbb{F}_{11}$ defined by $y^2=x^3+4x$ with a point at infinity $\mathcal{O}$      We then find a divisor of $E$ $$D=\left[(0,0)\right]+\left[(2,4)\right]+\left[(4,5)\right]+\left[(6,3)\right]-4\left[\mathcal{O}\right]$$      We can then say that:   $$\begin{align}\text{div}(y-2x)&=\left[(0,0)\right]+2\left[(2,4)\right]-3\left[\mathcal{O}\right]\\ \text{div}(x-2)&=\left[(2,4)\right]+\left[(2,-4)\right]-2\left[\mathcal{O}\right]\end{align}$$      We can then replace various elements in the definition of $D$ with these divisors:      $$\begin{align}D&=\left[(0,0)\right]+\left[(2,4)\right]+\left[(4,5)\right]+\left[(6,3)\right]-4\left[\mathcal{O}\right]\\ &=\left[(2,4)\right]+\text{div}\left(\frac{y-2x}{x-2}\right)+\left[(4,5)\right]+\left[(6,3)\right]-3\left[\mathcal{O}\right]\\ &=\left[(2,-4)\right]+\text{div}\left(\frac{y-2x}{x-2}\right)+\left[(2,4)\right]+\text{div}\left(\frac{y+x+2}{x-2}\right)-2\left[\mathcal{O}\right]\\ &=\text{div}\left(x-2\right)+\text{div}\left(\frac{y-2x}{x-2}\right)+\text{div}\left(\frac{y+x+2}{x-2}\right)\end{align}$$   However, what I don't understand are the following steps:     $$\begin{align}  D&=\text{div}\left(x-2\right)+\text{div}\left(\frac{y-2x}{x-2}\right)+\text{div}\left(\frac{y+x+2}{x-2}\right)\\  &=\text{div}\left(\frac{(y-2x)(y+x+2)}{x-2}\right)\\  &=\text{div}\left(x^{2}-y\right)\end{align}$$   Can anyone help explain to me how they have come to this conclusion please    This question comes in 3 parts:   Step 1 -  Step 2 -  Step 3 - This one


$R^2$ equals square of correlation between observed and fitted responses

I'm having a hard time proving that $R^2$ is equal to the square of the sample correlation between $Y$ and $\hat{Y}$. Every book I search tells me that's very easy, like verbeek. They just state that from the definition of $R^2$ and knowing that $SST=SSR+SSE$, it's very easy to prove the claim. However, I've spent a lot of time thinking about it, with no sucess.  Any help would be appreciated.  EDIT (My try): $R^2=\frac{SSE}{SST}=1-\frac{SSR}{SST}$  Sample correlation$^2=\frac{\left(\sum(\hat{y_i}-\bar{y})(y_i-\bar{y})\right)^2}{ SST\cdot SSE }$  From then on, I have no idea...


$Lie(G \times H)\cong Lie(G)\oplus Lie(H)$

I am trying to solve an exercise from .  8-23. (a) Given Lie algebras $\mathfrak g$ and $\mathfrak h$, show that the direct sum $\mathfrak g\oplus \mathfrak h$ is a Lie algebra with the bracket defined by $$[(X, Y),(X',Y')]=([X,X'],[Y,Y']).$$ (b) Suppose $G$ and $H$ are Lie groups. Prove that $Lie(G \times H)$ is isomorphic to $Lie(G)\oplus Lie(H)$  The first question I could solve by showing linearity of the lie bracket and the Jacobi identity, using that the jacobi identity is true in $\mathfrak g$ and $\mathfrak h$. But how can I solve the second point?


Pages: frontpage.php, home.php, posts page etc

When do I use the following:   home.php frontpage.php Under Settings > Reading Settings  Front Page Posts Page    I wish to clarify this as I find myself using "Placeholder Pages", empty pages just for the sake of a menu item and to display blog listings.   If I use a Static Front Page (Set under Settings > Reading Settings > Front Page) how do I access my posts page? Do I need to have a "Placeholder Page" titled blog and use page-blog.php?


How to add user to sudo group in ubuntu server

I tried to add user to sudoers with adduser username sudo, as well as in /etc/sudoers, but it cannot be change because is read only.   Can someone help me please?


How should I see that the set of almost complex structures on $R^4$ preserving the positive orientation, namely $\{J\in GL^{+}(4,R), J^2=-I\}$ is homotopy equialent to $S^2$.   There is a similar question asked before, but I need more details as why this  set is $GL^{+}(4,R)/GL(2,C)$, etc.


Monos in $\mathsf{Mon}$ are injective homomorphisms.

Let $f: M \to N$ be a mono in $\mathsf{Mon}$. I want to prove that the underlying function $U(f): U(M) \to U(N)$ is injective.   How can this be done ? Thanks in advance.


Differentiating expressions with division in them

I would really appreciate an explanation of the steps needed to differentiate expressions such as:  $$\sqrt{\frac{1-2x}{1+2x}}$$  $$\frac{2x}{\sqrt{x^2+7}}$$  $$\frac{5}{2+\sqrt{1+3x}}$$  I've been stuck on questions like these for a while and I can't seem to get my head around them.


Thermodynamics of early universe - proton and neutron ratio

So, I have been reading about connection of particle physics and thermodynamics of early universe. Like after big bang, and quark - gluon plasma etc..  Anyway, after 1 second after big bang, the ratio of proton and neutron was around 7; which means there were a lot of more protons, rather then neutrons.  And this is also a reason which helped later nucleosynthesis. So, my question is what are the reasons here why there was a bigger number of protons, from neutrons.  Should I watch it here from the perspective are protons and neutrons stable? Is the same like radioactive decays?


How can I rotate this list of lists with python

I have a list of list and I need to rotate it ninety degrees. I managed to get the first new row but I couldn't get any of the others so I put the for loop in to a a function and I increased the count by one every iteration but I've just had big mess printed to the terminal.  grid = [['.', '.', '.', '.', '.', '.'],         ['.', '0', '0', '.', '.', '.'],         ['0', '0', '0', '0', '.', '.'],         ['0', '0', '0', '0', '0', '.'],         ['.', '0', '0', '0', '0', '0'],         ['0', '0', '0', '0', '0', '.'],         ['0', '0', '0', '0', '.', '.'],         ['.', '0', '0', '.', '.', '.'],         ['.', '.', '.', '.', '.', '.']]   How I need to rotate.  ''' ..00.00.. .0000000. .0000000. ..00000.. ...000... ....0....  '''   My code  def get_row(grid, new_grid, new_row, count):     for row in grid:         new_row.append(row[count])     new_grid.append(new_row)  new_grid = [] new_row = [] count = 0  for x in range(0, 6):     count = 0     get_row(grid, new_grid, new_row, count)     count +=1  for row in new_grid:     print row


I have to import a csv table whose entries contain underscores. A simple example is the following table:  FirstCol, SecondCol Item_A, Item_B   I am trying to solve my problem with the csvsimple package with the "respect underscore=true" option. Here is a minimal working example:  \documentclass[10pt,a4paper]{article} \usepackage[utf8x]{inputenc} \usepackage{longtable} \usepackage{csvsimple} \usepackage{array,booktabs} \usepackage[T1]{fontenc}  \begin{document}  \begin{longtable}{|l|l|}    \hline    \csvreader[respect underscore=true, head to column names,      late after line=\\\hline]{Test.csv}{}{\FirstCol & \SecondCol} \end{longtable}  \end{document}   This code produces the following result:    How do I get rid of the obviously wrong column separators just below the table? To be clear, what I would like is this:    Note that the two separators only appear if the "respect underscore=true" option is present. If I remove this option (and delete the underscores from the input file), then all works as expected.


How to recover the lost data in ubuntu 14.04.

I am not able to recover my files as I have accidentally deleted the files. Is there any application which will help me to recover the files.


Why does a helium filled balloon move forward in a car when the car is accelerating?

I noticed that when I had a helium filled, latex balloon inside of my car, it moved forward in the cabin as I accelerated forward. The faster I accelerated forward, the faster the balloon went from the back of the car to the front of the car. The balloon didn't have a string.  This became a game with my 4 year old as we drove home. We figured out where the balloon would go based on how fast I accelerated, turned corners etc.  I expected that it would act a lot like the water in a cup does, but it was the total opposite it seemed.  What forces caused this behavior?  I assumed it has something to do with the fluid dynamics in the closed cabin, but I can't figure it out.


If $\lim_{x\to\infty}\left(f(x)+\int_{0}^xf(t)dt\right)$ exists, what about $\lim_{x\to\infty}f(x)$?

Given that $f(x)$ is continuous on $[0,\infty]$.  If $\lim\limits_{x\to\infty}\left(f(x)+\int_{0}^xf(t)dt\right)$ exists   then evaluate $\lim\limits_{x\to\infty}f(x)$


Complex integration $\int_{-\infty}^{\infty}\frac{e^{cx}}{1+e^x}\,dx$ for $c \in (0,1)$

I have to calculate real integral $\displaystyle \int_{-\infty}^\infty \frac{e^{cx}}{1+e^x} \, \text{d}x$ for $c \in (0,1)$. I have also hint, to integrate over the squere, which consists of $x$ axis, 2 lines paralel to $y$ axis, and line with $z=x+2\pi i$, for real $x$. I think that idea is to use Residue theorem. I think, that for the function $\frac{e^{cz}}{1+e^z}$, all singularities are $z=\pi i+2k\pi i$, so the only one within the area is $2 \pi i$. But I am not sure how to calculate residue in this point, neither how to evaluate other $3$ integrals on rectangle. I have concluded, that both integrals on the vertical line cancel each other, becouse: $$ \lim_{A \to \infty} \int_0^{2\pi} \frac{e^{cA}e^{ix}}{1+e^Ae^{ix}} \, \text{d}x=0 $$ and $$ \lim_{A \to \infty} \int_{2\pi}^0 \frac{e^{-cA}e^{ix}}{1+e^{-A} e^{ix}} \, \text{d}x=0 $$ How to determine integral on the other horizontal line?


how can I export a vector shadow in illustrator to place into photoshop as a smart object?

I know you can export the asset as a PSD and open it in Photoshop. Is there a more seamless way?  Update:  I'm an idiot.  Someone else created the logo, and the shadow was it's own layer on multiply and not a normal drop shadow effect.


Show that $\lim \limits_{|P|\rightarrow 0} \sum \limits^n_{i=1}f(\zeta_i)g(\eta_i)(t_i-t_{i-1})=\int^{b}_{a}f(x)g(x)dx$

Problem  Let $f,g: [a,b] \rightarrow \mathbb{R}$ integrable functions and $P$ a partition $t_0=a<...<t_i<...<t_n=b$  Even if we choose $\zeta_i,\eta_i \in [t_{i-1},t_i]$ with $\zeta_i \neq\eta_i$, prove that $$\lim \limits_{|P|\rightarrow 0} \sum \limits^n_{i=1}f(\zeta_i)g(\eta_i)(t_i-t_{i-1})=\int^{b}_{a}f(x)g(x)dx$$  Question  I know that the point we choose in $[t_{i-1},t_i]$ doen't change the value of $\int h(x)dx$ $\space$ for some $h$. But in this case we have two different functions evalueted in differents points.  In this case I think the way to solve this is argummenting that we could use a refinament $P'$ of $P$ such that $\zeta_i,\eta_i\in P'$ then we can choose arbitrary but equal points in these new intervals to calculate the integral with no problems.


The computation of Fourier series coefficients.

Here is the function: $|\cos x|$ and I need to write the representation of the function as a Fourier series on the interval: $[-\pi, \pi]$  $$ a_0 = -\frac{1}{\pi}\int^{-\frac{\pi}{2}}_{-\pi}\cos x dx -\frac{1}{\pi}\int^{\frac{\pi}{2}}_{-\frac{\pi}{2}} \cos x dx +\frac{1}{\pi} \int^{\pi}_{\frac{\pi}{2}} \cos x dx =  \frac{1}{\pi} + \frac{1}{\pi}=\frac{2}{\pi} \tag{1}\\[6pt]$$  $$ -\frac{1}{\pi}\int^{-\frac{\pi}{2}}_{-\pi}\cos\left(x(2n-1)\right)+\cos (x(2n+1)) dx = \left[x(2n+1) = u; du = 2n+1 \ \ dx = \frac{1}{2n+1}  \right] = \left[ \left. \frac{1}{\pi (2n+1)}\sin(x(2n+1)) + \frac{1}{\pi(2n-1)}\sin(x(2n-1))\right] \right|^{-\frac{\pi}{2}}_{-\pi} = -\frac{1}{\pi(2n+1)}\sin(2n+1) - \frac{1}{\pi(2n-1)}\sin(2n-1)$$  It already looks incorrect, but I don't know where my mistake is. Can someone help?


C++ - Compilation error when using templates

I would like to be able to build a class using a generic type (template in c ++), I checked the documentation and some threads, and I do not have the impression to have made mistakes, yet I have an error when I try to compile (unresolved external symbol ...). I tried to change the keyword "typename" by the keyword "class", but that does not change anything  PS: The Console application (for tests) and the NodeEditor project are two different projects, I generate a lib (NodeEditor side) and use it in the console application  EDIT (solved) :      "Generic template definitions cannot be in an independent compilation unit (.cpp file). See Storing C++ template function definitions in a .CPP file."    NodeLinker.h  #ifndef _NODELINKER_H_ #define _NODELINKER_H_  #include <type_traits>  namespace NodeEditor {     template <typename T>     class NodeLinker     {         public:             NodeLinker();             ~NodeLinker();     }; } #endif   NodeLinker.cpp  #include "stdafx.h" #include "NodeLinker.h"  #include <iostream>  using namespace NodeEditor;  template<typename T> NodeLinker<T>::NodeLinker() {     std::cout << "Node Linker Constructed" << std::endl; }  template<typename T> NodeLinker<T>::~NodeLinker() {     std::cout << "Node Linker Destructed" << std::endl; }    NodeEditorTestConsole.cpp  #include "pch.h"  #include <iostream> #include "NodeLinker.h"  using namespace NodeEditor;  int main() {     //Test 1 (not working) :     NodeLinker<int> *nodeLinker = new NodeLinker<int>();      //Test 2 (not working) :     NodeLinker<int> nodeLinker;      //Test3 (not working) :     NodeLinker <int> nodeLinker = NodeLinker<int>();      return 0; }   Thank you in advance for your help, and have a nice day!


Existence of vector space complement and axiom of choice

Let say we live in the category of vector spaces over $\mathbb{R}$ or $\mathbb{C}.$ Here are three sentences:   Axiom of choice Every vector space has a base. For every vector space $V$ and its subspace $E\subset V$ there is a subspace $F\subset V$ such that $V=E\oplus F.$    I know how to prove that (1)->(2)->(3). How about the inverese? Do (2)->(1) and (3)->(2) hold?  If this is not the case, then is there some weaker version of AC which imply (3)?


What software can I use to shape a shared Internet connection on Windows 7?

I have a laptop running Windows 7, which has two network cards, so I bridged the Ethernet and Wireless connections.  On a second laptop, which runs Windows XP, I set its default gateway to the IP of the bridged network.  The Windows 7 laptop with bridged network has access to the Internet via wireless. The Windows XP laptop can see the Internet through the bridged network.  How do I control the traffic through the Windows 7 machine? Is there a specific tool I can use to do this?  The ones I've found are specific to modems, and not to wireless connections. For wireless connections, I found a network load balancer, but I'm not sure if this is correct.


Why does my photo not show up when importing it?

I've been following this  on YouTube, but when I add the photo (around 0:40 in the video) the photo doesn't show up. Does anyone have an explanation or anyone have a better tutorial?


Where can I read about the theory behind GLMs in their most general form?

I was following along with the MIT Opencourseware "Statistics for Applications" and their analysis of GLMs only covers discussion of GLMs whose dependent variable $y$ is distributed according to a distribution in the canonical exponential family (i.e. of the form below): $$ P(y\ |\ \theta) = h(y)\exp(\theta^Ty - A(\theta)) $$ If this is the case, then one can easily determine that $\mu = \mathbb{E}[Y] = A'(\theta)$, and since $\mu$ is related to the linear predictor via the link function $g$, we have $$ X^T\beta = g(A'(\theta)),\qquad \theta = (g\circ A')^{-1}(X^T\beta) $$  However, I'm curious about the more general case where the distribution belongs to the overdispersed exponential family: $$ P(\mathbf y\ |\ \theta,\tau) = h(y,\tau)\exp\left(\frac{\mathbf b(\mathbf \theta)^T\mathbf{T}(\mathbf y) - A(\theta)}{d(\tau)}\right) $$  Using the identity $\mathbb{E}[\nabla_\theta\ell] = 0$ where $\ell$ is the log-likelihood function I was able to arrive at $$ [D_\theta \mathbf b]^T\mathbb{E}[\mathbf T(\mathbf y)] = \nabla_\theta A $$ but there are two problems with this. For one, the dimension of $\mathbf b$ might not equal the dimension of $\theta$, and even if it did this would not guarantee the matrix $D_\theta\mathbf b$ (the Jacobian of $\mathbf b$) is invertible. Second, even if it were invertible, we would only arrive at $$ \mathbb{E}[\mathbf T(\mathbf y)] = ([D_\theta \mathbf b]^T)^{-1}\nabla_\theta A $$ which doesn't give us any direct correspondence between the parameter $\theta$ and the linear predictor $\mathbf X^T\beta$, since the link function links $\mathbb{E}[\mathbf y]$ to $\mathbf X^T\beta$, not $\mathbb{E}[\mathbf T(\mathbf y)]$.  So, how are GLMs of this form implemented? Where can I go to read more about how this works?


Differential Equations: solve the system

Solve the following system:   $$dx/dt=-.2(y-2)$$ $$dy/dt=.8(x-2)$$  This is what I have so far, but I got stuck.. $$\begin{eqnarray} dx/dt&=&-.2y-.4\\ x'&=&-.2y-.4\\ x'+.4&=&-.2y\\ y&=&-x/2'-2\\ y&=&-x''/2-2\\ \\ dy/dt&=&.8(x-2)\\ dy/dt&=&.8x-1.6\\ y'&=&.8x-1.6\\ -x''-2&=&.8x-1.6\\ -x''&=&.8x+.4\\ x''+16x+.8&=&0 \end{eqnarray}$$  when I used the quadratic formula I got stuck. Is this correct so far? Can someone finish it off for me?


I've noticed that there is hidden off-topic reasons that I can't use, when flagging or closing a question. I'd like to show you this image set to demonstrate my question(in the review queue):     I see 2 reasons in the explanations area(too small amount of information & minimal understanding):  Then I click Close, I see this dialog:  Note that there is 4 closing votes for off-topic. I continue to off-topic because...:    I see 2 votes for only too small amount of information. Sometimes there is comment(and votes) for reason Other, but in this case there is no Other votes.  What happended for rest of the votes? Where can I close post with reason minimal understanding? Is there any other hidden off-topic reasons?


I can not find the LaTeX command for the following symbol:  Anyone can help? It is an "X" with an horizontal line. And I need also the command for:


Is there an easy way to create tree nodes from data in a file? I need the tree to have nodes in the format 1,2,3,4 rather than 1,2,4,8 etc. I can't create the nodes in a loop as there would be two child nodes for each node.  I'm picking up the data in each cell and declaring a variable for each entry. Is there an easier way to create the following tree? Each row in the file is a node, and I will eventually be filling each node with columns from each row.  \documentclass{standalone} \usepackage{catchfile,tikz} \usepackage{pgfplotstable} \usepackage{filecontents}   \begin{filecontents*}{\jobname.dat} a&1&2&3\\ b&1&2&3\\ c&1&2&3\\ d&1&2&3\\ e&1&2&3\\ f&1&2&3\\ \end{filecontents*}  \begin{document}  \pgfplotstableread[col sep=&,header=false]{\jobname.dat}{\firsttable}     \pgfplotstablegetelem{0}{[index]0}\of{\firsttable} \let\RowZeroColZero\pgfplotsretval \pgfplotstablegetelem{1}{[index]0}\of{\firsttable} \let\RowOneColZero\pgfplotsretval \pgfplotstablegetelem{2}{[index]0}\of{\firsttable} \let\RowTwoColZero\pgfplotsretval \pgfplotstablegetelem{3}{[index]0}\of{\firsttable} \let\RowThreeColZero\pgfplotsretval \pgfplotstablegetelem{4}{[index]0}\of{\firsttable} \let\RowFourColZero\pgfplotsretval \pgfplotstablegetelem{5}{[index]0}\of{\firsttable} \let\RowFiveColZero\pgfplotsretval  \begin{tikzpicture} [grow=right, sloped,dot/.style={circle,fill,inner sep=0.5pt}] \coordinate  node{\RowZeroColZero}     child {     node {\RowTwoColZero}             child {node {\RowFiveColZero}}             child {node[text opacity = 0] {\RowFiveColZero}}     }     child {     node {\RowOneColZero}             child {node {\RowFourColZero}}             child {node {\RowThreeColZero}}     } ;  \end{tikzpicture} \end{document}     At each node, if I could even extract the node coordinate and locate a row in the file with the node reference, that would be a great help in reducing the amount of code.


How to watch a file, who accesses or uses

I am looking forward a way to watch a file to get following information   Which process does open, read, write it? When? Result. (e.g. can they write on it, or can they read it, etc.)   Strace helps us to watch which files a process opens, but how can I watch a file when multiple processes access it? What is your recommendation?


How do you prove that σ(1) + σ(2) + · · · + σ(n) ≤ n^2 for each positive integer n?

If I fix positive integers n and k with 1 ≤ k ≤ n, I need to figure first out for which integers i with 1≤i≤n is k a term in the sum that defines σ(i) and how many such integers i are there (phrased differently: how many times does k occur in the sum σ(1) + σ(2) + · · · + σ(n) if you write each σ(i) as a sum?)? I know the answer depends on n and k but I can't figure out how to do the proof for the original question without first figuring out this step.


Tricky convergences of harmonic series divided into digit-9-contained denominators and digit-9-not-contained denominators?

(It's hard for me to summarize the problem precisely with the title...) The harmonic series $\sum_{i=1}^{\infty}\frac{1}{n}$ is not convergent as we all know. Now I partition the series into 2 series, one consisted of denominators containing digit 9 in decimal form and the other consisted of the rest entries, as follows: $$ \sum{b_n}=\frac{1}{9}+\frac{1}{19}+\frac{1}{29}+\cdots +\frac{1}{90}+\frac{1}{91}+\cdots +\frac{1}{99}+\frac{1}{109}+\frac{1}{119}+\cdots , $$ $$ \sum{c_n}=1+\frac{1}{2}+\cdots +\frac{1}{8}+\frac{1}{10}+\cdots +\frac{1}{88}+\frac{1}{100}+\cdots  $$ I need to prove that $\sum b_n$ is not convergent while $\sum c_n$ is. I've merely got an intuitive idea: As the number of digits of denominator increases, the digit-9-contained denominators appear more frequently and the digit-9-not-contained denominators appear less frequently. To show this, one only need to consider the probability of a digit-9-not-contained denominator of n-digit, approximately $(\frac{9}{10})^n$, which goes to $0$ when $n$ goes to infinity. However, this is only a rough and intuitive idea and I don't know how to prove it in a quantitative and rigid manner. Any help would be aprreciated!


Using webform rules to create node after webform submission

First of all, let me explain my project. I want users to place orders of products using webforms and then create a node with a link/reference to the submission and others custom fields.  It looks like this :  CONTENT TYPE PRODUCT : - Field name / Field image / Field category / Field description  Webform is enabled for PRODUCT content type. So I've created products examples and each of these products have their own CUSTOM webform (all the forms are differents)  For example :  PRODUCT A (product content type) - fields values + custom webform fields  So what I want this kind of node beeing created after webform submission :  CONTENT TYPE ORDER NODE : - webform sid reference (linking to the submission results) - Some fields which will be the same for every product  Do you think is possible with a custom module or should I find another way to achieve this ? (I suppose replacing webform by a content type, but the problem is webform, in my case, is very usefull)  I have to point out that I'm a beginner in Drupal module's developpment.  Thank you ;-)


What is the correct way to initialize an object as a static member of a C++ class

I have a date class like below which I use to find the resultant date after adding/subtracting a few days. The constructor validates the input date and throws an exception if invalid.  class date {     private:         int day;         int month;         int year;          bool isValid(date& d);      public:         date(); //default to starting of say Gregorian calendar         date(string strDate); // takes DD/MM/YYYY format string to initialize day, month and year          //static date today;          int operator- (date& d); //difference of two dates in no. of days         int operator- (int days); //get the date a few days before this date         void operator+ (int days); //get the date a few days after this date };   In addition to the above I also want to keep track of today's date as part of the class itself which other parts of the program can use for calculation purposes.  Is it possible to have a static member as written in the commented line above and have the class itself initialize the object?  If yes how do we initialize the object?  If no then what is the correct way of dealing with the "today" object?  I read other posts but all posts seem to deal with static members of basic types. However here multiple statements has to executed in order to get system date and hence I am thinking it is different from the other posts.


Client-server synchronization pattern / algorithm?

I have a feeling that there must be client-server synchronization patterns out there. But i totally failed to google up one.  Situation is quite simple - server is the central node, that multiple clients connect to and manipulate same data. Data can be split in atoms, in case of conflict, whatever is on server, has priority (to avoid getting user into conflict solving). Partial synchronization is preferred due to potentially large amounts of data.  Are there any patterns / good practices for such situation, or if you don't know of any - what would be your approach?  Below is how i now think to solve it: Parallel to data, a modification journal will be held, having all transactions timestamped.  When client connects, it receives all changes since last check, in consolidated form (server goes through lists and removes additions that are followed by deletions, merges updates for each atom, etc.). Et voila, we are up to date.  Alternative would be keeping modification date for each record, and instead of performing data deletes, just mark them as deleted.  Any thoughts?


I have several IP addresses that I want to list it based on internal or external IP: our internal IP for example start with 10.10.10.X, I was thinking about writing bash script to do this job for me, I tried to use the script below to read all IPs from text file.  while IFS='' read -r line || [[ -n "$line" ]]; do IP=$(echo "$line" | cut -c1-8) if [[ "$IP" == '10.10.10' ]]; then echo " $line" >> /tmp/internal.txt else echo " $line" >> /tmp/external.txt fi done < "$1"   but I faced the following problem (when debugging the code) when variable IP compared with 10.10.10 it will be shown as   [[ X.X.X. == \1\0\.\1\0\.\1\0 ]]   and the result always will be external, please advise what I did wrong.  Edit with example:  Let us say /tmp/ip.txt I have the following IPs.  10.10.10.1 192.168.5.1 20.30.5.1   After checking the IPs both 192.168.5.1 and 20.30.5.1 should go to /tmp/deny.txt and 10.10.10.1 should go to /tmp/allow.txt


Based off the question ""  How does Captain Jack Harkness become the Face of Boe?


Finding default user.home when it has been overridden in Java VM options

Let's say that I develop a plugin for a software that makes a call to -Duser.home in the JVM options.  How can I figure out the default user.home property of the system? For instance, on Windows, I'd like to know the "C:/Users/USERNAME" location, rather than what is overridden by the software.  Is it possible?  EDIT: I already tried everything suggested in the supposed duplicate/original question.  String homeDir=System.getProperty("user.home");   is not a solution, since this value is changed by the software hosting my plugin: in fact there is a call to   -Duser.home="Software-forced user.home"   that I would like to bypass to get the real thing that looks like a user home...


I want to convert a string like this:  '10/15/2008 10:06:32 PM'   into the equivalent DATETIME value in Sql Server.  In Oracle, I would say this:  TO_DATE('10/15/2008 10:06:32 PM','MM/DD/YYYY HH:MI:SS AM')    implies that I must parse the string into one of the , and then convert using one of those codes.  That seems ludicrous for such a mundane operation.  Is there an easier way?


Screen tearing when scrolling on Dell XPS 13

When I scroll I get screen tearing, which ends up being a line that runs almost perfectly horizontally from the top-left to bottom-right corners of my screen that distorts whatever flows through it.  Has anyone encountered this before?


How test an method exception when the file exists and cannot be deleted?

I would like to test the exception trowed by this piece of code:  private void delete(final File file, final String fileName) {     boolean deleted = file.delete();     if (deleted) {         log.info("File {} was deleted", fileName);     } else {         throw new RuntimeException("The file exists but could not be deleted");     } }   My first idea was create a temporary file that can't be deleted in my unit test. For sure, I would like to control this behavior to delete this file after the test. But I supposed that this is not possible, it's contradictory. Set the file to "read only" not works for this case.   So, any ideas?   I could create a new class and pass the responsibility to delete the file and return the boolean, so I could mock it and test my exception. But I would like to explore another possibilities using Junit and Java before do this.


I see many articles and posts about javascript objects and primitives passed by refference vs passed by value. Though I don't see topic covering functions. Are they passed by value or refference. Therefore I made test myself to check it out.   Cosnider this example:    function sayHello() {  console.log("Hello") }  function changeSayHello(func) {  func = function() {   console.log("Good Bye");  }  func(); }   sayHello(); // >>  Hello  changeSayHello(sayHello); // >> Good Bye sayHello(); // >>  Hello      You can see the result by running the snippet. From this example I conclude that functions in JavaScript are passed by value. What is your comment.  * EDIT * May be this better explains what I ment. And it shows that function is passed by refference?     var Obj  = function() {  this.a = 5; }  var change = function(func) {  func.prototype.b = 8; }  var first = new Obj();  console.log(first.b); //undefined  change(Obj);  console.log(first.b);// 8     I don't see why this is marked as duplicate. I saw the proposed answer and there is no example about functions being passed as an argument.


We were given yesterday couple of pigeonhole principle questions, i did solve most of them but these 3 i could not, i don't know even where to start.  1) 20 people are sitting around round table, on it there is a big pizza (20 slices) 10 of them with olives and 10 without, some of people like the pizza with olives while other don't, show that one can rotate the pizza such that at least half of the people(at least 10) are happy ?  2) Given a graph with 6 vertices prove that there is at least 3 vertices that have no edge between every two of them or that they all are connected ?  3) Given $x \in \mathbb{R}$ and $x \not \in \mathbb{Q}$ prove that for all $\epsilon >0$ there is $n>0$ such that $\{ n x \} < \epsilon$ ?  any help is appreciated, even if you know how solve one question, please leave a comment showing me how to prove it, or posting an answer,  Thank you.


Complex analysis prove uniform convergence question

$$ \sum_{n = 1}^\infty \frac{z}{n(1 + n|z|^2)}. $$  I need to prove this series converges uniformly on $\mathbb{C}$, so I try to prove this by M-test.    I am not sure is this correct, since I am not familiar with complex analysis uniform convergence.


Latex, can't compile .bib file -- "Emergency stop"

I can't compile even a very short .bib file:  @article{Adams1994,    author = {Adams, R. and Bischof, L.},    title = {Seeded Region Growing},    journal = {Ieee Transactions on Pattern Analysis and Machine Intelligence},    volume = {16},    number = {6},    pages = {641-647},    note = {Nr972 Times Cited:827 Cited References Count:16},    abstract = {We present here a new algorithm for segmentation of intensity images which is robust, rapid, and free of tuning parameters. The method, however, requires the input of a number of seeds, either individual pixels or regions, which will control the formation of regions into which the image will be segmented.  In this correspondence, we present the algorithm, discuss briefly its properties, and suggest two ways in which it can be employed, namely, by using manual seed selection or by automated procedures.},    keywords = {image segmentation region growing semiinteractive image processing watershed segmentation algorithm},    ISSN = {0162-8828},    DOI = {Doi 10.1109/34.295913},    url = {<Go to ISI>://WOS:A1994NR97200008},    year = {1994},    type = {Journal Article} }   Here is the relevant error log:  This is pdfTeX, Version 3.1415926-2.4-1.40.13 (MiKTeX 2.9) (preloaded format=pdftex 2014.1.9)  7 APR 2014 12:05 entering extended mode **C:/Users/XX/Desktop/Thesis_April/biblio.bib (C:/Users/XX/Desktop/Thesis_April/biblio.bib) * ! Emergency stop. <*> ...ers/XX/Desktop/Thesis_April/biblio.bib  End of file on the terminal!  !  ==> Fatal error occurred, no output PDF file produced!   No idea what the problem is :s. I'm using MikTeX for compilation.


There exists a unique function $\sqrt{*} : \mathbb{C} \rightarrow \mathbb{C}$ such that for all $r \in [0,\infty)$ and $\theta \in (-\pi,\pi]$ it holds that $$\sqrt{r\exp(i\theta)}=\sqrt{r}\exp(i\theta/2),$$  where $\sqrt{r}$ denotes the usual principal square root of a real number $r$.  Lets take this as our definition of the principal square root of a complex number. Thus $i=\sqrt{-1}.$  Now. We know that, for all positive real $w$ and $z$, it holds that $\sqrt{wz}=\sqrt{w}\sqrt{z}$. We also know that this fails for certain complex $w$ and $z$. Otherwise, we'd be allowed to argue as follows:  $$-1 = i\cdot i = \sqrt{-1} \cdot \sqrt{-1} = \sqrt{-1 \cdot -1} = \sqrt{1}=1$$  My question: for which complex $w$ and $z$ does it hold that $\sqrt{wz}=\sqrt{w}\sqrt{z}$?


This has bugged me for a while. Are there any packages/templates/methodologies for effectively creating flyers in LaTeX?  Just in case there's some ambiguity in my terminology, I'm looking to create single-page, letter-sized pamphlets/posters, posted to advertise events.  Any ideas?


Background  Imagine there's a UI that contains a list of "talks". Each talk has fields such as "title", "speaker", and "description". Users can edit talks but have to explicitly save their changes (there is no autosave).  Scenario  In the following scenarios, a user edits a talk, then switches to editing another talk without saving the first talk. This triggers a prompt.  Scenario 1:  A user is editing a talk and clicks on another talk without saving their changes first.  Scenario 2:  A user is editing a talk and accidentally clicks on another talk before they got a chance to save their changes.  Prompts  I'm looking for the most user friendly prompt.  Option A  +-------------------------------+ | Save changes to current talk? | |                               | | [Cancel]      [No]      [Yes] | +-------------------------------+   Option B  +------------------------------------------------+ | The talk you were editing has unsaved changes. | |                                                | | [Save changes]               [Discard changes] | +------------------------------------------------+   Option C  +--------------------+ | Discard changes?   | |                    | | [Discard] [Cancel] | +--------------------+   Option D: Have a suggestion?


Python: Different methods to initialize 2D arrays gives different outputs

I was solving a few questions involving dynamic programming. I initialized the dp table as - n = 3 dp = [[False]*n]*n print(dp)  #Output - [[False, False, False], [False, False, False], [False, False, False]]  Followed by which I set the diagonal elements to True using - for i in range(n):     dp[i][i] = True  print(dp)  #Output - [[True, True, True], [True, True, True], [True, True, True]]  However, the above sets every value in dp to True. But when I initialize dp as - dp = [[False]*n for i in range(n)]  Followed by setting diagonal elements to True, I get the correct output - [[True, False, False], [False, True, False], [False, False, True]] So how exactly does the star operator generate values of the list?


How to make name server address permanent in /etc/resolv.conf even after system reboot?

I changed nameserver in /etc/resolv.conf and after a system reboot it resets the nameserver back to what it was.  I am using linux mint 19 (Cinnamon).  # This file is managed by man:systemd-resolved(8). Do not edit. # # This is a dynamic resolv.conf file for connecting local clients to the # internal DNS stub resolver of systemd-resolved. This file lists all # configured search domains. # # Run "systemd-resolve --status" to see details about the uplink DNS servers # currently in use. # # Third party programs must not access this file directly, but only through the # symlink at /etc/resolv.conf. To manage man:resolv.conf(5) in a different way, # replace this symlink by a static file or a different symlink. # # See man:systemd-resolved.service(8) for details about the supported modes of # operation for /etc/resolv.conf.  nameserver 8.8.8.8 nameserver 8.8.4.4   This is my file before i reboot my system and after reboot the nameserver changes.


I want one minipage with text, to be next to another minipage with two tikzpictures.  I have this code:  \subsection*{7. Bereken exact de lengte van lijnstuk $TP$.} \begin{minipage}[l]{0.6\textwidth} $BD = \sqrt{1^2+1^2}= \sqrt{2}$ \\ \\ In $\triangle BDT$ is $TD=\sqrt{2}$ en $BD = \sqrt{2}$. \\ Dus $BT=\sqrt{(\sqrt{2})^2+(\sqrt{2})^2}=\sqrt{2+2}=2$. \\ \\ In $\triangle ADT$ is $AT=\sqrt{1^2+(\sqrt{2})^2}=\sqrt{3}$. \\ \\ \\ \\ \\ \\ \\ \\  De oppervlakte van $\triangle ABT$ hiernaast is $\dfrac{1}{2} \cdot 1 \cdot \sqrt{3}=\dfrac{1}{2}\sqrt{3}$ \\ De oppervlakte kun je ook berekenen door: \\ $\dfrac{1}{2} \cdot BT \cdot AP = \dfrac{1}{2}\sqrt{3}$ \\ \\ $\dfrac{1}{2} \cdot 2 \cdot AP = \dfrac{1}{2}\sqrt{3}$ \\ \\ $AP = \dfrac{1}{2}\sqrt{3}$ \\ \\ In $\triangle APT$ is $TP=\sqrt{(\sqrt{3})^2-(\frac{1}{2}\sqrt{3})^2}=1\frac{1}{2}$. \end{minipage}  \begin{minipage}[r t]{0.4\textwidth} \begin{tikzpicture}[scale=0.75] \coordinate [label=above left:A] (A) at (0,0,4); \coordinate [label=below right:B] (B) at (4,0,4); \coordinate [label=above right:C] (C) at (4,0,0); \coordinate [label=above left:D] (D) at (0,0,0); \coordinate [label=above:T] (T) at (0,5,0); \coordinate [label=above right:P] (P) at (3,2,3.5);  \draw[color=gray, style=dashed] (0,0) -- (4,0,0); \draw[color=gray, style=dashed] (0,0) -- (0,5,0); \draw[color=gray, style=dashed] (0,0) -- (0,0,4); \draw (0,5,0) -- (0,0,4) -- (4,0,4) -- (0,5,0) -- (4,0,0) -- (4,0,4); \draw (0,0,4) -- (3,2,3.5) -- (4,0,0); \end{tikzpicture} \begin{tikzpicture}[scale=0.75] \coordinate [label=below left:A] (A) at (0,0); \coordinate [label=left:$\sqrt{3}$] (X) at (0,2.5); \coordinate [label=below:$1$] (X) at (1.5,0); \coordinate [label=below right:B] (B) at (3,0); \coordinate [label=below left:T] (T) at (0,5); \coordinate [label=above left:$2$] (X) at (2.75,2.5); \coordinate [label=above right:P] (P) at (2.16,1.43);  \draw (0,0) -- (0,5) -- (3,0) -- (0,0); \draw (0,0) -- (2.16,1.43); \draw (2.22,1.3) -- (2.13,1.24) -- (2.06,1.35); \end{tikzpicture} \end{minipage}   They somehow appear underneath each other.


I can't see sort options in stackexchange sites when not logged in

I was going through different stackexchange sites. It is found that sort options are missing when the user is not logged in. I could only see the sort option 'newest' in all of them. Tried this in chrome and firefox. Even in incognito modes, the links are invisible. There was no luck with the hard refresh on all these browsers.  Also I checked in my virtual box IE(where I have not taken any of the stackoverflow site yet) to check whether it is an issue with my cache or cookies, but the issue is replicated. By editing URL, I could sort the questions, but except 'newest' other links are not there (when not logged in).  Does anyone experience this 'lack of sort options'? Can someone please explain the reason for this unusual behavior?       Here is the latest example from meta.stackexchange.com after logged out.


How do you kill a player standing on a specific block?

I'm making a Parkour Map and I need to know how to execute /execute @a ~ ~ ~ detect ~ ~-1 ~ minecraft:grass 0 /kill @p[c=1] in 1.13. It doesn't work for me, because this code was used in version 1.9 or thereabouts.  I'm  playing on PC.  How do you do execute this command in 1.13?


Should I include funny pictures in my slides?

I am preparing slides for a short (10min) talk at the group meeting. The talk is about a fairly serious piece of (pure) mathematics, and it so happens that there is a very relevant one-panel webcomic. A thought appeared to me, and got some support from my fellow PhD students, that it would be cool to include this comic, perhaps at the final thank-you-for-your-attention slide.  I am probably not going to do it, so I'm asking mostly out of curiousity: Would this be a bad idea to go ahead and include a comic on the final slide?   Note: The comic is genuinely funny (based on a sample of 6 non-randomly selected students). It is not - as far as I can tell - offensive in any way. It could come across as somewhat silly.


Makefile and Compilation of Templated C++ Classes

I'm creating a templated "Heap" class, and I have the following structure of a directory:   --HeapFolder |- Heap.cpp |- Heap.h |- Heap_Testbench.cpp   Here, the Heap.h file is the outline of the templated class and Heap.cpp implements it.   What I want to do is to be able to write tests and compile it using a Makefile. What I found is that in the Heap_Testbench.cpp file, I needed to include both the .cpp and the .h files in order to avoid linker errors.   Even though I have the following Makefile:   heap_test: Heap.o Heap_TestBench.o     g++ -o $@ $^ -std=c++11 -lboost_unit_test_framework  Heap.o: Heap.cpp Heap.h     g++ -std=c++11 -o $@ $< -c  Heap_TestBench.o: Heap_TestBench.cpp     g++ -std=c++11 -DBOOST_TEST_DYN_LINK -o $@ $< -c  clean:     rm *.o   I noticed that the implementation wasn't being linked to the "heap_test" binary (which lead to linker errors when I tried to call any function in the Heap class). Why is this the case? More specifically, why would one need to include the ".cpp" file in the "Heap_Testbench.cpp" if I'm already linking it with "Heap.o"?


R - multiple linear regression plot analyzing

I'm having troubles analyzing the plots resulting from multiple linear regression. Can someone explain briefly what do these plot mean and what are the assumptions of the multplie linear regression? Thank you so much.


Auto revision summary has wrong plural: "added 1 characters in body"

As seen at:           Update: I'm 101% sure the down votes were due to the lack of free hands.    Update 2: likes me, like me not, like me, likes me not... yeah !


Construct an affine transformation of a plane given the images of three points

Consider a plane $\mathbb{R}^2$ and an affine transformation $T: \mathbb{R}^2\to \mathbb{R}^2$ that maps points $A,B,C$ to points $A',B',C'$ correspondingly. We know that $A,B,C$ are not on the same straight line and so $T$ is determined uniquely. Given an arbitrary point $M$ how to find $T(M)$?  Basically, I'm trying to write a program that takes as input 14 numbers—the coordinates of the points $A,B,C, A',B',C',M$ and outputs two numbers—the coordinates of $M'=T(M)$, provided $A,B,C$ are not on the same straight line. How should I proceed?


Setting up wireless on Ubuntu Server 17.04

I've looked everywhere but can't find how to activate wireless networking. WLAN0 appears not to be working or activated.   Thanks  PS:Too Short?  Edit: Already tried that answer. Has not worked. The output of ifconfig is:  enp5s0: flags=4163<UP,BROADCAST,RUNNING,MULTICAST>  mtu 1500     inet 10.0.0.16  netmask 255.255.255.0  broadcast 10.0.0.255     inet6 fe80::223:5aff:fed9:7a72  prefixlen 64  scopeid 0x20<link>     ether 00:23:5a:d9:7a:72  txqueuelen 1000  (Ethernet)     RX packets 118  bytes 9321 (9.3 KB)     RX errors 0  dropped 0  overruns 0  frame 0     TX packets 78  bytes 8089 (8.0 KB)     TX errors 0  dropped 0 overruns 0  carrier 3  collisions 0  lo: flags=73<UP,LOOPBACK,RUNNING>  mtu 65536     inet 127.0.0.1  netmask 255.0.0.0     inet6 ::1  prefixlen 128  scopeid 0x10<host>     loop  txqueuelen 1000  (Local Loopback)     RX packets 713  bytes 56816 (56.8 KB)     RX errors 0  dropped 0  overruns 0  frame 0     TX packets 713  bytes 56816 (56.8 KB)     TX errors 0  dropped 0 overruns 0  carrier 0  collisions 0  wlan0: flags=4099<UP,BROADCAST,MULTICAST>  mtu 1500     inet 192.168.1.150  netmask 255.255.255.0  broadcast 192.168.1.255     ether 00:24:2c:67:8a:a0  txqueuelen 1000  (Ethernet)     RX packets 0  bytes 0 (0.0 B)     RX errors 0  dropped 0  overruns 0  frame 0     TX packets 0  bytes 0 (0.0 B)     TX errors 0  dropped 0 overruns 0  carrier 0  collisions 0   EDIT 2 I'm kinda an ubuntu noob. Thanks 4 ur patience. :) Output of sudo lshw -C network is  *-network    description: Wireless interface    product: BCM4312 802.11b/g LP-PHY    vendor: Broadcom Limited    physical id: 0    bus info: pci@0000:02:00.0    logical name: wlan0    version: 01    serial: 00:24:2c:67:8a:a0    width: 64 bits    clock: 33MHz    capabilities: pm msi pciexpress bus_master cap_list ethernet physical wireless    configuration: broadcast=yes driver=b43 driverversion=4.10.0-19-generic firmware=666.2 latency=0 link=no multicast=yes wireless=IEEE 802.11    resources: irq:18 memory:f0300000-f0303fff  *-network    description: Ethernet interface    product: AR8132 Fast Ethernet    vendor: Qualcomm Atheros    physical id: 0    bus info: pci@0000:05:00.0    logical name: enp5s0    version: c0    serial: 00:23:5a:d9:7a:72    capacity: 100Mbit/s    width: 64 bits    clock: 33MHz    capabilities: pm msi pciexpress vpd bus_master cap_list ethernet physical tp 10bt 10bt-fd 100bt 100bt-fd autonegotiation    configuration: autonegotiation=on broadcast=yes driver=atl1c driverversion=1.0.1.1-NAPI ip=10.0.0.16 latency=0 link=no multicast=yes port=twisted pair    resources: irq:27 memory:f0200000-f023ffff ioport:a000(size=128)   And iwconfig is  wlan0     IEEE 802.11  ESSID:off/any         Mode:Managed  Access Point: Not-Associated   Tx-Power=20 dBm          Retry short limit:7   RTS thr:off   Fragment thr:off       Power Management:off   Edit 3: A start job is running for raise network interfaces (-----/5m 34s)or something like that. Mean anything to you?


On slow connections (or if the server is randomly slow for some reason) it makes sense to have loading indicators. But when the connection is good, the req is too fast and the loading looks horrible. What is the usual way of handling this? Here are my 2 cases:  Loading on slow/md netowrk:   Loading on fast network:


Prove $$\int_{0}^{1}\frac{1}{\sqrt{1-x^2}}\arctan\left(\frac{88\sqrt{21}}{36x^2+215}\right)dx=\frac{\pi^2}{6}.\tag1$$   My attempts are as follows.   We define for $a,b>0$ $$f(a,b)=\int_0^1\frac{\arctan(ax^2+b)}{\sqrt{1-x^2}}dx,\tag2$$ so that  $$\int_0^1\frac{1}{\sqrt{1-x^2}}\arctan\left(\frac1{ax^2+b}\right)dx=\frac{\pi^2}{4}-f(a,b).$$  The only sensible thing I could think to do was substitute $t=ax^2+b$ so that $f(a,b)=r(b,a+b)$, where $$r(p,q)=\int_{p}^{q}\frac{\arctan x}{\sqrt{(x-p)(q-x)}}dx,$$ which seems only slightly more manageable. I decided to give this approach up and return to $f(a,b)$. We see that $$\frac1{\sqrt{1-x^2}}=\frac12\sqrt{\frac{1-x}{1+x}}+\frac12\sqrt{\frac{1+x}{1-x}},\tag3$$ so that $$f(a,b)=\frac12\int_{-1}^{1}\sqrt{\frac{1-x}{1+x}}\arctan(ax^2+b)dx,\tag4$$ as we can split up $(2)$ into two integrals using $(3)$, preform the change of variable $x\mapsto-x$ in the second, then add the two integrals back together. As it stands, $(4)$ may be the easiest form of the integral to work with, but I am not sure. Another idea is to set $t=\sqrt{\frac{1-x}{1+x}}$ in $(4)$ so that  $$f(a,b)=2\int_0^\infty \frac{x^2}{(1+x^2)^2}\arctan(ax+b)dx.\tag5$$ From $ax+b\mapsto x$ followed by integration by parts with $u=\arctan x$, we have $$f(a,b)=\frac{\pi^2}{4a^2}-\frac2a\int_b^\infty \left[\frac1a\arctan\left(\frac{x-b}{a}\right)-\frac{x-b}{(x-b)^2+a^2}\right]\frac{dx}{1+x^2}.\tag6$$ The first integral  $$J_1(a,b)=\int_b^\infty \frac{\arctan\left(\frac{x-b}{a}\right)}{x^2+1}dx$$ does not seem very easy at all and I do not know how to go about evaluating it. However, the second integral $$J_2(a,b)=\int_b^\infty \frac{x-b}{(x-b)^2+a^2}\frac{dx}{1+x^2}$$ can be evaluated explicitly as $$J_2(a,b)=M\pi b(a^2+b^2+2a+1)-M\left[(a^2-b^2-1)\ln\frac{a^2}{b^2+1}+2b(a^2+b^2+1)\arctan b\right],$$ where $$M=-\frac{1}{2(a^2+(b-i)^2)(a^2+(b+i)^2)}.$$ I feel, however, that there is an easy way to evaluate the integral $f(a,b)$, but as of now it is beyond me. Any help is appreciated.


I'm wondering if there is a tool or simple method that will allow me to turn a simple pencil/pen sketch into something like the two images below.  I received these in a newsletter from a Kickstarter project and wondering how someone would go about making them.


How should I start playing and running Role-playing games

I want to start playing Role-playing games, so how should I start playing and running Role-playing games?  Thanks In Advance!


My plan is to rank up levels one by one starting at the button and working my way up. But now I'm at rank 24 on the 1st level and there's no sign of stopping anytime soon so I'm starting to wonder if the ranks are infinite and I should change my strategy


Does anyone know the general strategy for summing a series of the form:  $$\sum_{n=1}^{\infty} \frac{1}{n^2 + a^2},$$  where $a$ is a positive integer?  Any hints or ideas would be great!


Other Stack Exchange accounts are not shown in my profile

It seems that my profile no longer shows other accounts that I have in Stack Exchange:   You have no other accounts on the    I haven't checked all my accounts, but it's happening at least in Stack Overflow, Meta and Board and Card Games. This morning, I could see my other accounts just fine. It's a bit of a bother because I use those links to change between my accounts.


Does assigning objects to null in Java impact garbage collection?

Does assigning an unused object reference to null in Java improve the garbage collection process in any measurable way?  My experience with Java (and C#) has taught me that is often counter intuitive to try and outsmart the virtual machine or JIT compiler, but I've seen co-workers use this method and I am curious if this is a good practice to pick up or one of those voodoo programming superstitions?


Obtain filepath of directories containing a particular filetype in alphabetical/numerical order

I have a directory that contains 800 subdirectories named disp-001 ... disp-800. All these sub-directories need to contain a specific file say stdout. One among them does not contain the file and I need to find the folder that does not have the file. If I try  find . -name "stdout"   it returns me the values of all files, but they are not ordered from 001 to 800, which makes it very difficult for me to identify the folder. Is there a way to order the output such that they are ordered numerically?  NOTE:  I'm leaving this question unedited to demonstrate  (atleast to myself) a classic . All I needed was to identify directories not containing a particular file, but instead this question was about a particular attempted solution to the problem. The solution for finding a directory that does not contain a particular file is provided .


How does ACF & PACF identify the order of MA and AR terms?

It's been more than 2 years that I am working on different time series. I have read on many articles that ACF is used to identify order of MA term, and PACF for AR. There is a thumb rule that for MA, the lag where ACF shuts off suddenly is the order of MA and similarly for PACF and AR.   Here is  I followed from PennState Eberly College of Science.   My Question is why is it so? For me even ACF can give AR term. I need explanation of thumb rule mentioned above. I am not able to understand thumb rule intuitively/mathematically that why -  Identification of an AR model is often best done with the PACF. Identification of an MA model is often best done with the ACF rather than the PACF  Please note:- I don't need how but "WHY". :)


why Win7 User folder can be accessed by another user and also in the network?

I just found at home I (an administrator user) can access other users folders under the C:\Users, even one of the folders belongs to another administrator account. I thought the folders under Users belong to specific user should be private. But they are not. Is this right? I am using Windows 7 enterprise and professional edition. Yes, there is a popup window to tell you you don't have permission but it will give you permission if you want.   I also found the Users folder by default is visible and accessible via Network. I don't think this is right.  All above are happened at home and I just setup a home network with an old netgear router.  All machines are my machines bought used with win7 professional and enterprise OSs.


find out which file descriptors share the same "open file description"

If I do (in a Bourne-like shell):  exec 3> file 4>&3 5> file 6>> file   File descriptors 3 and 4, since 4 was dup()ed from 3, share the same open file description (same properties, same offset within the file...). While file descriptors 5 and 6 of that process are on a different open file description (for instance, they each have their own pointer in the file).  Now, in lsof output, all we see is:  zsh     21519 stephane    3w   REG  254,2        0 10505865 /home/stephane/file zsh     21519 stephane    4w   REG  254,2        0 10505865 /home/stephane/file zsh     21519 stephane    5w   REG  254,2        0 10505865 /home/stephane/file zsh     21519 stephane    6w   REG  254,2        0 10505865 /home/stephane/file   It's a bit better with lsof +fg:  zsh     21519 stephane    3w   REG          W,LG  254,2        0 10505865 /home/stephane/file zsh     21519 stephane    4w   REG          W,LG  254,2        0 10505865 /home/stephane/file zsh     21519 stephane    5w   REG          W,LG  254,2        0 10505865 /home/stephane/file zsh     21519 stephane    6w   REG       W,AP,LG  254,2        0 10505865 /home/stephane/file   (here on Linux 3.16) in that we see fd 6 has different flags, so it has to be a different open file description from the one on fd 3, 4 or 5, but from that we can't tell fd 5 is on a different open file description. With -o, we could also see the offset, but again same offset doesn't guarantee it's the same open file description.  Is there any non-intrusive1 way to find that out? Externally, or for a process' own file descriptors?    1. One heuristic approach could be to change the flags of one fd with fcntl() and see what other file descriptors have their flags updated as a result, but that's obviously not ideal nor fool proof


While building a flask website, I'm using an external JSON feed to feed the local mongoDB with content. This feed is parsed and fed while repurposing keys from the JSON to keys in Mongo.  One of the available keys from the feed is called "img_url" and contains, guess what, an url to an image.  Is there a way, in Python, to mimic a php style cURL? I'd like to grab that key, download the image, and store it somewhere locally while keeping other associated keys, and have that as an entry to my db.  Here is my script up to now:      import json     import sys     import urllib2     from datetime import datetime      import pymongo     import pytz      from utils import slugify     # from utils import logger      client = pymongo.MongoClient()     db = client.artlogic      def fetch_artworks():     # logger.debug("downloading artwork data from Artlogic")  AL_artworks = [] AL_artists = [] url = "http://feeds.artlogic.net/artworks/artlogiconline/json/"  while True:     f = urllib2.urlopen(url)     data = json.load(f)      AL_artworks += data['rows']      # logger.debug("retrieved page %s of %s of artwork data" % (data['feed_data']['page'], data['feed_data']['no_of_pages']))      # Stop we are at the last page     if data['feed_data']['page'] == data['feed_data']['no_of_pages']:         break      url = data['feed_data']['next_page_link']  # Now we have a list called ‘artworks’ in which all the descriptions are stored # We are going to put them into the mongoDB database, # Making sure that if the artwork is already encoded (an object with the same id # already is in the database) we update the existing description instead of # inserting a new one (‘upsert’).  # logger.debug("updating local mongodb database with %s entries" % len(artworks))  for artwork in AL_artworks:     # Mongo does not like keys that have a dot in their name,     # this property does not seem to be used anyway so let us     # delete it:     if 'artworks.description2' in artwork:         del artwork['artworks.description2']     # upsert int the database:     db.AL_artworks.update({"id": artwork['id']}, artwork, upsert=True)       # artwork['artist_id'] is not functioning properly     db.AL_artists.update({"artist": artwork['artist']},                       {"artist_sort": artwork['artist_sort'],                        "artist":  artwork['artist'],                        "slug": slugify(artwork['artist'])},                       upsert=True)  # db.meta.update({"subject": "artworks"}, {"updated": datetime.now(pytz.utc), "subject": "artworks"}, upsert=True) return AL_artworks      if __name__ == "__main__":         fetch_artworks()


Okay, I understand lots of questions on this subject but it seems like at level 25(close to bedrock), I hear a slime slapping some times around me BUT when I start mining, nothing is there. This happens mostly when I place glowstone as the floor a little and as well as place torches, I even tried digging it out but still nothing, and the roof is REALLY high. I even have a ravine close to it but it is not close enough.. Only for water to be heard.  I have tried moving/digging/placing/removing multiple times. Screenshots:  2nd screenshot slime farm:   Can anybody give me some HUGE advice on what I am doing wrong? Please and thank you!


I'm creating a simple macro with \href in it. But it seems to be kind of tricky, because using \href with a parameter does not recognize the link format. It simply adds an unwanted .pdf to the link target.  Basically the link  https://ctan.org/pkg/hyperref   is automatically changed to   https://ctan.org/pkg/hyperref.pdf   What is causing this behavior?  \documentclass{article} \usepackage{expl3,xparse} \usepackage{hyperref} \ExplSyntaxOn \cs_new:Npn \__pkgcls:n #1 {     \texorpdfstring{             \href{https://ctan.org/pkg/#1}{\ttfamily#1}     }{#1} } \DeclareDocumentCommand{\class}{o m}{% typeset class names     \__pkgcls:n { #2 } } \DeclareDocumentCommand{\package}{o m}{% typeset package names     \__pkgcls:n { #2 } } \ExplSyntaxOff \begin{document}   \class{scrartcl}\\\package{hyperref}\\\href{https://ctan.org/pkg/hyperref}{\ttfamily hyperref} \end{document}     Update: Here's a screenshot:    Update: The problem seems clearly expl3 related. Using something like  \def\pkgcls#1{\texorpdfstring{\href{https://ctan.org/pkg/#1}{\ttfamily #1}}{#1}} \def\pkg#1{\pkgcls{#1}}   produces the correct result.


How can I enter into the mathematics field at the graduate level when I only took a few math courses as an undergrad?

Background I was ignorant as an undergraduate and didn't focus heavily in any specific area. I finally graduated with a single math/computer science degree that consisted of 5 math classes beyond multivariable calculus and a few relatively basic computer science classes (algorithm analysis, SQL database design, etc.). My only research experience is in economics. Now, I work at a research institution in economics where I primarily write Stata/MATLAB code. Question I'd like to get more mathematics under my belt over the next few years in order to either enroll in a PhD program in economics/finance or a M.S. program in finance. What are my options for getting more math experience that I can use in graduate school admissions? Options These are the options I thought of so far, but I would like to know more if possible.  Study enough courses through a system like Open CourseWare to gain enough experience to enroll in more advanced undergraduate classes part time, which my employer might pay for, and then ideally move into an M.S. program in applied math.  Return to my alma mater for a M.S. degree in math that would at least give me a basis to either move into another math graduate program with higher rankings or a lower-ranked graduate program in the fields of my choice.  Join the Air Force and hopefully take advantage of the GI bill to take more courses somewhere and gain entrance into an M.S. program in applied math.  (Sadly) Forgo advanced mathematics and find a consulting job, which although unpleasant in the field of economics (in my opinion), wouldn't be difficult to obtain given my research background in the field.   Do I have any other options? I also plan to take the GRE subject test in mathematics to prove that I have at least minimal knowledge, regardless of what course I pursue (since many graduate programs will require it).


What's wrong with my derivation for the spring constant?

An $8.00\ \mathrm{kg}$ stone at rest on a spring. The spring is compressed $10.0\ \mathrm{cm}$ by the stone. What is the spring constant?   I used conservation of energy to solve this problem. The stone goes from the higher point to the lower point, whose distance from the higher one is $10\ \mathrm{cm}$. That means gravitational force has done work on the stone, the value of which is $mgh = 8 \times 9.8 \times 0.1 = 7.84$. The gravitational force does work on the stone that increases the kinetic energy of the stone. However the stone is at rest which means its kinetic energy is $0$. So there must be something done negative work on the stone to decrease its kinetic energy to zero which must be equal to work done by the gravitational force. That is the elastic force done by the spring, which has work calculated by $0.5\ kx^2$ where $x$ is the distance by which spring is compressed. So $$mgh = -0.5\ kx^2$$  At the end the value $k$ I get is $1568\ \mathrm{N/m}$. However, my friend used a different method, saying the stone is at rest so the force done by the spring equals the stone's weight. He takes $$kx=-mg$$ and he gets $k = 784\ \mathrm{N/m}$  His method is quite right and consistent with the laws of physics. I cant find anything wrong with his method. So that means my method is wrong since the answer is different but I don't notice anything wrong with that. Please point it out for me.


What home printer would allow for exact alignment of front and back?

Note: I'm not a graphic designer, but this seemed like the most relevant place to post. Feel free to send me off somewhere else if I'm not in the right place.  I would like to make some notebooks with double-sided grid paper that I've already designed, but my printer seems like it doesn't allow for absolutely exact alignment. Even if one side prints nice and straight, the other side will be slightly skewed left to right by one to two millimeters, which I read from an earlier post is a pretty reasonable variance for a home printer. So I suspect it's not possible to get both sides completely aligned on this printer – but if I'm wrong, please let me know how.  What kind of printer would allow for absolutely exact alignment? Is there any difference between inkjet and laser in this regard, or a more expensive printer versus a cheaper one?


Show that $\|f\|_{p}\leq \|f\|_{\infty}$ for any $0<p<\infty$ in a general measure space $X$ with $\mu(X)=1$.

Consider a general measure space $(\mu, \Sigma,X)$ with $\mu(X)=1$. I want to show that for any $\mu-$measurable function and for any $0<p<\infty$, we have $$\|f\|_{p}\leq \|f\|_{\infty}.$$ A similar question is here , but it is in an easier case, in the space $C([0,1])$, it seems that the $\sup-$norm is the same as the $\sup_{x}|f(x)|$. However, in a general measure space, the $\sup-$norm is actually an essential $\sup$: $$\|f\|_{\infty}=\inf\{M\geq 0:|f(x)|\leq M\ \text{holds for almost every}\ x\}.$$ Thus, the only thing I know is that $|f(x)|\leq\|f\|_{\infty}$ $\mu-$almost surely. I want to start from here but I got stuck: We have $|f(x)|^{p}\leq\|f\|_{\infty}^{p}$ $\mu-$almost surely, and thus the set defined by $E:=\{x\in X:|f(x)|^{p}>\|f\|_{\infty}^{p}\}$ has $\mu(E)=0$. Now, $$\int_{X}|f^{p}(x)|\mu(dx)\leq \int_{X\setminus E}|f(x)|^{p}\mu(dx)+\int_{E}|f(x)|^{p}\mu(dx).$$ The first integral is easy to evaluate, since $\mu(X)=1$, we know that $\mu(X\setminus E)=1$, and thus $$\int_{X\setminus E}|f(x)|^{p}\mu(dx)\leq \int_{X\setminus E}\|f\|_{\infty}^{p}\mu(dx)=\|f\|^{p}_{\infty}\mu(X\setminus E)=\|f\|^{p}_{\infty}.$$ But how to evaluate the second integral? Over $E$ I just have a reversed directly $>$. I have no idea how to bound it.. Thank you for any help!!


How to disable X server autostart in Debian Jessie?

I have a remote machine running Debian 8 (Jessie) with lightdm installed. I want it to start in no-GUI mode, but I don't want to remove all X-related stuff to still be able to run it though SSH with the -X parameter. So how to disable X server autostart without removing it?  I tried systemctl stop lightdm, it stops the lightdm, but it runs again after reboot. I also tried systemctl disable lightdm, but it basically does nothing. It renames lightdm's scripts in /etc/rc*.d directories, but it still starts after reboot, so what am I doing wrong? And I can't just update-rc.d lightdm stop, because it's deprecated and doesn't work.


Can you change a vote if a post is changed as a result of your edit?

I know that votes are locked until the post is edited.  Once I downvoted a post and left a comment. As it were, when I returned to it, the OP had incorporated my comment into his answer, allowing me to change my downvote.  Suppose that I had been the one to make the change (I have enough rep on that site to edit.) Would that then have allowed me to upgrade my own downvote?


Recoding a variable with three levels into a dummy variable

I need to recode the variable school setting (urban, sub-urban and rural settings) into a dummy variable. I know that when creating a dummy variable, there is one category less (so 2 rather than three conditions) and that the urban is the largest group and should be used as baseline (not sure if baseline is the right word, but hopefully you know what I mean). However, I don't know what to do from here.  Is the variable changed into: 1. Two dummy variables: setting 1 with urban/sub-urban and setting 2 with urban/rural? 2. One variable where urban is given the value 1, and urban and sub-urban are given the value 0? 3. Both? 4. Have I completely missed something?  Hope you can help me!!


Is it appropriate to use short form of "have" ('ve) when it means possession?

I feel uncomfortable saying sentences like the following:    "I've a car" instead of "I have a car" "They've a great time" instead of "They have a great time" "He's a pen" instead of "He has a pen" etc   I ask this because I read this sort of thing in a book.  Are they correct? And what is the rule? Can you use such forms in a formal setting?


The actual sentence goes like this:  How easy it is to integrate the two applications? or How easy is it to integrate the two applications?  To my understanding 'How easy it is' wrong if used as a question. So, please clarify.


I have 2 year visit visa allowed from feb 2020 to feb 2022. I didnt come in 2020. Now i want to stay from Jan, feb, march and april in uk Then may in Pakistan, then june, july, august, september and october in uk. October end back to Pak. Is this allowed ?


When I using the \bm package, all the letters are overprinting like below.  I could not find the problem.


Mac HD won't mount - FFFFFFFF-FFFF-FFFF-FFFF-FFFFFFFFFFFF Error

Same error as a lot of users here, but I'm running Catalina, so I'm not sure if that changes things and I would rather make sure I'm going about it the right way so I don't make things worse.   I tried to delete a partition, and disk utility crashed halfway through. I restarted and got the folder with the ? on it.   I would greatly appreciate if someone could guide me to fixing this without losing all of my data. Thanks.  E: I realise I should probably add a little more info. I have an Early 2013 15” MBP with the 500GB SSD.


Statistical information regarding scaling ElasticSearch

I have a set-up with several Logstash nodes sending input to ElasticSearch, and have a kibana server which allows me to visualize this.  The current infrastructure is pretty simplistic and is on single node machines. We are looking to scale it out to a larger testbed. However, before investing in scaling out a large deployment of ELK, I am looking to get a better understanding of how well it scales and it's performance parameters.  I have not been able to find numbers on the Elastic Search website or in their case studies  The questions are these:   How well does Elastic Search Scale? How many logs/sec can it consume, how many nodes are required? Any numbers or insight would do. How well does it perform with time as indexes, we visualize the use case being more of structured queries. In particular how does it compare to SQL like databases. One of the concerns raised is that would it be better to use SQL databases if we know the log structure before hand. We do not need necessarily a search engine functionality if performance is a big bottleneck.?   I am a newbie in ELK/SQL server management, so please excuse me if the questions seem to be not well formed.


Ignoring accented letters in string comparison

I need to compare 2 strings in C# and treat accented letters the same as non-accented letters. For example:  string s1 = "hello"; string s2 = "héllo";  s1.Equals(s2, StringComparison.InvariantCultureIgnoreCase); s1.Equals(s2, StringComparison.OrdinalIgnoreCase);   These 2 strings need to be the same (as far as my application is concerned), but both of these statements evaluate to false. Is there a way in C# to do this?


finding the real values of $x$ such that : $x=\sqrt{2+\sqrt{2-\sqrt{2+x}}}$

How to find the real values of $x$ such that : $$x=\sqrt{2+\sqrt{2-\sqrt{2+x}}}$$


How to make the left Super-key open "Show Applications" menu as a shortcut?

In Ubuntu 18.04.1, I would like to use my left Super-key only to simply open the Show Applications menu (aka Dash) like a left click on the dock-icon (with the 9 dots) does and preferably close it again without showing me any open programs.   I can open it with Super + A and even close it again with Super R, but Super L appears to do nothing at all.   In Xfce, something similar was possible by adding a custom keyboard shortcut for Super L and setting the command to xfce4-popup-whiskermenu, which would open and close a menu with favourite applications. Unfortunately, I don't know the command that opens and closes the Show Applications menu.   Is there any way to add such a shortcut in the new Gnome Shell?


Fix permissions of C:\Program Files\WindowsApps

Ok, so I was trying to edit files in the the WindowsApps directory (I made this post ) and I set myself as the owner of all of the folders in this directory. Then, this made Windows Store unlaunchable, so I began fiddling with the permissions, which was a big mistake. If I add a permission rule giving "All application packages" full control of the WindowsApps folder and subfolders, then Windows Store begins functioning again, but this seems like a band-aid fix so I tried to find another solution. I tried resetting Windows twice (once keeping files and once losing files) but this issue still persists.  I am running 64-bit Windows 10 Pro - I am preparing to reinstall Windows with a USB drive created through the  but I am worried this will install a standard version of Windows. Will I be able to keep the Pro version?   Does anyone have any other ideas - maybe ways to reset permissions of an entire folder tree or is there a way to delete the entire WindowsApps directory and have Window update repair it?  At this point, I am considering just using my computer as-is, because I don't really use the Windows store.. please help!


Prove that $r$ is a primitive root modulo $p$ if and only if $r^{(p−1)/q}\not\equiv 1\pmod{p}$

Suppose $p$ is an odd prime. Prove that $r$, with $\gcd(r, p) = 1$, is a primitive root   modulo $p$ if and only if $r^{(p−1)/q}\not\equiv 1\pmod{p}$ for all prime divisors $q$ of $p − 1$.   The only if direction is trivial, I can multiply $q$ to get $(r^{(p-1)/q})^q\equiv1^q\pmod{p}$.  So, $r$ is a primitive root. How do I do the other direction? Can someone give me a hint or suggestion? Thanks


Will an OLS estimator for a regressor differ between a single linear regression and a multiple linear regression?

Thought question that I am having a difficult time formulating mathematically.   Knowing that $y = \beta_0 + \beta_1X_1 +\beta_2X_2 + \varepsilon$, where $X_1$ and $X_2$ are non-random and $\beta_2$ is non-zero.   If I construct a regression using both $X_1$ and $X_2$ in a multivariable regression, but then re-fit my model using only $X_1$ (going from a multivariable regression to a single linear regression), will my OLS estimator for $\beta_1$ remain unchanged (e.g. will the estimator for $\beta_1$ be equal in both models)?   Intuitively, I would assume that I would obtain different results across models as more information is being used to predict $y$ in the multivariable regression.  Should I be looking at the  theorem? Or does  get to the root of my question?


Computed wrong the sum $\displaystyle\sum_{n\ge1}\frac{\cos n}{n^2} $

I've computed (using standard complex analysis techniques) the sum $$ \sum_{n\ge1}\frac{\cos n}{n^2} $$ and I found $\pi^2/6+1/4$ which is strictly greater than $\pi^2/6$, and this is impossibile, since my series is less or equal than $\sum_{n\ge1}1/n^2$.  So I must have done some mistake, somewhere. I won't write all details of my computation because it would be boring for me and for you too; I only need to know where can I find the sum of this series: in this way I could look at my computations and find the mistake.  Many thanks


I was reading an example from my book, and I need further clarification because I don't understand some things. I'm just going to include the $f_1$ part in full detail because $f_2$ and $f_3$ are identical.   Consider the following problem.  Once upon a time, a band of seven pirates seized a treasure chest containing some gold coins (all of equal value). They agreed to divide the coins equally among the group, but there were two coins left over. One of the pirates took it upon himself to throw the extra coins overboard to solve the dilemma. Another pirate immediately dived overboard after the sinking coins and was never heard from again. After a few minutes, the six remaining pirates redivided the coins and found that there were three coins left. This time a fight ensured and one pirate was killed. Finally, the five surviving pirates were able to split the treasure evenly. What was the least possible number of coins in the treasure chest to begin with?   If x represents the original number of coins, then the first division can be represented by the congruence   $x \equiv 2 $ (mod $7)$ [I understand this part because originally we had 7 pirates and 2 left over coins]  The second and third division give the congruences  $x - 2 \equiv 3$ (mod $6$) and $x-2 \equiv 0 $ (mod $5$).  [The second division is the 2 coins that were thrown overboard, the pirate jumping into the ocean is the new mod, and there are 3 coins leftover. The third division is the original 2 coins thrown overboard, the 5 surviving pirates, and nothing is left over].  So the system of congruences is $x \equiv 2$ (mod 7), $x \equiv 5$ (mod 6), and $x \equiv 2$ (mod 5)  We solve the system by letting $x= 2f_1+5f_2+2f_3$  where $f_1,f_2$, and $f_3$ (to be determined soon ) satisfy   $f_1 \equiv 1$ (mod 7) $f_2 \equiv 0$ (mod 7) $f_3 \equiv 0$ (mod 7)  $f_1 \equiv 0$ (mod 6) $f_2 \equiv 1$ (mod 6) $f_3 \equiv 0$ (mod 6)  $f_1 \equiv 0$ (mod 5) $f_2 \equiv 0$ (mod 5) $f_3 \equiv 1$ (mod 5)  [Where are they getting this from?]  To compute $f_1$ we set $f_1 = 6 \times 5 \times b_1$ where $b_1$ satisfies the single congruence $ 6 \times 5 \times b_1 \equiv 1$ (mod 7)  [Ok. That 6 and 5 comes from mod 6 and mod 5, but why is there a 1 at the end of the equation?]  Note that $f_1$ is necessarily divisible by 6 and by 5 and is congruent to 1 modulo 7. Thus $f_1 \equiv 1$ (mod 7), $f_1 \equiv 0$ (mod 6), and $f_1 \equiv 0$ (mod 5)  To solve the congruence, reduce $ 6 \times 5$ modulo 7 to get $2b_1 \equiv 1$ (mod 7) [ $ 6 \times 5 = 30 $, so if I divide 30 by 7, I would get a remainder of 2 because $ 7 \times 4 = 28$ and $ 30-28=2$.   Note that $b_1 = 4$ is a solution. [WAIT! Where did that 4 come from? Now I'm really confused. What are the steps?]


Debugging my simple java game(Rock Paper Scissor)

I created this program to run infinite times asking the user to enter a choice(rock or paper or scissor), which seems to work fine. The problem is no else ....if or if ....else statements are satisfied. Whatever input i give it just prints out the else statement in the else statement, (Enter a valid choice). I cant find the mistake i made so ill link my code below..... Thanks in advance.  import java.util.Scanner; import java.util.Random;  public class apples {     public static void main(String args[]){          Scanner input = new Scanner(System.in);         Random number = new Random();          String rps[] = {"rock", "paper", "scissor"};         String player;         String ai;         int rand, pscore=0, aiscore=0;          while(1 < 2){         System.out.println("Take your pick \nrock \npaper \nscissor");         player = input.nextLine();          rand = number.nextInt(3);         ai = rps[rand];          System.out.println(ai);          if(player == ai){             pscore+=0;             aiscore+=0;             System.out.println("Your opponent chose " + ai + "\tYour score= "+ pscore + "\tOpponents score = "+aiscore);             System.out.print("\n");             continue;         }else{             if(player == "rock" && ai == "paper"){                 aiscore+=1;                 pscore+=0;                 System.out.println("Your opponent chose " + ai + "\tYour score= "+ pscore + "\tOpponents score = "+aiscore);                 System.out.print("\n");                 continue;             }else if(player == "rock" && ai == "scissor"){                 pscore+=1;                 aiscore+=0;                 System.out.println("Your opponent chose " + ai + "\tYour score= "+ pscore + "\tOpponents score = "+aiscore);                 System.out.print("\n");                 continue;             }else if(player == "paper" && ai == "rock"){                 pscore+=1;                 aiscore+=0;                 System.out.println("Your opponent chose " + ai + "\tYour score= "+ pscore + "\tOpponents score = "+aiscore);                 System.out.print("\n");                 continue;             }else if(player == "paper" && ai == "scissor"){                 aiscore+=1;                 pscore+=0;                 System.out.println("Your opponent chose " + ai + "\tYour score= "+ pscore + "\tOpponents score = "+aiscore);                 System.out.print("\n");                 continue;             }else if(player == "scissor" && ai == "rock"){                 aiscore+=1;                 pscore+=0;                 System.out.println("Your opponent chose " + ai + "\tYour score= "+ pscore + "\tOpponents score = "+aiscore);                 System.out.print("\n");                 continue;             }else if(player == "scissor" && ai == "paper"){                 aiscore+=0;                 pscore+=1;                 System.out.println("Your opponent chose " + ai + "\tYour score= "+ pscore + "\tOpponents score = "+aiscore);                 System.out.print("\n");                 continue;             }else{                 System.out.println("Enter a valid choice");                 System.out.print("\n");                 continue;             }         }         }       } }


What is this double blue arrow icon overlay?

This is a duplicate of .   I'm in the process of recovering from a major data-loss disaster. After restoring files from my external hard drive, many of the folders and files have a new (to me) icon overlay on them. The icons appear in Windows Explorer and in the file/folder property dialogs.  The icon overlay shows two blue arrows facing each other.  What do these icon overlays mean?  I am running Windows 10 Pro (64-bit).


I am trying to configure the AWS CLI using a bash script. I have the below in my script and it will not set the values. When I echo out the variables names it just shows a blank line.  script code  export AWS_ACCESS_KEY_ID=<key>  export AWS_SECRET_ACCESS_KEY=<secret_key>  export AWS_DEFAULT_REGION=<region>


Which is the best website to choose the best Background and Foreground colors?

I am building a Flat color based website and am having trouble choosing the color scheme. I need a background color (section background) and a foreground color (element background). The element, in this case a button is on top of the section background.  I have come across multiple color palette websites like  and . They are great. But, all of them give me multiple colors making it hard for me to decide. Is there a website that gives me just a Foreground and Background color? Or, is there a way to test how well two colors would do as a background and foreground color? Thank you!


website url validation with proper RegEXP for all types of domains for all countries

I am trying to validate a webiste url and using this RegExp for that    var websiteregex = /^(?:(ftp|http|https):\/\/)?(?:[\w-]+\.)+[a-z]{3,6}$/;   This is working fine for all expect for the domaains of other countries for example example.com.mt.For that it is not working.It is working for example.com.How i can customize the expression for making it work for all types of urls


Time travel alters history but people keep saying nothing's changed

About 2005-10, I read a story in an anthology. Don't recall the title of the anthology, story or author.  Involved the protagonist making repeated trips to the past.  At each return, he found the world a little different, but people kept telling him, "See? Nothing's changed."  At the end there have been numerous cumulative changes      humanity are now intelligent lobster-like arthropods, still maintaining that time travel does not alter history.


Lubuntu either fails to install grub or fails to boot after what seems to be successfull instalation

I am trying to install lubuntu on my Asus netbook. Before I reach installation type, I see warning:     Force UEFI Installation? This machines's firmware has started this   installer in UEFI mode but it looks like there maybe existing   operating systems already installed using BIOS compatibility mode, If   you continue to install Debian in UEFI mode,it might be difficult to   reboot into any BIOS-mode operating system.   Then if I try to go "Erase disk and install Lubuntu", it fails to install grub:     The 'grub-efi-amd64-signed' package failed to install into /target/.   Without the grub boot loader, the installed system will not boot.    If I chose "Something else", create partitions: ext4 mounted in '/', swap and efi, and chose efi to install boot loader there, installation seems to finish successfully.  But when I turn the computer on again, only bios appears and I don't see lubuntu in booting options.  Failure to install grub happens also when I chose the whole disk (/dev/mmcblk0, while efi is /dev/mmcblk0p1) as a "device for boot loader installation".  On the other hand, can I correctly setup grub from terminal, considering the fact that I have a fully functioning system until I restart the computer?  Any ideas? Thank you!


Prove that this sequence diverges to infinity.

$\lim_{n\to \infty} (1 +\frac{1}{n}\tag{displayed})^{n^2} = \infty$  I don't know how to tackle this one. Knowing that it diverges to infinity and thus does not have an upper bound, should I try to prove that it's an unbounded subsequence, if so how? Is that sufficient to show that $\infty$ is the limit?  Any help would be appreciated.


I have just installed Ubuntu 12.04 which comes with Python 2.7. I have installed Python 3.3, so now I have both versions. For example, if I type python in the terminal I get version 2.7 and if I type python3.3 I get that version.  I don't see why I would need 2 versions (?) so how do I uninstall Python 2.7? And if I do so, will the "python" command then point to Python 3.3?


Binary executable fails to run on Ubuntu 18.04 LTS

I want to write, compile, and run a simple test.cpp file.  Error when running $ ./test.o:  bash: ./test.o: cannot execute binary file: Exec format error   Results of running $ file ./test.o:  ./test.o: ELF 64-bit LSB relocatable, x86-64, version 1 (SYSV), not stripped   Results of running $ uname -m is x86_64  From my understanding, I need the same system architecture as the binary executable but they both seem to be the same and yet when I run $ ./test.o I keep receiving that same error. Any ideas?


I have an Android TV stck I compiled Linux for IT from   But when I booted that Image I found /proc/config.gz is of 0 bytes  can some please explain how the command line params from .config file in kernel source get mounted to /proc. I mean what goes in the background??


I want to compute the determinant of the sum $\textbf{M}$ of two simple matrices $\textbf{A}$ and $\textbf{B}$. The former is a constant matrix of elements $[\textbf{A}]_{ij} = a$, while the latter is a diagonal matrix of elements $[\textbf{B}]_{ij} = \delta_{ij}b_i$. One can think of it as a rank $1$ perturbation of the matrix $\textbf{B}$. Explicitly: $$ M = \left[\begin{array}{cc} a - b_1 & a & \dots & a  \\ a & a - b_2 & \dots & a \\ \vdots & & \ddots &\vdots \\ a & a & \dots & a- b_N \end{array}\right] $$ I was wondering if there is a simple formula for $\det( \textbf{M})$ as a function of $a$ and $b_1, \dots, b_N$.


Why wrapper class objects are not passed by reference

public class MyClass {     public static void main(String args[]) {         Integer a = 0;         change(a);         System.out.println("a = " + a);     }      static void change(Integer a) {         a++;     } }  The output of the above code is a=0 since objects are passed by reference. Why doesn't the value of a change from 0 to 1?


Solving the functional equation f(x+y)=f(x)+f(y)+y√f(x)

The question is to solve the functional equation $$f(x+y)=f(x)+f(y)+y\sqrt{f(x)}$$ $\forall x,y \in \mathbb R$  I tried to put x=y=0,y=x and y=-x in the given functional equation.I ended up getting $$f(2x)=3f(x)+f(-x)$$ and $$f(x)+f(-x)=x\sqrt{f(x})$$ from where I am unable to proceed.Thanks.


How to suppress certain .bib fields (e.g. year) only for certain entry types (e.g. inproceedings)

How can I suppress the year from appearing in the bibliography for entries of type @inproceedings?  In my specific case the year is implied in the booktitle (e.g. FOCS '09) so it is redundant when I need to save space.  I found  and the "second solution" looks promising but I am not sure how to translate it to only suppress the year for one type of entry. I am guessing \ifentrytype might be helpful. I am using biblatex+biber.


A different expression for expected value of a random variable

Let $X$ be a non-negative random variable on $(\Omega, \mathcal{F}, P)$ such that $E[X]<\infty$. I need to show that: $E[X]=\int_0^\infty P(X>t) \ dt$ (Riemann integral) where $E[X]=\int_\Omega X \ dP =\int_\mathbb{R}x \  dP_X$   (Lebesgue integral). Any help would be appreciated, thank you.


Solving minimization problem $L_2$ IRLS (Iteration derivation)

In the article ''' Chartrand, Rick, and Wotao Yin. "Iteratively reweighted algorithms for compressive sensing." Acoustics, speech and signal processing, 2008. ICASSP 2008. IEEE international conference on. IEEE, 2008. '''  It is given that one iteration of  iterative reweighed least squares problem can be written as $\min \sum_{i=1}^N w_i u_i^2 $ subject to $\Phi u = b  $ which has a closed form solution given as   $u^{(n)} = Q_n \Phi^T (\Phi Q_n \Phi^T)^{-1} b$. where $Q_n$ is the diagonal matrix containing entries $1/(|u_i^{(n-1)}|^2 + \epsilon )^{1/2} $ And the closed form equation can be derived from the Euler Lagrange equation. Can someone please help me to get the derivation of the iteration?\ I understood till $$\min_u u^TWu+λ|| \Phi u−b||_2^2 $$  which can be written as $(\bigtriangledown=0)$ which gives $$ W u + \lambda (\Phi^T \Phi u - \Phi^T b) =0$$


How can I create the synctex file for the LaTeX source?

I deleted the synctex file by mistake and I'd like to know if there's a way to recover it. I want to be able to Ctrl-click in the preview and jump to the corresponding place in the LaTeX source.  I'm using TeXworks. Recompiling the source won't work.


From the technical details it seems that HTC one (m7) has 2Gb of RAM, but if I check the RAM usage the smartphone shows that I am using around 900 Mb of 1.5Gb. There is something that I do not understand?


Check for the Existence of a Possible Combination of Values in an Array which Sum to a Given Value

FOR MODERATOR:  The question for which this is a supposed duplicate of, does not address a number of issues.    This question is not about how the operators work per se, but how they function in the algorithm, i.e. why those operators at that point.   This question also includes the bit-wise comparison '&' operator, which the other question does not address at all.  The central insight to the answer provided is that by assigning combinationsCount = 1 << listSize one turns the iterator 'i'  in the loop into a bit vector, which can be tested against a particular 'j' to determine if it should be included in the sum to test.   This is a solution to a variation of the coin change problem, I think. The code works, to the best of my knowledge, but I do not understand how the last if check:  if (i & (1 << j)) {     combinationSum += arr[j]; }   works in this algorithm (see below). I ran into it working through a tutorial. I'd really appreciate any explanation of how that portion of the code works.   UPDATE:  To be clear, I understanding WHAT the operators are doing, i.e. the bit shifting and the bit-wise addition. What I want to know is how they operate within the algorithm.  possibleCombinationSumN(arr, n) {   if (arr.indexOf(n) >= 0) {     return true;   }    if (arr[0] > n) {     return false;   }    if (arr[arr.length - 1] > n) {     arr.pop();     return possibleCombinationSumN(arr, n);   }    var listSize = arr.length, combinationsCount = (1 << listSize)   for (var i = 1; i < combinationsCount; i++) {     var combinationSum = 0;     for (var j = 0; j < listSize; j++) {       if (i & (1 << j)) {         combinationSum += arr[j];       }     }     if (n === combinationSum) {       return true;     }   }   return false; };


I want to use chicago manual style, which does not seem to be available for natbib, so I want to use biblatex instead.  Since I have in-text citations, I followed the previous answers and tried this:  \usepackage[natbib=true]{biblatex} \bibliography{dotbibfile}  \printbibliography   But my in-text citations won't show up, they show up as keys, like lupu2017legacy  What should I fix to make in-cite citations show up?


The below is my main method in which am comparing two object references. Having overridden the toString() method in Car class, my question is why are the below "if" conditions evaluating to false when they should evaluate to true. Could somebody explain? Thanks.  public static void main(String[] args){          Car c1 = new Car(2829,"white");         Car c2 = new Car(2829,"white");          if(c1 == c2)             System.out.println(true);         else             System.out.println(false);          String sc1 = c1.toString();         String sc2 = c2.toString();          if(sc1 == sc2)             System.out.println("it's equal");         else             System.out.println("it's not!");     }   public class Car {     private int regNo;     private String color;      protected void start(){         System.out.println("Car Started!");     }      public Car(int regNo, String color){         this.regNo = regNo;         this.color = color;     }      @Override     public String toString() {         return "Car-"+regNo;     } }   Say, i have two strings s1="abc" and s2 = "abc". Now, s1 == s2 evaluating to true then why is that in the above code c1.toString() == c2.toString() evaluating to false is my question?


$f(yf(x) + y) = xy + f(y)$ for all $x, y.$ Prove $f$ is surjective

I'm stucking with this problem for days. f is a function from $\mathbb{R}$ to $\mathbb{R}$ satisfies: $$f(yf(x) + y) = xy + f(y) \qquad \forall x, y \in \mathbb{R}$$ Prove $f$ is surjective, and hence find all the functions satisfy this equation. I think fixing a $x$ and $y$ as a constant and study the function might be a good idea, but so far I've been only playing with $x=1,0$ and $y=1,0,$ and they didn't seem to help in proving surjectivity. Any help is appreciated. Thanks! (Proving injectivity is easy)


From yesterday I've stucked with the following problem from my class homework Find the generating function $$ \sum_{n=0}^{\infty} \binom{n+k-1}{n} \cdot x^n $$ I've tried several different approaches, but none of them worked here. So, I don't know how to even make the first step to solution. Any hints/ideas would be very appreciated.


About the third row in the truth table from the conditional

I would like to know why is universally accepted by mathematicians and logicians that: if P is false and Q true, then P → Q is true.  Why cannot be otherwise? Which are the reasons?


How long do I need to stay out of South Africa after a 90 day stay, before returning?

I stayed in SA from Oct 4th to December 12th.    What date can I return?