I am currently stuck with the following partition function   Let the action be $$S(X, \psi^1, \psi^2) = \frac{1}{2} (\partial h)^2 - \partial^2h\psi^1 \psi^2 ,$$ where $h$ is a real function of the bosonic variable $X$, $\partial h = h'$ and $ \psi^i$ are Grassmann odd variables. The action is invariant under $$ \delta X = \epsilon^1 \psi_1 + \epsilon^2 \psi_2$$ $$ \delta \psi_1 = \epsilon^2 \partial h$$ $$ \delta \psi_2 = -\epsilon^1 \partial h,$$ with $\epsilon^i$ Grassmann odd variables.  Now Suppose $\partial h$ is nowhere $0$, i have to show that the corresponding partition function  $$ Z = \int dX d\psi^1 d\psi^2 e^{-S}= 0$$  After a change of variables $$ \hat{X} = X - \frac{\psi^1 \psi^2}{\partial h}$$ $$ \hat{\psi}^1= \alpha(X) \psi^1$$ $$ \hat{\psi}^2= \psi^1 + \psi^2,$$  such that $S(X,\psi^1,\psi^2) = S(\hat{X}, 0,\hat{\psi}^2)$ ,with $\alpha$ an arbitrary function of X, and some Grassmann integration  i get that $$Z = -\int e^{-S(\hat{X}, 0, \hat{\psi}^2) } \frac{\partial^2h}{(\partial h)^2} \hat{\psi}^1 \hat{\psi}^2 d \hat{X} d \hat{\psi}^1 d \hat{\psi}^2$$ which should be zero. But i can not see why ? I got the hint that the integrand is a total derivative in $ \hat{X}$ but that didnt help me.

I'm reading Chapter 9 of . As you can see in eq. (9.30) his model for SUSY is  $$\begin{align} \delta_\epsilon X &=\epsilon^1\psi_1 + \epsilon^2\psi_2\\ \delta\psi_1 &= \epsilon^2\partial h\\ \delta\psi_2 &=-\epsilon^1\partial h.  \end{align}\tag{9.30}$$  I understand that if $\partial h\neq 0$ it is possible to see that partition function vanishes, in particular, there is a total divergence:  $$ \int \mathrm{d}\hat{X}e^{\frac{1}{2}(\partial h(\hat{X}))^2}\frac{\partial^2 h(\hat{X})}{(\partial h(\hat{X}))^2}. \tag{*} $$  The implication that a total divergence yields vanishing integral, it is a bit strange, because, since every function that admit a primitive is a total derivative. What is the meaning of that implication? Then why $(*)$ vanishes? It seems to me that, in general, $$ \int \mathrm{d}(h')\frac{e^{\frac{1}{2}(h')^2}}{(h')^2}\neq 0. $$  Then, again, when he claims that if there is a $x_0$ such that $h'(x_0)=0$ we can use again the argument of the total divergence, why doesn't he keep in account that, removing a small neighborhood of $x_0$, give us some contribution at the border of that neighborhood (two points)?


I installed fresh Ubuntu 20.04. The Softwarecenter is not loading. I did sudo apt-get update and `sudo apt-get upgrade. This is how it looks if I open it:  Or like this if I try to install a program over a dev file:  Problem remains after restarts. Any idea what is causing this?

In my freshly installed Ubuntu 20.04 LTS, Ubuntu Software is not loading properly.  It is loading only Editor's Picks but nothing else. Installed tab is empty and search is not working as well. My internet connection is perfectly working and I am not using any firewall.


This contains some broken links:    But it can not changed, because it is locked.  Can someone fix this?

The locked and closed question  has an  that contains an anti-pattern, .  I tried to edit and to comment, which both did not work, as this is a . Yet, it would be nice if it could avoid advertising anti-patterns.  Is there any way to amend the answer, or any alternative?


I was reading about the cp command in unix and one of the options is:  cp -f : force copy by removing the destination file if needed  so I wanted to test this to see how it works, I did the following: In some directory as a root I created a file with the name "rootfile": -rw-r--r--. 1 root root    0 Jan  5 20:27 rootfile  then as a normal user called "User" I created another file called "Userfile": -rw-rw-r--. 1 User User    0 Jan  5 20:27 Userfile  now I tried to perform some simple cp of the file "Userfile" to the existing root file named "rootfile" while I logging using the normal user account "User" using the following command:  cp Userfile rootfile  and this what I got :  cp: cannot create regular file `rootfile': Permission denied  This is perfect normal  since I don't have permission to overwrite the existing root file. Now applying the command with "-f" option: cp -f Userfile rootfile  all works fine no errors were reported, now my question is how this is possible if i don't have permission to overwrite the file named "rootfile". Is it maybe because I have permission on the folder containing the file? and how does the -f option really works? Regards

From the post  I understand that rm just needs write permission on directory to remove the file. But I find it hard to digest the behaviour where we can easily delete a file who owner and group different.  I tried the following  mtk : my username abc : created a new user  $ ls -l file -rw-rw-r-- 1 mtk mtk       0 Aug 31 15:40 file $ sudo chown abc file $ sudo chgrp abc file $ ls -l file -rw-rw-r-- 1 abc abc       0 Aug 31 15:40 file $ rm file $ ls -l file <deleted>   I was thinking this shouldn't have been allowed. A user should be able to delete only files under his ownership? Can someone shed light on why this is permitted? and what is the way to avoid this? I can think only restricting the write permission of the parent directory to dis-allow surprised deletes of file.


Here is how my codes are: double pressure; double volume = Double.parseDouble(volumeTxt.getText()); double moles = Double.parseDouble(molesTxt.getText()); double temp = Double.parseDouble(tempTxt.getText());             pressure = (moles * R * temp)/volume; pressureTxt.setText(Double.toString(pressure));  How do I make the value of pressure that will be displayed be set to FOUR DECIMAL PLACES ONLY? Thank you so much

What I would like is a method to convert a double to a string which rounds using the half-up method - i.e. if the decimal to be rounded is 5, it always rounds up to the next number. This is the standard method of rounding most people expect in most situations.  I also would like only significant digits to be displayed - i.e. there should not be any trailing zeroes.  I know one method of doing this is to use the String.format method:  String.format("%.5g%n", 0.912385);   returns:  0.91239   which is great, however it always displays numbers with 5 decimal places even if they are not significant:   String.format("%.5g%n", 0.912300);   returns:  0.91230   Another method is to use the DecimalFormatter:  DecimalFormat df = new DecimalFormat("#.#####"); df.format(0.912385);   returns:  0.91238   However as you can see this uses half-even rounding. That is it will round down if the previous digit is even. What I'd like is this:  0.912385 -> 0.91239 0.912300 -> 0.9123   What is the best way to achieve this in Java?


$x + 2y + 3z = 4$  $w = x + 2\times y$, then the equation becomes $w + 3z = 4$. $\gcd(1, 3) = 1 | 4$, so this two variable equation is solvable. $w = -2, y = 2$  i can't seem to pass this point

How to solve $ax+by+cz=d$ over integers where $a,b,c,d$ are integers?


$G$ is a Hausdorff topology group, $H$ is a normal subgroup which is not closed. How to prove the quotient group $G/H$ is not Hausdorff.  For example, what are the quotient group and quotient topology of $\mathbb{R}/\mathbb{Q}$?

I am reading General topology, Volume 1 By Nicolas Bourbaki. I refer to the proof of . Could someone kindly explain the G/H Hausdorff $\implies$ H closed part of the proof? I understand that $H$ is an equiv class for the relation $x^{-1}y \in H$ bit, but I am failing to see how the Hausdorffness relates to $H$ being closed. I am also trying to understand the converse part of the proof which I think I'd be more successful in doing so if I understand the first part first. I am trying to self-learn topology, and I apologize for the stupidness of my questions on this site. Thanks in advance.


I would like to understand Stack Exchange better and improve my questions' and answers' quality, and this is why I would like to ask the following:  Recently I asked a question here, on Meta, which is received so many downvotes. I would like the understand why, and how can I avoid this? Even better, how can I ask that particular question to receive upvotes? The question is this:   I searched for answers here, on Meta, and I found , but it didn't help me to understand my problem.

There is a lot of irritation and whining from newbies when their suggestions get downvoted because they don't understand that votes have a different meaning here.   This is unnecessary, and I'm absolutely sure is one of the contributing factors why some people turn away from Meta after first contact, and never return.  To fix this, when a user asks their first question here, it should be pointed out in big bold letters that voting follows different rules here than on the mother site.  Something like     Note that voting on Meta.stackoverflow.com works differently from the other Stack Exchange sites. Voting is used as an expression of agreement or disagreement on contributions here, rather than to point out a lack of quality or helpfulness. Do not be too concerned if you receive downvotes - it is possible that members of the community are simply  disagreeing with what your contribution is suggesting.


I'm trying to solve the  in O(N log K) time and am getting an undesirable result. My Python3 code and console output are below: from collections import Counter import heapq  class Solution:     def topKFrequent(self, words: List[str], k: int) -> List[str]:                  counts = Counter(words)         print('Word counts:', counts)                  result = []         for word in counts:             print('Word being added:', word)             if len(result) < k:                 heapq.heappush(result, (-counts[word], word))                 print(result)             else:                 heapq.heappushpop(result, (-counts[word], word))         result = [r[1] for r in result]                  return result  ----------- Console output -----------  Word counts: Counter({'the': 3, 'is': 3, 'sunny': 2, 'day': 1}) Word being added: the [(-3, 'the')] Word being added: day [(-3, 'the'), (-1, 'day')] Word being added: is [(-3, 'is'), (-1, 'day'), (-3, 'the')] Word being added: sunny [(-3, 'is'), (-2, 'sunny'), (-3, 'the'), (-1, 'day')]  When I run the test case ["the", "day", "is", "sunny", "the", "the", "sunny", "is", "is"] with K = 4, I find that the word the gets shifted to the end of the list (after day) once is is added even though they both have a count of 3. This makes sense since the parent need only be <= the children and the children are not ordered in any way. Since (-2, 'sunny') and (-3, 'the') are both > (-3, 'is'), the heap invariant is, in fact, maintained even though (-3, 'the') < (-2, 'sunny') and is the right child of (-3, 'is'). The expected result is ["is","the","sunny","day"] while the output of my code is ["is","sunny","the","day"]. Should I be using heaps to solve this problem in O(N log K) time, and if so, how can I modify my code to achieve the desired result?

Input: A positive integer K and a big text. The text can actually be viewed as word sequence. So we don't have to worry about how to break down it into word sequence. Output: The most frequent K words in the text.  My thinking is like this.    use a Hash table to record all words' frequency while traverse the whole word sequence. In this phase, the key is "word" and the value is "word-frequency". This takes O(n) time.  sort the (word, word-frequency) pair; and the key is "word-frequency". This takes O(n*lg(n)) time with normal sorting algorithm.  After sorting, we just take the first K words. This takes O(K) time.    To summarize, the total time is O(n+nlg(n)+K)， Since K is surely smaller than N, so it is actually O(nlg(n)).  We can improve this. Actually, we just want top K words. Other words' frequency is not concern for us. So, we can use "partial Heap sorting". For step 2) and 3), we don't just do sorting. Instead, we change it to be  2') build a heap of (word, word-frequency) pair with "word-frequency" as key. It takes O(n) time to build a heap;  3') extract top K words from the heap. Each extraction is O(lg(n)). So, total time is O(k*lg(n)).  To summarize, this solution cost time O(n+k*lg(n)).  This is just my thought. I haven't find out way to improve step 1). I Hope some Information Retrieval experts can shed more light on this question.


Additional duplicate:   In Harry Potter and the Chamber of Secrets, we first hear the name Tom Riddle. Until the end of the book, Tom appears to be good, although mysterious. In the school, there is even a trophy with his name on it which he won for special services to the school. Then when Harry goes to the Chamber of Secrets, we find out Tom is actually Lord Voldemort.   Now, why would the trophy for Tom Riddle still be up in the school if it was well known that Tom was Voldemort? But at the same time, it wasn't a secret. Dumbledore knew who Tom was. Slughorn knew who he was. Helena Ravenclaw did too as did a few Death Eaters who went to school with him (and probably a few more.) In fact, Lucius Malfoy knew the diary he had which he sneaked into Ginny's bucket belonged to Voldemort, and it had the name Tom Marvolo Riddle on it. So he must have knew his true name. So how many people knew? There must have been stories written about him after he was presumed dead following the murder of the Potters. Surely one newspaper then tried to find out more about who he was and where he came from.   But even after Harry knew, and he presumbly told a few friends, we never hear anyone other than Harry and Dumbledore call him Tom. I understand that Voldemort was his name then, so it made more sense. But how many people really knew the truth about Tom?  For that matter, if the Death Eaters knew he was Tom Riddle, then they must have known he wasn't Pure Blood. There were probably Half Blood Death Eaters too, but wasn't it a bit strange to Pure Blood Death Eaters that they were being led by someone who wasn't? It couldn't have been too big secret, since Dumbledore said he went after Harry and not Neville because Harry was a Half Blood. But was it just Dumbledore who thought of that? Did the Death Eaters know this is why he choose to go after Harry? And again, Lucius had the diary. At the least, he knew his true name. Didn't he ever do any digging? Or was Tom being a descendent of Slytherin himself enough to ignore his Muggle family?  So basically, was it well known that Tom Riddle was Voldemort and did the Death Eaters know he was a Half Blood?

We know that some people were aware of the fact that Lord Voldemort was Tom Marvolo Riddle prior to his return in Goblet of Fire; at the very least his close soon-to-be-Death-Eater "friends" and Albus Dumbledore:  “Very few people know that Lord Voldemort was once called Tom Riddle. I taught him myself, fifty years ago, at Hogwarts..." ... underwent so many dangerous, magical transformations, that when he resurfaced as Lord Voldemort, he was barely recognizable. Hardly anyone connected Lord Voldemort with the clever, handsome boy who was once Head Boy here.” (Professor Dumbledore to Weasleys, Chamber of Secrets, CHAPTER EIGHTEEN, Dobby’s Reward)  and  “Voldemort,” said Riddle softly, “is my past, present, and future, Harry Potter…” He pulled Harry’s wand from his pocket and began to trace it through the air, writing three shimmering words: TOM MARVOLO RIDDLE Then he waved the wand once, and the letters of his name rearranged themselves: I AM LORD VOLDEMORT “You see?” he whispered. “It was a name I was already using at Hogwarts, to my most intimate friends only, of course. ...  (Tom's Diary manifestation in the Chamber of Secrets).  QUESTION: Who - based on canon (books/interviews/pottermore) - knew about the fact that Lord Voldemort was Tom Marvolo Riddle prior to Ginny being taken to the Chamber of Secrets? Obviously, Albus Dumbledore and Tom himself. Who else?


I have a list of dictionaries in python, for example  [{'a':3, 'b':4, 'c':5, 'd':'6'}, {'a':1, 'b':2, 'c':7, 'd':'9'}]   I want to sort it based on the value of 'c' in descending order. I tried using sorted() method using key = lambda but no help.  Any ideas??

I have a list of dictionaries and want each item to be sorted by a specific value. Take into consideration the list: [{'name':'Homer', 'age':39}, {'name':'Bart', 'age':10}]  When sorted by name, it should become: [{'name':'Bart', 'age':10}, {'name':'Homer', 'age':39}]


apt upgrade has been stuck at the following for a day or two now:      Q1: What is the best practice for solving this issue?  I've tried Ctrl+C, as recommended here for "gracefully" terminating the process, but it hasn't worked:    Do I follow the second answer instead?    Q2: How can I avoid this in future?  It looks like it's been reported as a bug here:    So how likely is this to happen again?    Edit: Seems like it could be linked to this    although AFAIK I've had Secure Boot disabled for ages  Could an update have re-enabled Secure Boot somehow?

I have an apt-get install process that seems to be hopelessly wedged at the processing triggers for python-support step.  My inclination is to kill it, but in the past, simply kill-ing an apt-get install process has caused me much grief.  (IIRC assorted lock files are left behind, etc.)  Is there a safer way to stop this process?


I was struggling with an image styling:  <img class="2logos" src="logos.png" />  .2logos {width: 166px}   Whatever I tried, it did nothing. Until I removed the digit from the class name. As soon as I named it "logos" instead of "2logos", it worked. I never noted something like this before. Where may the restriction come from? I find this very strange!

What characters/symbols are allowed within the CSS class selectors? I know that the following characters are invalid, but what characters are valid?  ~ ! @ $ % ^ & * ( ) + = , . / ' ; : " ? > < [ ] \ { } | ` #


We want to calculate $\vec{E}$ at a distance $r$ from the center $O$ of a spherical polar coordinate system.   Let the point on the Gaussian surface at which we want to calculate $\vec{E}$ is $P=P(r, \theta, \phi)$.  Applying Gauss's Law we get, $$ \oint_s \vec{E}(r, \theta, \phi) \cdot \hat{n}(r, \theta, \phi) \, ds = \oint_s E(r, \theta, \phi)\, ds = \iiint E(r, \theta, \phi)\, r^2 \sin\theta \, d\theta \, d\phi = \frac{Q_{enc}}{\epsilon_0}.$$  At this stage how do I know that $E$ depends only on $r$; i.e., $E=E(r)$?  Is it possible to give a mathematical proof that $E=E(r)$?

I have, for instance, a problem with a spherically symmetric charge distribution. I deduce here, in order to solve the problem easily, that the corresponding electric field must be symmetric. How is this type of deduction rigorously justified?


We are a family of 4 living in South Africa each with a South African and a British passport. We plan to travel to the UK on holiday and then onto the USA, then back to the UK, and then back to South Africa.  Which passports do you suggest we use entering and exiting each country and are visas necessary to have in our South African passports?  Many thanks.

I am a citizen of two different countries, and have two passports.  How should I use my passports when traveling?


My assumption is that stars have significantly larger volume than black holes. And if they spiraled they would would merge before they had the chance to reach high enough velocities to generate gravitational waves detectable by the current LIGO.  Is this the main reason why we know LIGO detected black holes?  Another idea I had was mass. But if black holes can have masses like 30 solar mass then the stars by which they formed would be at least so massive if not more. Right?

Recent reports claim that the gravitational waves detected by LIGO match up with the signal expected from two black holes merging as predicted by general relativity.  Additionally, the masses of both black holes were estimated. Questions:  How certain are we that the detected of gravitational waves are necessarily from two black holes merging?  Since supermassive black holes are typically at the center of a host galaxy, what happened to the galaxies that contained the two merging black holes?  For example, did their host galaxies merge?    Edit After reading the answers, I understand that the signals detected by LIGO are proof of the validity of gravitational wave generational artifacts as predicted by general relativity.  When additionally gravitational waves, caused by the merger of the supermassive black holes (those which ARE indeed located in the centers of the merging galaxies) will be detected, since mergers of galaxies could be observed by the methods independent of gravitational waves such as registering the fact of the quasar appearance (). Additional questions:  Could someone offer me the historical ASTRONOMY precedent when the second degree of inference (from the mathematical model, being associated with the theory of Physics) was accepted as the discovery of the astronomical object?  Could someone give a reference to trustable scientific publication, with the subject of study being discussion of requirements satisfying claim of astronomical discovery of an astronomical object?  Have independent scientific sources (outside of members of the LIGO team) analyzed methodology and results of the LIGO signal detection, and published their conclusions with regards of what was actually discovered?


Ubuntu Admins, please listen to me.. I have a proposal.  Ubuntu is a very, very good OS. better than windows, but, my pc is very slower, why do not create a Ubuntu for old pc's?   would be a grand idea. Good job guys. And thanks!

What different Ubuntu derivatives are there? And what is special with them?


As I am fairly new to making yoghurt at home I would like to understand the effects that temperatures and time have on the end product in both the initial heating/cooling step and the fermentation step.  So far I have made half a dozen 1.5 litre batches with three different cultures (currently using ABY-1 from CHR Hansen that I was able to buy from the Westcombe dairy in Somerset). I have a Luvelle machine that can ferment at 36C, 38C and 40C from 1 hour to 24 hours.   I want to understand what changes if I experiment with the following:-   When I heat the milk to 85C and hold the temperature I have made some batches with a 10 minute hold and others with a 20 minute hold period and see/feel/taste no difference - will holding at 30 minutes produce a difference? I am currently fermenting for 24 hours at 38C and getting a strong tang/sourness to the yoghurt but what would I expect to get if I reduced the fermentation to 12 hours at 38C...or less? I choose 38C for the fermentation process because it was recommended by the manual that came with the Luvelle machine but what happens if I use 36C or 40C and what length of time would I use?   So generally speaking I want to know more about the initial heating process and what options there are and what the different fermentation temperatures and durations can have on the end results.  Thanks in advance!

Making yogurt at home is a fairly straight-forward process.  Heat milk to 180F (82C), cool that milk to at least 110F (43C), add live cultures, usually in the form of yogurt with said cultures, incubate, then chill.   There are several variables in the process, some of which are: The fat content of the milk (I typically use whole), how long to hold the milk during the initial heat step, how long it takes to cool the milk, the temperature of the incubation step, and the length of time for incubation, to name a few.  While length of time for incubation, and temperature at this stage, clearly contribute to sourness, I am trying to nail down the variable that contributes to a creamy texture.  I'm not referring to breaking or clumping, as described in .  My yogurt comes out smooth.    My initial hypothesis is that holding the milk for a length of time at the initial 180F(82C) (rather than immediately removing from heat and/or chilling) has an impact on final texture. Any thoughts or experience that might inform my hypothesis?


Similar to , how can I indent the chapter*-like entries to the same indent as the numbered chapters? section* work with \KOMAoptions{toc=indentunnumbered}.  The main difference to the other questions concerning indent with unnumbered chapter is related to indexes: The indentation of indexes won’t work with \addchap/\addsec etc.    \documentclass[ngerman,twoside=false,listof=totoc,listof=leveldown]{scrbook} \usepackage{imakeidx} \usepackage[style=archaeologie]{biblatex} \addbibresource{archaeologie-examples.bib} \usepackage{babel} \newcommand\tocgobble[1]{}% <- added \newcommand\tocpageseparator{\footnotesize\,\mbox{---}\,} \newcommand\tocpagenumberbox[1]{\mbox{#1}} \KOMAoptions{toc=indentunnumbered}%indent only for section* !?  \RedeclareSectionCommands[   tocraggedpagenumber,   toclinefill=\tocpageseparator,   tocindent=0em,   tocnumwidth=4em,   tocpagenumberbox=\tocpagenumberbox ]{chapter,section,subsection,subsubsection,paragraph}  \RedeclareSectionCommand[   tocentryformat=\large\scshape,   tocindent=0em,   tocnumwidth=4em,   tocpagenumberbox=\tocgobble ]{part}  \RedeclareSectionCommand[%   tocentryformat=\textbf% ]{chapter}  \makeindex[   intoc,   name=loc,    title={Locations},   columns=3,   ] \indexsetup{%   level=\section*,   toclevel=section,   noclearpage,   firstpagestyle=scrheadings,   headers={\indexname}{\indexname},     } \begin{document}   \nocite{*}   \frontmatter   \tableofcontents   \mainmatter   \part{part}   \chapter{chapter chapter}   \section{section section section}  \section{section section section}  \section{section section section}   \part{part}   \chapter{chapter chapter}   \section{section section section}  \section{section section section}  \section{section section section}   \setcounter{page}{100}   \part{part}   \chapter{chapter chapter}   \section{section section section}  \section{section section section}  \section{section section section}   \backmatter    \part{part} \index[loc]{A location}   \chapter*{Abbildungs-, Tabellen-, Tafelverzeichnis}   \addcontentsline{toc}{chapter}{Abbildungs-, Tabellen-, Tafelverzeichnis}   \listoffigures   \chapter*{\bibname}   \addcontentsline{toc}{chapter}{\bibname}   \printbiblist[%       heading=subbibintoc,%     title={Zeitschriftenabkürzungen}]{shortjournal}   \printbiblist[%     heading=subbibintoc,%     title={Reihenabkürzungen}]{shortseries}   \printbibliography[heading=subbibintoc] \chapter*{Indizes} \addcontentsline{toc}{chapter}{Indizes} \printindex[loc] \end{document}

I am having some issues with the hyperref package. I would like to create a Introduction chapter without a number so I use \chapter*{Introduction} and \addcontentsline{toc}{chapter}{Introduction} because I want it in the table of contents (see example).  But then the link in my PDF viewer gets it wrong and also the automatically created header is no longer correct (see picture). The table of contents shows the right page number (p.1) but the link is also wrong.   What is my mistake here?  \documentclass{scrbook}  \usepackage{hyperref} \usepackage{blindtext} \usepackage{glossaries}   \makeglossaries  \newacronym{eg}{e.g.}{% for example }   \begin{document}   \frontmatter  % abstract before the table of contents \chapter*{Abstract} \addcontentsline{toc}{chapter}{Abstract} \blindtext  \tableofcontents  % chapter with acronyms \cleardoublepage \phantomsection  \printglossary[type=\acronymtype] \addcontentsline{toc}{chapter}{Glossary}  \cleardoublepage \mainmatter   \phantomsection % \chapter{Introduction} % with this everything is correct but I don't want the number \chapter*{Introduction} \addcontentsline{toc}{chapter}{Introduction}  \blindtext  \pagebreak  \blindtext  % first chapter \chapter{Chapter1}  \gls{eg} \blindtext  \pagebreak  \blindtext   \end{document}


If yt is pure random walk the variance Var(yt-yt-k) will (increase, decrease or remains constant) as lag k increases?

The  that is defined as $Y_{t} = Y_{t-1} + e_t$, where $e_t$ is white noise. Denotes that the current position is the sum of the previous position + an unpredicted term. You can prove that the mean function $\mu_t = 0 $, since $$E(Y_{t}) = E(e_1+ e_2+ ... +e_t) = E(e_1) + E(e_2) +... +E(e_t) = 0 + 0 + \cdots + 0$$ But why is it that the variance increases linearly with time? Does this have something to do with it's not “pure” random, since the new position is very correlated with the previous one? EDIT: Now I have a much better understanding by visualizing a big sample of random walks, and here we can easily observe that the overall variance does increase over time,  and the mean is as expected around zero. Maybe this was trivial after all, since in the very early stages of the time series (compare time = 10 with time = 100) the random walkers have not had yet the time to explore as much.


which tikz-package would you recommend to do something like this:    I could imagine how to do the pole shoes and the magnet but i have no idea how to do the coils.  Greetings   Micele

Can I modify the existing tikz coil decoration, so that the downstrokes are not drawn in a certain interval, to produce a picture like this?    Edit: Previous attempts, code and MWE has been moved to or superseded by my own answer.


I just noticed . Along with it, I noticed this:    It seems the system isn't recognizing the link as a link. What gives?

We can click the website mentioned by the users in their profile page. They can enter anything that  be .   But, in  profile page, the website link is not clickable. Why not?


An American passport's RFID chip is broken (it never did work).  I was forced from the machine automated customs lane to your friendly neighorhood customs agent.  Other than this inconvenience, is there any reason to seek a replacement RFID chip (passport)?

My biometric passport inadvertently spent some time under the rain. It's not badly damaged but some sheets are a bit deformed and there are tiny brown spots on the side. I am wondering if there is an easy way for me to determine if the chip is still working. If it does not, can I still use the passport? Which countries require a biometric passport or actually use the data?  Also, how much of a problem can a lightly damaged/worn out passport be? Is it more likely to be an issue in some countries than others?  PS: Right now, I am preparing for a possible trip to the US and since there is still time, I will most likely ask for a (costly, turned out requesting a new one was free, for some reason) new passport just in case but I would be curious to know if that's really necessary or about potential issues in other countries as well. The passport in question is still valid for more than three years, still has many free pages and was issued by a EU country whose citizens are eligible for the visa waiver program.


Let $x_1 =3.$ Prove that $$x_{n+1}=\frac{1}{4-x_n}$$ converges.  The sequence seems to be converging to $1/4$ as the first few terms are $$3,1,\frac{1}{3},\frac{3}{11},\frac{11}{41},\frac{41}{153}, \cdots$$  In order to prove convergence I know I must make use of the definition that a sequence $(x_n)$ converges to $x$ if there exists an $N$ for all $n \ge N \Rightarrow |x_n-x|\lt \epsilon$. But how do I choose $N$ as a function of $\epsilon$? What can I assume? Could someone show me what a proof for this looks like? Thanks.

I would like some advice on how to solve problems like the following: Let $(x_n)$ be a sequence defined by $x_1= 3$ and $x_{n+1} = \frac{1}{4-x_n}$. Prove that the sequence converges.  My strategy is to use the Monotone Convergence Theorem, but I am having trouble showing that the sequence is decreasing and bounded below. Here's my work so far:  Decreasing: The first 4 values are $3,1,1/3,3/11$, so let's assume $x_n \leq x_{n-1} \leq \ldots \leq x_1$. Want to show $x_{n+1} \leq x_n$. We have $x_{n+1} = \frac{1}{4-x_n}$. I want to have an upper bound for the RHS, but can't find one and don't really know where to go from here.  Bounded below: I wanted to show that all values are positive, but if we assume $x_n > 0$, that doesn't rule out $x_{n+1}$ from being negative.


I seem to have confused a lot of people with this question so let me state what I want to do as simply as I can.  I want to search a text string for words that begin with "mak", "mind" and "mass" and end with either nothing extra or "e" or "er". That would be "mak", "make", "maker", "mind", "minde", "minder", "mass", "masse", "masser".  I am trying to match certain words in a text if they start with specific letters and end with specific letters. I am using the following regex:  aray = ['mak','mind', 'mass']; for(i=0; i < aray.length; i++){     searchTerm = new RegExp(         "\\b" + aray[i] + "\\b|" +         "\\b" + aray[i] + "en\\b|" +         "\\b" + aray[i] + "er\\b");     word = testText.match(searchTerm, "gi"); }   The problem is that when the first instance is matched the other instances are not searched for. Could someone point me in the right direction. Any help would be greatly appreciated.  This question has been flagged as a duplicate but the other question does not answer the points I am having difficulties with.

Obviously, you can use the | (pipe?) to represent OR, but is there a way to represent AND as well?  Specifically, I'd like to match paragraphs of text that contain ALL of a certain phrase, but in no particular order.


Can anyone help me？ O(∩_∩)O  Today I meet a question that I want to use a program maybe a player and I need log the data(BCI EEG) from the user.So I try to use the Process Class to Start a ConsoleApplication in an WindowsApplication.  I create a Simple WindowsApplication to have a try my idea. But it not works,I also try to use the Process Class to Start other Application It' Ok.When I Start my own program that is a ConsoleApplication it not works.    public partial class Form1 : Form  {     Process myProcess = new Process();      public Form1()     {         InitializeComponent();     }      private void button1_Click(object sender, EventArgs e)     {         myProcess.StartInfo.UseShellExecute = false;         // You can start any process, HelloWorld is a do-nothing example.         myProcess.StartInfo.FileName = "D:\\EEG\\Emotiv Xavier TestBench v3.0.0.41\\EmotivXavierTestBench.exe";         myProcess.StartInfo.CreateNoWindow = true;         myProcess.Start();          //System.Console.WriteLine("Hello World!");         //MessageBox.Show("button1.Click was raised.");     }   This TestBench program can open .But why the program I create doesn't work? D:\temp\EmotivConnection\Debug\EmotivConnection.exe

How do I start a process, such as launching a URL when the user clicks a button?


For example, Debian repository uses links without HTTPS: deb http://deb.debian.org/debian buster main deb-src http://deb.debian.org/debian buster main  deb http://deb.debian.org/debian-security/ buster/updates main deb-src http://deb.debian.org/debian-security/ buster/updates main  deb http://deb.debian.org/debian buster-updates main deb-src http://deb.debian.org/debian buster-updates main  How is it checked that loaded data from the repository is correct and have not been replaced? Checksum (SHA256) is transmitted by encrypted compound and is compared with the downloaded data via HTTP from the repository?

What security systems and processes are in place to prevent malicious third parties from hacking/compromising the security of code in the Debian mirrors, or to verify that the packages we get are in fact the ones the maintainers think they are?


While programming I often have naming questions, such as "how do I name [thing]  in a descriptive but succinct way? Is there already an accepted terms for this/an alternative to [name]?" (Thing could be a programming concept, a function, a class, a variable)  Is Stack Overflow the right place to ask these naming/semantics questions?  I would like to be able to get meaningful answers, not just "Name it [name] and call it a day."

Stuff like polls, recommendations based on subjective constraints, puzzles, webcomics etc. do not belong on the serious main SE sites, where professionals should be considered at work and having just a few spare minutes ("code's compiling") to answer questions, so they should not be distracted by such things. However, I'd also like to have a home for these things still using the SE engine. For the reason I mentioned before, this needs to be a separate place though. Let's call it four.[sitename-here].com.


Why are dividends generally seen as a good thing for investors?  For example, you can look at  where it states Broadcom (ticker: AVGO) plans to boost its quarterly dividend by 51%, a piece of good news for investors in a company whose shares have lagged behind the market this year.  How exactly is this good news for investors? When the company issues the dividend, won't the stock price drop by the proportional amount since the company is losing that much cash (the cash that they're giving out as dividends)? This should be neutral news as Investors aren't really making/losing any money from this?  If anything, this might be bad news, since it shows the company Broadcom has nothing they deem worth investing in.  Thanks.

Imagine a mature company, which has stable earnings and made a profit this year. The company is planing to pay out a part of this earnings to its shareholders. Assuming the stock price goes down exactly what is paid out per share the shareholders wealth doesn't change.  Now a few weeks later the company decides to start a new project, for which it needs to borrow money (because it paid out its excess returns) and therefore pay some interest for this borrowed money. Even when it would not do any investments it could lend the excess money to someone else and earn a little interest on that.  When the company doesn't pay a dividend the money stays within the company and therefore the company is worth more, which will be reflected in the share price (assuming efficient markets). So when the shareholders need money they could sell some of their (higher priced) stocks.  As we see from the example above the company can either choose to pay out the money and earn nothing, or keep the money and use it for investments or earn some interest on it. The company has an (opportunity) cost by paying out dividends, and is therefore not the optimal choice to do so.  Also if we assume that the increase in the share price is generally taxed as a capital gain, and capital gains are often taxed at a lower rate than income in the case of dividends.  So my question is: Why does it make sense, from a economically rational point of view, assuming both the company and also the investors want to maximize the shareholders value, to pay out a dividend?


Where do I get a CSV file containing (a reference to) all Wikipedia articles with lon/lat coordinates?  I am aware of  which refers to this page:   At one time that page offered a CSV download but it is no longer present, only the option to download a PostGIS data dump.  I prefer to get the dewiki geolocations

I'd like to add icons to my map showing locations which have Wikipedia entries.  The  is a great resource for determining Wiki entries near an XY location, but it has limitations (20km radius, 50 points only) which make it unsuitable for my purposes.  Ideally I need the map to show ALL locations with Wiki entries, so I guess I'll need to download the Wikipedia dump file and parse it for geocoded entries.  Where is this information found in the Wikipedia dump files?  The Wiki database may be downloaded from  but I can't see which file(s) I need to search for the coordinates.  For example, the  includes:  Coordinates:    33°51′35.9″S 151°12′40″E   Where is this found in the dump files? Another way to phrase the question is "how can I determine which Wiki entries are geo-coded?"


Hey everyone Im whiping out Ubuntu and going back to windows 7. Im currently formating my main partion of 120gb and im wondering what partion type it should be? thanks  I booted the windows installer and it said that it cannot be installed on that drive, I deleted those partions made one big one and will try again

I have absolutely no experience with Linux, and I desperately need to get my computer back up and running again with Windows.  How do I remove Ubuntu and reinstall Windows?    Editor's note: many of the answers are about removing Ubuntu from dual-boot but keeping Windows (which is a bit complicated), while other answers are about removing Ubuntu from single-boot (which is easy: basically just format the disk while installing Windows). The question as written is ambiguous between dual-boot or single-boot.


If $\gcd(m,n) = 1$, show that $m^{φ(n)} + n^{φ(m)} ≡ 1 \mod {mn}$   The only similar problem I found to this in my notes was "Find all positive integers $n$ such that $φ(n) = 12$." Unfortunately this was no help and I'm really lost, any help is really appreciated.

I do not know how to prove this question: $m^{\phi(n)}+n^{\phi(m)}\equiv 1 \pmod {mn}$ where $m$ and $n$ are relatively prime.  Can anyone help?


I was following to install openstack on ubuntu   But I am getting the repository not found error  W: Failed to fetch http://ppa.launchpad.net/cloud-installer/testing/ubuntu/dists/precise/main/source/Sources  404  Not Found  W: Failed to fetch http://ppa.launchpad.net/cloud installer/testing/ubuntu/dists/precise/main/binary-amd64/Packages  404  Not Found   I tried to access these repositories manually but not getting anywhere  It seems like that these packages are moved or deleted from the website  Thanks

PPA seems to be constantly offline. Whenever I use sudo apt-get update, this error is shown:  W: Failed to fetch http://ppa.launchpad.net/ 404  Not Found   How do I fix these errors?


I've read that the Pauli's exclusion principle can be explained because the wave function of fermions (half-interger spin) change sign when you permute two arguments and that this makes it impossible to have two equal states, which in bosons (integer spin) doesn't happen. But why is it the spin that makes this difference? Is the Spin-Statistics theorem another approach or the same?

It seems to be related to , but I can't penetrate the Wikipedia article. What has the Pauli exclusion principle to do with indistinguishability?


I'm using the Bloom filter and Funnel classes in Guava. Rather than adding the JARs individually, I added a dependency on Guava using Maven.  When I used the Bloom filter class originally, it had no issues. But when I started using the Funnel class (in the same file with the same dependency section, classpath, etc.) I get the errors     java.lang.NoClassDefFoundError: com/google/common/hash/Funnels    and      java.lang.ClassNotFoundException.

I am getting a NoClassDefFoundError when I run my Java application.  What is typically the cause of this?


I am trying to perform a density analysis of a point shapefile on ArcMap. I am unsure of what to insert for population field. I've tried the actual number of people in the census tract where my point is and also tried adding a column to insert count (of points), so that each point has a count of 1. I have also left it as None. Neither works.  I get 2 types of errors:   all input points are identical errors in executing grid expression

My eventual goal is to automate kernel density calculations for a large corpus of point data; however, if all points are identical (for example, if there are 7 points all stacked on top of one another because they have the same long/lat values), the  in arcpy will not work. It will result in the following error:  "Error 010246: All input points are identical A valid window must be specified"   Since this will be an automated process, I need a way to check the points in the current input to be sure they aren't all the same using python/arcpy. Is there a way to do that?   EDIT: I specified a grid size and an extent, so a lot of the errors are fixed; however, identical points still give me the "valid window must be specified." I have tried to use the FindIdentical function to look for identical points, but this returns a DBF file, that I cannot read in the script. Is there some way to read a DBF easily in python, or can I find if all points are identical in another way?


states that $$ \sum_{k=0}^{r} {m \choose k}{n \choose r-k} = {m+n \choose r} $$ I wonder if we can use this formula or otherwise to calculate: $$ \sum_{k=0}^{r}k^l {m \choose k}{n \choose r-k}, l \in \mathbb{N} ?$$ or if not,  at least when $l=1,$ namely: $$ \sum_{k=0}^{r}k {m \choose k}{n \choose r-k}?$$ I'd appreciate the relevant calculations or some links where I can find the above?

Consider the following problem:  We have a collection of m white and n black balls. We pick k balls (k ≤ m+n) without replacement. What is the expected number of white balls in the sample?  Counting method 1: The ratio of white balls in the collection is m/(m+n). If we repeatedly sample the collection, we expect that on average, our sample has the same ratio. Therefore, the expected number of white balls in a sample of size k is km/(m+n). As a side note, I think the above argument somehow depends on the unbiasedness of  the mean estimator. Am I right?  Counting method 2: We directly compute the expected number of white balls in the sample: $$ \frac{\sum_{i=0}^{k} i\binom{m}{i}\binom{n}{k-i}}{\binom{m+n}{k}} \enspace.$$  So, we reach at the identity: $$ \sum_{i=0}^{k} i\binom{m}{i}\binom{n}{k-i} = \frac{km}{m+n}\binom{m+n}{k} \enspace.$$  How to prove the above result without double counting? It seems to be provable using  as well as $i\binom{m}{i} = m\binom{m-1}{i-1}$. But is there a simpler approach (which does not depend on extra identities such as Vandermonde's)?


Recently I installed, in dual boot, Windows 10 and Ubuntu. I installed Windows on my 120 GB SSD. I use my 500 GB HDD for Windows storage and also installed Linux there. Every time I boot in Ubuntu, there's a pop up that says "disk is likely to fail soon". I run smartctl and get .  I'm a newbie and i don't know what to do. Is my disk really damaged?

I have a dual boot of Windows 10 and Ubuntu 16.04. Recently I upgraded it to 18.04. As soon as I did it, it started showing DISK IS LIKELY TO FAIL SOON (37° C / 99° F).    I checked the status of my disk via Windows and it shows it’s perfectly healthy. I assumed the error occurred because my partition size of Ubuntu was 64GB (which I now increased to 86GB). Please help me out with this.    Edit: The results of smartctl - attributes


Which is correct?  "When quality and integrity matter..." or "When quality and integrity matters..."?

I am having trouble with the following sentence:      "The complexity and diversity of the new platforms is worrying us."   If "complexity" and "diversity" constitute two subjects, then the verb should presumably be "are"; however, the sentence feels more natural with "is". Is this correct? Is there a linguistic term for this occurrence?    The following questions address the general topic of compound subjects, but not specific cases like this:             And the following question seems to have somewhat inconclusive answers:         So this question is not really a duplicate of these three.


Prove or disprove the following:  For all integers a, b, and c, if ab | c then a | c and b | c  I'm having trouble proving the above. It seems to be obviously true in my head (but only because of all the examples I can think of), but I'm having trouble proving it.

I'm working on my Discrete Mathematics homework and they are asking me this:  Prove or show a counterexample for: $\forall a, b, c \in \mathbb Z$, if $ab\mid c$ then $a\mid c$ and $b\mid c$  I'm not completely sure how to prove it. I was thinking to find a counterexample like zero but I'm not sure if that it's going to work. Or maybe try to approach it backwards?   I'm a little bit lost


I am trying to track SQL Server metrics using Prometheus by querying the system dynamic management views. I am looking into the Buffer Manager: Page reads/sec counter in sys.dm_os_performance_counters, which I understand to be a rate at which reads are happening, aggregated over an [unspecified] amount of time, based on the description in the :  Indicates the number of physical database page reads that are issued per second. ...  However, I have tracked the query for 8 databases (with differing SQL Server versions: 2012, 2017, 2019) over 12 hours, and the counter value for all of them seems pretty high (16K+ for a development database with no traffic, 700K+ for a production database with very little traffic). Also, the values are not changing, or rather, are not changing very much (+/-200 page reads) and very infrecquently (once for each database over a 12 hour period). This leads me to believe that this counter may actually not be a rate but a total count over time that must be converted into a rate by aggregating the values and comparing with the previous value. If I select the metric from Performance Monitor, it shows the rate as 0, which seems to confirm my suspicion. Is this correct? And if so, is this the case for all of the /sec counters? For reference, this is the query I'm using to retrieve the counter. select cntr_value from sys.dm_os_performance_counters where object_name = 'SQLServer:Buffer Manager' and counter_name = 'Page reads/sec';

I have verified through SQL Server Profiler that my request per-second are around 30 request/s as is corroborated by SSMS Activity Monitor but sys.dm_os_performance_counters is reporting hundreds of millions/s.  Any idea what might be causing this gross discrepancy?  Query:  SELECT     RTrim(LTrim(object_name)) as object_name,     RTrim(LTrim(counter_name)) as counter_name,     cntr_value FROM     sys.dm_os_performance_counters  WHERE      instance_name IN ('', '_Total')     and counter_name IN (         N'Batch Requests/sec'         , N'SQL Compilations/sec'         , N'SQL Re-Compilations/sec'         , N'Transactions/sec')   Results:  object_name counter_name    cntr_value SQLServer:Databases Transactions/sec    191721399 SQLServer:SQL Statistics    Batch Requests/sec  242955426 SQLServer:SQL Statistics    SQL Compilations/sec    42048371 SQLServer:SQL Statistics    SQL Re-Compilations/sec 1200947


Is there a way to get an average polygon of unioned stack of polygons in ArcGIS 10.0? I would like to get an average polygon that would be centroid (but polygon) of whole stack of polygons.

I found  in the old ESRI forums with the same type of problem I am facing today. The solution to the problem is explained in little detail and since I am not an expert, I was wondering if somebody could describe it to me in little more detail.  We are doing a mental map analysis. We have let's say 50 polygons of a certain city square which are all different in shape, size and location. Our goal is to create a single polygon which would represent the answers from our whole input data. So basically, we need a method for generating a single polygon out of these 50 which would be an "average" polygon in size, shape and location.  Can somebody explain the process?


Two related questions:  I think atm I feel that the best and easiest way to avoid widows and orphans is to let the affected pages differ a little in size. Almost no one would recognise it and -- even if -- it might look better than having empty space because of breaking the page earlier to get yet another line on the next page etc.   So what are the arguments against this approach? Notwithstanding these arguments, how could I automatically achieve it? Maybe even by a global command in the preamble?

During the last phase of layout I frequently get a single line or two on a separate page. Rather then pulling the whole paragraph on that last page I would like to "squeeze" the lines on the previous page a bit.  Is there a way to mark the current page to be squeezed a bit if necessary, but let LaTeX reset this marking automatically after the page is done?


Say:       $f'(x) = e^{-x^2}.$   Then, what is $f(x)$ ?  I ask this because I heard:       $$\int_{-\infty}^{\infty} e^{-x^2}\, dx=\sqrt{\pi}.$$   Thus curious about $f(x),$ but can't figure out it on my own, though tried.

Today in my calculus class, we encountered the function $e^{-x^2}$, and I was told that it was not integrable.  I was very surprised. Is there really no way to find the integral of $e^{-x^2}$? Graphing $e^{-x^2}$, it appears as though it should be.   A  on Gaussian Functions states that   $$\int_{-\infty}^{\infty} e^{-x^2} dx = \sqrt{\pi}$$  This is from -infinity to infinity. If the function can be integrated within these bounds, I'm unsure why it can't be integrated with respect to $(a, b)$.  Is there really no way to find the integral of $e^{-x^2}$, or are the methods to finding it found in branches higher than second semester calculus?


I tried to find information about the operator order in the statement >&/dev/null  Is there any difference between >& and &>?

Just wondering if there is any difference between:    echo "running the npm patch" >&2;   and   echo "running the npm patch" &>2;   I have actually never really understand that syntax.


I just came across an article regarding submitting app to Ubuntu Software Center    I'm currently maintaining a open source stock market software. I would say around 80% are Windows users, although the software itself can be executed in Linux too.  I would like to increase adoption of Linux users. Hence, distributing the software in most popular Linux distro will definitely help.  I was wondering, whether a pure Java written software will be accepted in Ubuntu Software Center? It requires JRE6 and above.

I am writing an app using JAVA Swing for all platforms. After that I want to add this app to Ubuntu Software Center for free Is it possible?   My app is just one *.jar file, its helping to play card games.  I dont know Python language and saying the truth - dont want to learn it now.  What should I do to be able to submit my app?


Let $G$ be a finite group of order $pq$, where $p,q$ are distinct prime numbers. Show that $G$ is not simple.  Here is my attempt:  $|G|=pq$. If $G$ is not simple, then it has non-trivial subgroups, i.e., subgroups other than the identity and itself.   Let $H$ be a subgroup of order $p$. By Lagrange's Theorem, $|H| \mid |G| \Rightarrow p \mid pq$. Similarly, let $K$ be a subgroup of order $q$ so that $|K| \mid |G| \Rightarrow q \mid pq$. Hence, $G$ is not simple.  I was hoping somebody could verify my proof and point out any errors. As always, any help or advice is greatly appreciated.

Is the following correct way of showing that there is no simple group of order $pq$ where $p$ and $q$ are distinct primes?  If $|G|=n=pq$ then the only two Sylow subgroups are of order $p$ and $q$.  From Sylow's third theorem we know that $n_p | q$ which means that $n_p=1$ or $n_p=q$.  If $n_p=1$ then we are done (by a corollary of Sylow's theorem)  If $n_p=q$ then we have accounted for $q(p-1)=pq-q$ elements of $G$ and so there is only one group of order $q$ and again we are done.  Is that correct?


I am trying to /give a player an enchanted sword using commands, but it isn't working. This is the command: /give @p diamond_sword 1 0 {ench:[{Id:16,lvl:1}]}   No matter what I try, it insists that there is a missing “}” or object member name. How can I fix this issue?

This question was recently split into different questions for each workaround. See   meta posts for more information.   Can you use NBT tags in commands? I’ve tried commands that normally work in Java Edition like: give @s minecraft:planks 30 1 {display:{Lore:["Wooden planks"]}} give @s stone_pickaxe{Unbreakable:1b} give @s item_frame{EntityTag:{Invisible:1b}} summon villager ~ ~ ~ {Offers:{Recipes:[{buy:{id:"emerald",Count:5b},sell:{id:"diamond_sword"}}]}} summon tnt ~ ~ ~ {Fuse:20s}


For some reason, I'm trying to transfer a simple 0KB file from one system to the next using SCP and it's just hanging at 100%. I've enabled the -vvv flags but still have no idea what this verbose output even means. Here's what it looks like after it hits 100%:  debug2: channel 0: written 23 to efd 6 test.txt                                                                                100%    0     0.0KB/s   00:00 debug2: channel 0: read<=0 rfd 4 len 0 debug2: channel 0: read failed debug2: channel 0: close_read debug2: channel 0: input open -> drain debug2: channel 0: ibuf empty debug2: channel 0: send eof debug3: send packet: type 96 debug2: channel 0: input drain -> closed debug3: receive packet: type 98 debug1: client_input_channel_req: channel 0 rtype exit-status reply 0   I've tried to restart the remote SSH server as well, but that didn't work. It's just running a fresh installation of Kali Linux with no modifications.  Any idea why this may be happening and how to resolve this problem? It's definitely not the client becuse I just uploaded the same file to another system via SCP, but I'm not sure what's going on with the server that would cause this.

I've been experiencing very strange behavior of SCP for some time: whenever I try to copy a file, the output of SCP contains a bunch of underscores and the file is not copied.  $ scp test.txt 192.168.0.2:~ job@192.168.0.2's password:   ________________________________________   When I create an SSH connection using Midnight Commander and copy files it does work.  Some info about my machine:  $ ssh -V OpenSSH_5.8p1 Debian-1ubuntu3, OpenSSL 0.9.8o 01 Jun 2010  $ uname -a Linux squatpc 2.6.38-10-generic #46-Ubuntu SMP Tue Jun 28 15:05:41 UTC 2011 i686 i686 i386 GNU/Linux   And I'm running Kubuntu 11.04.  Edit: Some more info as requested by the comments:  $ scp -v test.txt 192.168.0.2:~ Executing: program /usr/bin/ssh host 192.168.0.2, user (unspecified), command scp -v -t -- ~ OpenSSH_5.8p1 Debian-1ubuntu3, OpenSSL 0.9.8o 01 Jun 2010 debug1: Reading configuration data /etc/ssh/ssh_config debug1: Applying options for * debug1: Connecting to 192.168.0.2 [192.168.0.2] port 22. debug1: Connection established. debug1: identity file /home/job/.ssh/id_rsa type 1 debug1: Checking blacklist file /usr/share/ssh/blacklist.RSA-2048 debug1: Checking blacklist file /etc/ssh/blacklist.RSA-2048 debug1: identity file /home/job/.ssh/id_rsa-cert type -1 debug1: identity file /home/job/.ssh/id_dsa type -1 debug1: identity file /home/job/.ssh/id_dsa-cert type -1 debug1: identity file /home/job/.ssh/id_ecdsa type -1 debug1: identity file /home/job/.ssh/id_ecdsa-cert type -1 debug1: Remote protocol version 2.0, remote software version OpenSSH_5.8p1 Debian-1ubuntu3 debug1: match: OpenSSH_5.8p1 Debian-1ubuntu3 pat OpenSSH* debug1: Enabling compatibility mode for protocol 2.0 debug1: Local version string SSH-2.0-OpenSSH_5.8p1 Debian-1ubuntu3 debug1: SSH2_MSG_KEXINIT sent debug1: SSH2_MSG_KEXINIT received debug1: kex: server->client aes128-ctr hmac-md5 none debug1: kex: client->server aes128-ctr hmac-md5 none debug1: sending SSH2_MSG_KEX_ECDH_INIT debug1: expecting SSH2_MSG_KEX_ECDH_REPLY debug1: Server host key: ECDSA 28:f3:2b:31:36:43:9b:07:d8:33:ca:43:4f:ca:6c:4c debug1: Host '192.168.0.2' is known and matches the ECDSA host key. debug1: Found key in /home/job/.ssh/known_hosts:20 debug1: ssh_ecdsa_verify: signature correct debug1: SSH2_MSG_NEWKEYS sent debug1: expecting SSH2_MSG_NEWKEYS debug1: SSH2_MSG_NEWKEYS received debug1: Roaming not allowed by server debug1: SSH2_MSG_SERVICE_REQUEST sent debug1: SSH2_MSG_SERVICE_ACCEPT received debug1: Authentications that can continue: publickey,password debug1: Next authentication method: publickey debug1: Offering RSA public key: /home/job/.ssh/id_rsa debug1: Authentications that can continue: publickey,password debug1: Trying private key: /home/job/.ssh/id_dsa debug1: Trying private key: /home/job/.ssh/id_ecdsa debug1: Next authentication method: password job@192.168.0.2's password:  debug1: Authentication succeeded (password). Authenticated to 192.168.0.2 ([192.168.0.2]:22). debug1: channel 0: new [client-session] debug1: Requesting no-more-sessions@openssh.com debug1: Entering interactive session. debug1: Sending environment. debug1: Sending env LANG = en_US.UTF-8 debug1: Sending command: scp -v -t -- ~  ________________________________________ debug1: client_input_channel_req: channel 0 rtype exit-status reply 0 debug1: channel 0: free: client-session, nchannels 1 debug1: fd 0 clearing O_NONBLOCK debug1: fd 1 clearing O_NONBLOCK Transferred: sent 2120, received 1872 bytes, in 0.3 seconds Bytes per second: sent 7783.1, received 6872.6 debug1: Exit status 0   and  $ type scp scp is hashed (/usr/bin/scp)


I have looked at different threads but couldn't find a proper solution. I want to make a fake html file which fills a form automatically and submits when it is loaded by the browser.  The two input fields maks and reciever are filled by the values I have given, but I need to press submit. And if possible it could be nice if the values of the input fields are invisible. Thank you.  <html xmlns="http://www.w3.org/1999/xhtml">   <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />    <head>     <script type="text/javascript">       function postReq() {         var frm = document.getElementById('post_req');         if (frm) {           frm.submit();         }       }     </script>    <body onload="postReq()">     <form method=POST name=exampleform id='post_req'        action="/ex/makfoer.php">       <input name=maks type=hidden value="2" />        <input name=reciever type=hidden value="otto" />       <input type=submit />     </form>   </body>  </html>

I'm trying to direct a browser to a different page. If I wanted a GET request, I might say  document.location.href = 'http://example.com/q=a';   But the resource I'm trying to access won't respond properly unless I use a POST request. If this were not dynamically generated, I might use the HTML  <form action="http://example.com/" method="POST">   <input type="hidden" name="q" value="a"> </form>   Then I would just submit the form from the DOM.  But really I would like JavaScript code that allows me to say  post_to_url('http://example.com/', {'q':'a'});   What's the best cross browser implementation?  Edit   I'm sorry I was not clear. I need a solution that changes the location of the browser, just like submitting a form. If this is possible with , it is not obvious. And this should not be asynchronous, nor use XML, so Ajax is not the answer.


This simple program compiles without any issue and equality assertion is evaluated as true. fn main() {     let celsius_temp: f64 = 23.0;     let fahrenheit_temp: f64 = celsius_to_fahrenheit(celsius_temp);      assert_eq!(fahrenheit_temp, 73.4);     println!("Test passed!"); }  fn celsius_to_fahrenheit(celsius_temp: f64) -> f64 {     (celsius_temp * 1.8) + 32.0 }  However, if I use instead of f64 a data type of f32, Rust compiler panics and assertion is false. It gives me a following message: thread 'main' panicked at 'assertion failed: (left == right) left: 73.399994, right: 73.4' Why does it work with f64 and not with f32? I am not using here large numbers.

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


When a mystery is too overpowering, one dare not disobey.   This is a sentence from . I am not sure why dare is in the infinitive, not the third person singular? Is it because that it is somewhat like one should dare not disobey?

To my surprise, there's a missing question about this particularly interesting verb, dare. All I know about it is the fact it can be in two forms, as an auxiliary (without to: "I dare not mention their names") and main (with to: "Did anyone dare to admit it?") verb and the difference has something to do with agreeing with subject. Can somebody explain in a greater detail?


With composite we can use the results from a previous operation in the next operation by using the @{ref.records[0].} syntax as so:  {   "compositeRequest": [   {     "method": "GET",     "url": "/services/data/v46.0/query?q=select+Id+,name+from+account+limit+2",     "referenceId": "ref1"   },   {     "method": "GET",     "url": "/services/data/v46.0/sobjects/Account/@{ref1.records[0].Id}",     "referenceId": "ref2"   } }   My question, is there some sort of syntax that can enumerate the results from ref1 and pass all the Id's to a subquery in ref2? Something like so:  {   "method": "GET",   "url": "/services/data/v46.0/query?q=select+Id+,name+from+account+where+Id+in+(@{ref1.records.ITERATE_ALL_IDs})",   "referenceId": "ref2" }   The reason being that ref1 could return a variable amount of records so explicitly referencing each item in the array is not feasible.  This could be accomplished using two API calls where the first one retrieves the Id's and the second one uses those Id's but I would prefer to do this in the same composite API call.

I am using Salesforce's REST API to (1) retrieve a list of object IDs according to a query, then (2) retrieve the records that correlate to those IDs.  I am familiar with the Salesforce composite documentation .    My request looks like this:  POST: /services/data/v48.0/composite  {     "allOrNone":false,     "compositeRequest": [ {         "method":"GET",         "url": "/services/data/v48.0/query?q=SELECT+Id+FROM+My_Entity+WHERE+(CreatedById+!=+'asdfghjkl')",         "referenceId": "myEntity"         },{         "method":"GET",         "url": "/services/data/v48.0/composite/sobjects/My_Entity?ids=@{myEntity.records[0].Id}",         "referenceId":"myObject"     }] }   My response:  {     "compositeResponse" : [ {         "body" : {             "totalSize" : 21,             "done" : true,             "records" : [ {                 "attributes" : {                     "type" : "My_Entity",                     "url" : "/services/data/v48.0/sobjects/My_Entity/a0D6g000xxxxxxx"                 },                 "Id" : "a0D6g000xxxxxxx"                 }, {*record2*}, {*etc*}             ]},             "httpHeaders" : { },             "httpStatusCode" : 200,             "referenceId" : "myEntity"         }, {         "body" : [ {         "errorCode" : "PROCESSING_HALTED",         "message" : "'myEntity.records' references an invalid Datatype. Only Strings and primitive data types are allowed to be referenced from previous operations."         } ],         "httpHeaders" : { },         "httpStatusCode" : 400,         "referenceId" : "myObject"     } ] }   The first subrequest (the query) executes without errors.  My problem is the second subrequest.  I understand from  that I can refer to the ID of a single item (e.g. myEntity.records[0].Id).  Question: How do I use all items from myEntity.records in the second subrequest?


I wrote a paper with my colleagues at my alma mater, fresh graduated from my undergraduate degree. At that time I had no University Affiliation. Now I'm studying a Masters in ANOTHER university, should I put this new Institution as my Affiliation? or none?

I began working on a paper during my undergraduate degree in the summer of 2014. I continued to work on the same paper into summer 2015, at which time I graduated and moved to a different university to pursue a graduate degree. However, all experiments failed and my collaborators and I were unable to produce any meaningful results. In fall 2015, while enrolled in graduate studies at the second university, I realized that the question at the centre of this paper could be answered using a completely different method. I contacted my collaborators and we have been able to produce some great results.   Now I am writing the paper and wondering what I should list as my affiliation, since the project was begun at one university but overhauled and completed at another. I see four options:    The old university The new university Both the old and new universities The old university, with a “present address” note    What is standard practice in a situation like this, where work is begun in one lab but completed in another? Does the re-design of the project from the second university complicate the issue?


Problem Statement:     Let $G$ be a finite group, say a group with $n$ elements, and let $S$ be a nonempty   subset of $G$. Suppose $e \in S$, and that $S$ is closed with respect to multiplication. Prove   that $S$ is a subgroup of $G$. (HINT: It remains to prove that $G$ is closed with respect to   inverses. Let $G = \{a_1, \ldots ,a_n\}$; one of these elements is $e$. If $a_i \in G$, consider the distinct elements $\{a_ia_1, a_ia_2, \ldots a_ia_n\}$.   Incomplete Solution:  Let $G = \{a_1, \ldots, a_n\}.$ Let $a_i \in G.$ Then any number of $a_ia_1, a_ia_2, \ldots, a_ia_n \in S,$ since $S$ is closed under multiplication. One of those $a_ia_j$ is $e$ since $e \in S.$ Then either $(a_i)^{-1}$ or $(a_j)^{-1} \in S.$  To complete the proof I was told:     You need to argue why one of them must be $e$. Show $f(x)=a_i \cdot x$ is an injection, then since it's a map from a finite set to itself that implies it's also a surjection.   Let $a_i \cdot x = a_i \cdot y$. Then $x = y$. So, $f$ is injective. Not too sure if that's correct, but I have a follow up question:  For $x = 1, 2, 3, \ldots, n$; $f(x) \in \{a_i, a_i \cdot 2, a_i \cdot 3, \ldots  a_i \cdot n\}$. So, $f: \{1, 2, 3, ..., n\} \to \{a_i, a_i \cdot 2, a_i \cdot 3, ..., a_i \cdot n\}$. Is that correct? If so, how do we know $f$ maps from a finite set to itself?

Let $G$ be a finite group, say a group with $n$ elements, and let $\emptyset \neq S \subseteq G$. Suppose $e \in S$, and that $S$ is closed with respect to multiplication. Prove that $S$ is a subgroup of $G$.    Let $G = \{a_1, \ldots, a_n\}.$ Let $a_i \in G.$ Then any number of $a_ia_1, a_ia_2, \ldots, a_ia_n \in S,$ since $S$ is closed under multiplication. One of those $a_ia_j$ is $e$ since $e \in S.$ Then either $a_i$ or $a_j$ is $a^{-1}.$ Would this argument work?


Is some kind of signal emitted when an earphone/headphone is plugged in? I want detect when they are plugged in and run a script accordingly.

I am trying to detect a signal when a headphone is connected or disconnected from the system.  What is the best way to do this?  If there is a special board with drivers, that will be my preferred way.


In fallout 4 on the ps4 I have been finishing up on a original 3X3 house that holds up to 15 beds each floor (thats if you really dont want to  get though the door once its built). This desing however is designed to go infinite floors (each floor being 1 wall high). I was wondering if there is a hight limit for how many floors you can place so I know before I go resource farming so I can make a rough estimate for how much wood steel and cotton I will need.

See title. Obviously the maximum base is determined by the perimeter, but the maximum height is not specified.


I have seen this " | " in some commands on the Linux shell but I don't know what it means in general.  For example, when I run jobs on a shared cluster which uses PBS job scheduler, I can check where the job running is with this command:   qstat -j <jobid> | grep cwd   I want to know the more general meaning of | so I can apply it elsewhere when it's applicable, instead of just learning by heart the commands when I see others using it.   Thank you in advance. :)

Example: In a Terminal command xdpyinfo | grep resolution (that I have taken from an answer), does the | character mean that the xdpyinfo output shall be sent to the grep program input for printing a line containing the resolution string? Where should I seek for such an information to avoid filling this forum by too simple questions? Thanks.


The present question follows on from some other questions on this site asking how to generate uniform points inside a disc (see e.g., ,  and ).  The natural extension of that problem is to generate points inside an $m$-dimensional   with centre $\mathbf{c} \in \mathbb{R}^m$ and radius $r \geqslant 0$.  That is, we want to generate IID random variables from the following distribution: $$\mathbf{X} \sim \text{U}(\mathcal{B}(\mathbf{c},r)) \quad \quad \quad  \mathcal{B}(\mathbf{c},r) \equiv \Big\{ \mathbf{x} \in \mathbb{R}^m \Big| ||\mathbf{x} - \mathbf{c}|| \leqslant r \Big\}.$$ How do we generate IID uniform points on this space?  Is there a simple way to program this?

I was attempting to simulate injection of random points within a circle, such that any part of the circle has the same probability of having a defect.  I expected the count per area of the resulting distribution to follow a Poisson distribution if I break up the circle into equal area rectangles.    Since it requires only placing points within a circular area, I injected two uniform random distributions in polar coordinates: $R$ (radius) and $\theta$ (polar angle).  But after doing this injection, I clearly get more points in the center of the circle compared to the edge.     What would be the correct way to perform this injection across the circle such that the points are randomly distributed across the cirlce?


How to get rid of that vertical space between caption titles? (space between the second line and the third line).   The figures come from different files that have been \input'ted ;  using \include does not change result.   Edit: problem is due to figures being in different chapters, not due to coming from different files. So answer is there. Thank you Werner.     Minimal example is  \documentclass[12pt,letterpaper,oneside]{book}  \usepackage{blindtext} %\usepackage{tocloft} %\usepackage[nottoc]{tocbibind} %\usepackage{chngcntr} %\counterwithout{figure}{chapter}  %\usepackage[labelsep=newline,justification=centering]{caption}  \begin{document}  \listoffigures \input{part1.tex} \input{part2.tex} \end{document}    where part1.tex has two figures and is   \blinddocument  \begin{figure} \begin{center}   \end{center} \caption{First input file, first figure} \label{fig:TrueDistances1} \end{figure}  \begin{figure} \begin{center}   \end{center} \caption{First input file, second figure} \label{fig:TrueDistances2} \end{figure}   while part2.tex is  \blinddocument  \begin{figure} \begin{center}   \end{center} \caption{Second input file, first figure} \label{fig:TrueDistances3} \end{figure}

When I'm generating a List of Figures in my project, all figures are grouped by chapter. I would like to have the whole list without any additional new lines between different chapters.  How it looks like:  Figure 1.1  Figure 1.2  Figure 2.1  Figure 3.1  Figure 3.2   How it should:  Figure 1.1  Figure 1.2 Figure 2.1 Figure 3.1  Figure 3.2   I tried to apply the following solutions but failed completely :        My main file:  \documentclass[12pt,oneside,titlepage,utf8x]{report}  \usepackage{times,a4wide,multirow,tabularx,graphicx}  \usepackage{psfrag,fancyhdr,longtable}  \usepackage[T1]{fontenc} \usepackage{float} \usepackage[utf8]{inputenc}  \usepackage{url} \usepackage{color} \usepackage{verbatim} \usepackage{fancyvrb} \usepackage{natbib} \usepackage{relsize}  \usepackage{caption} \captionsetup[longtable]{belowskip=10pt}  \usepackage[left=4cm,top=2cm,right=3cm,bottom=2.5cm]{geometry}  \renewcommand{\chaptermark}[1]{\markboth{\nouppercase{\thechapter.\ #1}}{}} \pagestyle{fancy} \headheight 30pt \rhead{} \lfoot{} \cfoot{\thepage} \rfoot{}  \setlength{\parindent}{2em} \setlength{\parskip}{1em} \linespread{1.3}   \begin{document}  \begin{titlepage} \maketitle \end{titlepage}  \tableofcontents  \chapter{First} \label{sec:First} \input{chapter1/chapter1}  \chapter{Second} \label{sec:Second} \input{chapter2/chapter2}  \chapter{Third} \label{sec:Third} \input{chapter3/chapter3}  \relsize{-1} \listoffigures \normalsize  \bibliography{praca_mgr} \bibliographystyle{plain} \nocite{*}  \end{document}


I'm trying to match a string inside an HTML   for example I want to find the string inside <strong> string </strong>   what I'm doing is  preg_match_all('|\<strong\>(.*)\<\/strong>|',$html,$data);  echo $data[1][0];   it works when the string I want to search inside <strong> is not a line break but if it has a line break, how can I do it?  not working example:  <strong> line break string </strong>

For example, this regex  (.*)<FooBar>   will match:  abcde<FooBar>   But how do I get it to match across multiple lines?  abcde fghij<FooBar>


For some odd reason, I can't use the usermod or group tool to change my UNIX username that every Linux user creates with a fresh install of any Linux release. Can someone help me with my problem?

Some time ago, when I installed Ubuntu, I chose a rather stupid username for my account that I do not want to use anymore. How do I change this (including the name of my home directory, and the name in the terminal) without losing settings for applications? How do I keep permissions and my keys for various authentification (e.g. email, SSH, GPG and more)? What settings could possibly get lost if I changed my username?


I just wanted to buy more unicoins using the "alternative payments - valuables - bacon", but this procedure fails. What should I now do with all this prepared bacon?

After selecting from the unicoin menu to buy unicoins with bacon, I don't receive my unicoins and my computer smells funny.  Steps to reproduce:   From the unicoin menu -> Buy unicoins select "Alternative Payments" select "Valuables" select "Bacon" (very valuable) Press the button on the Delicatessen Variety Dispenser. Wait for bacon accepting tray to fully eject. Carefully place bacon on tray, avoiding the over-sized drain. Gently push the dispenser closed. Observe no additional unicoins. Observe nice, tasty smell. Observe bad, smoky smell.   I've tried a variety of bacon, from Back Bacon to Slab Bacon, with no success.  Perhaps the transaction processing is caught in an infinite loop, as the dispenser won't eject anymore?


I'm trying to prove the following statement:  $$\lim_{n\to\infty}\left(\int_{a}^{b}f(x)^ndx\right)^{1/n} = \max_{x\in [a,b]}f(x)$$  where $[a,b] \subset \mathbb{R} $ and $f$ is non-negative and continuous.  I've tried to prove it in a similar way that we prove that $\displaystyle\lim_{n\to\infty}(a^n+b^n)^{1/n} = b$ if $b>a$.  However, I'm stuck in the end with an iterated limit of the form $\displaystyle\lim_{n\to\infty} \lim_{\epsilon\to 0 } \left(\epsilon^{1/n}\max_{x\in [a,b]}f(x)\right)$.   Is this last expression equal to $\displaystyle\max_{x\in [a,b]}f(x)$? If not, could anyone please give me a hint as to how to go about this proof?

Find $$\lim_{n \rightarrow \infty}\left(\int_0^1(f(x))^n\,\mathrm dx\right)^\frac{1}{n}$$if $f:[0,1]\rightarrow(0,\infty)$ is a continuous function.   My attempt:  Say $f(x)$ has a max. value $M$. Then $$\left(\int_0^1(f(x))^ndx\right)^\frac{1}{n}\leq\left(\int_0^1M^ndx\right)^\frac{1}{n} =M$$  I cannot figure out what to do next.


There have been many questions on this exchange about when to use phrases such as "John and I" vs. "John and me". The answer seems to be you that you use "John and I" when they are the subject of the verb and "John and me" when they are the object of the verb. However, sometimes it isn't so clear. For example, consider the following sentence     "A collaboration, between John and I, would lead to   close friendship"   In this sentence, I think the subject is the actual collaboration (not John and I) and the object is the friendship. So what is the proper usage in this case, where "John and I" is neither the subject nor the object?  Obviously this question is not a duplicate of any question asking about the use of "you" and "I" that doesn't contain rules for special prepositions such as "between".

Is it correct to say "between you and me" or "between you and I"?  I am not a native English speaker, so please bear with me.


I was solving some number theory problems and couldn't solve this one. I've already proved that if $a^n|b^n$, then $a|b$ (since positive integer power of a rational number is an integer implies that the rational number is an integer). But in this case, the exponents are different so that result is not applicable. Also, since $x^x$ is an increasing function, so $n<m$ in this case, so the exponent of the denominator is lesser (if it would be higher, we could've reduced the exponent of the denominator and then the previous result would be applicable.) Please help.

I'm not sure I've got this right. When proving $a^n \mid b^n \Rightarrow a \mid b$, can we do this indirectly? In short,  "Suppose $a$ does not divide $b$, this implies that $a^n$ does not divide $b^n$. But $a^n \mid b^n$, hence $a$ divides $b$."  How about $n^n \mid m^m \Rightarrow n \mid m$? Can we do this the same way?


May I ask how to solve the problem? Use mathematical induction to prove that for $x\geq0$ and positive integer $n$, $$e^x \geq 1 + x + \frac{x^2}{2!} + \cdots + \frac{x^n}{n!}$$

Show that if $n \geq 0$ and $x>0$, then   $$ e^x > 1 + x + \frac{x^2}{2!} + \dots + \frac{x^n}{n!}.$$  Not sure where to get started with this induction proof.


I have 4-5 weeks to prepare myself for a one day, 220km ride on a road bike, flat terrain (Germany, Ruhr Valley). This year my max is 70km (I could ride 100km, I'm doing bike rides since 2 weeks ago, have done only 3). I'm training since 5 weeks.  Weekly: - gym strength training 3x a week - 2x a week interval trainings (spinning, swimming, etc) - 1x a week long bike ride  The plan is to increase that long bike ride each week by some serious amount, hoping that the gym and interval trainings will help me achieve the goal.  Is this achievable?

I want to be able to ride 175 miles (281 km) in a day (to do the ). I used to be able to do about 60 miles (96.5 km), only once hitting 80 miles (128 km), but I'm out of shape now. Wondering how I can systematically train to get to 175 miles at an average of 15 mph (24 km/h) Are there guides out there to help with this?  What's some advice?  [update] The  will happen each year, so my intention isn't to ride this year, rather what do I need to do to ride it in some future year?


How to force the use of an ip of my server eth0:1, if my server interoge example google.com  when i use my php scripts, the ip that google must see is eth0:1  # The primary network interface auto eth0 iface eth0 inet static     address 173.249.3.15     netmask 255.255.255.0     gateway 173.249.3.1     dns-search invalid     dns-nameservers 213.136.95.10 213.136.95.11     up ip route replace 173.249.3.0/24 via 173.249.3.1 dev eth0  # new ip auto eth0:1 iface eth0:1 inet static     address 164.68.125.112     netmask 255.255.255.0     gateway 164.68.125.1

one of my servers (Debian 5.0.6) has two public ip-address on the same interface. This used to work well for months but suddenly it is using "the wrong" ip addresses for outgoing connections. This is a problem because the reverse lookup will not match and emails therefore get spam points.  eth0      Link encap:Ethernet  Hardware Adresse 00:1b:21:14:8e:9c             inet Adresse:81.169.180.51  Bcast:81.169.180.51  Maske:255.255.255.255           inet6-Adresse: fe80::21b:21ff:fe14:8e9c/64 Gültigkeitsbereich:Verbindung  eth0:0    Link encap:Ethernet  Hardware Adresse 00:1b:21:14:8e:9c             inet Adresse:85.214.157.120  Bcast:85.214.157.120  Maske:255.255.255.255   Kernel-IP-Routentabelle Destination     Router          Genmask         Flags Metric Ref    Use Iface 81.169.180.1    0.0.0.0         255.255.255.255 UH    0      0        0 eth0 0.0.0.0         81.169.180.1    0.0.0.0         UG    0      0        0 eth0   Currently it is using 85.214.157.120 for outbound connections. How do I get it to use 81.169.180.51?  Edit: The netmask of 255.255.255.255 is consistent with both documentation and DHCP response of the hosting company. Calling /etc/init.d/networking restart multiple times will eventually end up with the correct ip-address for outbount connections. But that is obviously not a stable solution. /Edit  Edit 2: To make sure that the host route is not related to my issue, I setup a local test network:  eth0      inet Adresse:192.168.0.2  Bcast:192.168.0.255  Maske:255.255.255.0 eth0:0    inet Adresse:192.168.0.3  Bcast:192.168.0.255  Maske:255.255.255.0  192.168.0.0    0.0.0.0         255.255.255.0   U     0      0        0 eth0 0.0.0.0        192.168.0.1     0.0.0.0         UG    0      0        0 eth0   If anyone has an idea how to make sure that source ip-address 192.168.0.2 is used on outbound tcp connections, I'd be thankful. /Edit 2


Malformed line (54) error message gedit not running, cannot fix as line editor will not load.  I  cannot load any new software or programs.   gedit worked before when I was in dual boot but I wiped the detested windows 10, in doing so and moving partitions I had to reinstall ubuntu from thumb drive.    When I started to try to load previously running programs that is when the trouble started.   I dont know if my hand stuttered and placed an extra character somewhere?

my problem is that my sources.list is out of date for some reason. I already found the fix in another port, but it doesn't work. It says to use gedit to edit sources.list and replace everything with the proper sources. Well, for some reason I don't have it installed (Ubuntu Server 14.04) and I can't install it or else I get the main problem again.  Failed to fetch http:// some ubuntu site Could not resolve hostname "us.archive.ubuntu.com"  Is there any other way to edit sources.list? Or do I need to do a re-install of the OS?


Screenshots:  I recently got a new laptop. My old laptop, running Windows 10, had a really nice Start menu. The buttons for "File Explorer", "Settings", "Power", and "All apps" were big and easy to click (first image). My new laptop has a fresh install of Windows 10 (second image). I find I have to search for the right icon with the small buttons, and I find the Start menu is cluttered with the apps list there and not in a sub-menu. Is there any way to get the old one back? I have looked through the settings but I haven't found anything relevant. Googling the issue just shows "how to get the windows 7 start menu in windows 10". Good:  Bad:  Edit: It has been suggested that this is a duplicate of  question. I am willing to install third-party software to fix this, but I don't want to pay for a piece of software for something so simple.

I just bought a new Windows 8 laptop, but I want to get rid of the new "Modern UI" Start Screen, and get the old Start Menu back. How do I do this?


I would want what is the meaning of death. Some people have different opinions:   Death is an enfeeble form of life. Death is a continuation of life. Death is perpetual development. Death is waiting.

Could anyone point me to some authors who have discussed the ideas surrounding death in western Philosophy?   (Not whether we know we exist but rather the concept of mortality and immortality).


I have completed my undergraduate (bachelor's of engineering) degree. I am looking to go for a masters, but I lack some prerequisite math courses on my transcript. Is there a way to get credited math courses (like stochastic calculus, probabilistic theory, etc.)? I am from India, planning on applying mainly to european institutes. I have done good number of mathematical courses. But, lack only 2 courses for fulfilling the prerequisite. My planned universities dont have a pre master that I know of. Note: The most important part is being able to get the credits and transcript. As I cannot share just a certificate. I havent been accepted. I need to complete the courses to meet the prerequisite for my application.

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).


I'm working on a project for which I have GPS points and I would like to extract the sequence of roads related to those points. I know that this is called "map-matching" and that there is a load of literature about it.  Here is my question: is there a software / library that allows to easily convert a sequence of GPS points into a road sequence, given that I have the road network, so that I don't have to (re)implement the wheel?

I'm using OpenStreetMap and its vectorial road network and I'd like to implement a map matcher algorithm.   Currently I'm able, for each GPS position, to retrieve the nearest road segment and calculate the projection of this position to that segment, like on this image (Red pin is the pure GPS position, in blue the mapped segment and in Green the mapped position):    However, due to the lack of accuracy of the GPS, sometimes the mapped position jumps from segment to another and can provide some inconsistent mapped position from time to time.  My current algorithm is very basic : from the pure GPS position, I get the nearest segment and decide that the mapped matched position is on this one. I know that this can be really improved.  I can imagine that taking the vehicle direction into account will improve the map matching but do you know any other approach that would enable me to improve my map matcher ?  I seek any link, and/or open source software?


When a logistic regression is being fit to a set of data, what is the actual value that is being maximized? What I mean is, as the coefficients are being determined, what criterion is being used to determine the "best fitting model"?  Is it: the number of cases that are correctly classified based on the calculated Y value for each case?  Thanks!

I'm trying to understand the derivation of the equations for the logistic regression. I'm following the cs229 notes:    At some point in the derivation, in the notes we need to maximize the log-likelihood of the parameters:  ℓ(θ) = log L(θ) = y log h(x) + (1 - y) log(1-h(x))  In the notes, after the derivation we get:  $\frac{\partial}{\partial \theta_j}$ = (y $\frac 1 {h(x)}$ - (1 - y) $\frac 1 {1 - h(x)}$) $\frac{\partial}{\partial \theta_j}$h(x)  Shouldn't this be:  $\frac{\partial}{\partial \theta_j}$ = (y $\frac 1 {h(x)}$ + (1 - y) $\frac 1 {1 - h(x)}$) $\frac{\partial}{\partial \theta_j}$h(x)  I've been looking at this for a while and I can't see where this minus sign is coming from...  Thanks for your help!


Let's be very specific. Assume you have two casters. The first one casts polymorph on, lets say, a Kraken, and uses portent to assure a failed save.  He turns the Kraken it into a regular 1/2 inch diameter spider. The second caster casts wall of force and creates a no save 1/2 inch diameter sphere of force around the spider-kraken. The first caster immediately stops concentrating.  What happens?  For reference, the average 5e Kraken is about 100 feet in length and weighs about 4,000 pounds.  What happens if you very soon afterwards stop concentrating on the wall of force as well?    This is not the same as "running out of wildshape" because wildshape has very different language, and is generally not dismissable by an enemy (it doesnt go away as a result of anything other than damage).  It would be completely within the boundaries of the game for the DM to say to a druid, "no you cannot choose to end your cat wildshape while you are still within the iron pipe."    And, unlike wildshape, which takes a full action to drop (thus likely occurs slowly), the physics answer would be very different (sudden burst of pressure as opposed to slowly building pressure).    Forcecage is also not applicable as a point of comparison as it has specific language regarding not being able to fit.     Also, for the record, this comes up all time because we have a caster with a Ring of Spell Storing, polymorph and wall of force.

So in a 5e campaign I'm running, the party Druid has recently been doing some scouting of the local monster caves in spider form to avoid notice. I've also described how the goblins and kobolds who live in these caves use a variety of tunnels too small for Medium sized creatures in order to get around. Since the party doesn't have any halflings or gnomes, I didn't really think the party would ever get into those tunnels. But obviously if a goblin can fit, so can a spider, so there is the possibility that the Druid might try to scout them out.  But what if something goes wrong? What if the Spiderdruid were to get lost and run out of time in Wild Shape, or encounter a hungry lizard and drop to 0 Spiderhealth?  Is there anything in the rules to suggest what should happen when somebody tries to revert to their normal size in a space where they normally wouldn't fit?  With a space sized for a Small creature such as in my game, I might just rule that he's stuck unless he makes difficult Dexterity checks or waits to get his Wild Shape back. However, what if it was an even smaller space, such as a burrow or a pipe or a deep crack in the rock? Someplace where his human body literally won't fit?  If there aren't any rules for this, I'm open to suggestions on how it can best be handled.


How can I find the rule of this function?

Write the equation of the parabola that has the vertex at point $(5,0)$ and passes through the point $(7,−2)$.  I know how to do it with the $x$ intercepts but I can't solve this.


Doing some hocus-pocus to mark the angle of a triangle a fixed length away from the point and I want to now place a node midway between the point and the arc so I can label the value of the angle.   I'm aware that the way I've constructed the arc means that there isn't a defined midpoint for that particular section that's showing (for reasons beyond the scope of the question \tkzMarkAngle and \tkzLabelAngle are not options), which is why I'm thinking the way to do this would be with a bisector, but I can't figure out how to place the node.   Open to any other suggestions also.   \usepackage{tkz-euclide} \usetkzobj{all} \begin{document} \begin{tikzpicture}   \coordinate (A) at (0,0);   \coordinate (B) at (4,6);   \coordinate (C) at (9,1);   \draw (A)--(B)--(C)--cycle;   \begin{scope}     \clip (A) -- (B) -- (C) -- cycle;     \path[draw,color=red,line width=1.5,opacity=0.5] (A) circle (1.5);     \tkzDrawBisector[opacity=0](B,A,C);   \end{scope} \end{tikzpicture} \end{document}

I have the following drawn with TikZ    using the code  \documentclass{article} \usepackage{tikz} \usepackage{tkz-euclide} \usetkzobj{all} \begin{document} \begin{tikzpicture} \coordinate (O) at (0,0); \draw (O) circle (3); \coordinate[label = above left:$M$] (M) at (130:3); \coordinate[label = above:$N$] (N) at (80:3); \coordinate[label = below:$A$] (A) at (240:3); \coordinate[label =below right:$B$] (B) at (300:3); \draw (A) -- (M) -- (B); \draw (A) -- (N) -- (B); \tkzMarkAngle[draw = black, fill = white, opacity=1](A,M,B) \tkzLabelAngle[pos = 0.8](A,M,B){$x$} \tkzMarkAngle[pos = 0.2,draw = black, fill = white, opacity=1](A,N,B) \tkzLabelAngle [pos=0.8](A,N,B){$27 ^{\circ}$} \end{tikzpicture} \end{document}   Notice however, tht the 27 degrees does not fit in very nicely. How can I adapt the code to try and move the 27 a bit "lower" so that it fits in better, as well as the angle mark?  Also, how can I get two "double arrows" in the middle of lines AM and BN, to indicate that they are 'parallel'?


Is it a correct sentence:       I just wanted a friend, who I can share my feelings with.   OR should I say   I just wanted a friend, with whom I can share my feelings.

Is this correct?     The person with whom I'm doing the project should be here soon.   If it is, is with always a dative preposition (like mit in German)?


I'm trying to find out what exactly the asterisk(*) means on the SQLAlchemy query below. Could anyone clarify please?  import uuid from sqlalchemy import Column from sqlalchemy import Integer from sqlalchemy import or_ from sqlalchemy_utils.types.uuid import UUIDType  class House(Base):     id = Column(Integer, primary_key=True)     street = Column(UUIDType, default=uuid.uuid4, nullable=False, unique=True)     zip_code = Column(UUIDType, index=True)  # Shell session $: [...] query = request.dbsession.query(House) query = query.filter(or_(*[(getattr(Building, k) == getattr(self, k))                           for k in ('street', 'zip_code')                           if getattr(self, k) is not None]))

In the following method definitions, what does the * and ** do for param2?  def foo(param1, *param2): def bar(param1, **param2):