How would you categorize an action that is characteristic of a brown-noser (somebody who tries too hard to impress)?

What term would communicate something similar to "brown noser", without the vulgar connotation?  (Here's one citation of the term being , but I'm guessing it was used before that.  In any case, the term is used by people in American culture today. From the link to WWII Vocabulary: "Brown-noser: Ass-kisser. To curry favor, or “boot-lick.” Variation: Brownie"  What term/phrase communicates 'speaking or acting to please those with authority or position to gain favor', without the crude connotation of the term 'brown-noser'?  Example sentence:       "Did you hear what Bob said about the company track record in our employee meeting yesterday?  He's a ______"


I am in the process of creating a forum where user will be creating tags similar to the way Stack Overflow does.   To allow users to discover more and more questions, I liked the related tags in the right which comes when we visit a page of some particular tag.   So, I wanna know how two tags are considered related ? How can I calculate the distance between tags !  I just need the views or algorithm that can be used to calculate the distance.  Thanks !!

After you've typed in a question, you get suggested tags that appear that look like this:        It appears that you need a minimum amount of characters ():     you must have entered a title (any length) and a minimum body length of 220 characters.   But other than that, how are the tags chosen? Is it:   A match of the title/body with other questions (taking the tags from those questions) A match of the title/body with tag excerpts (taking tags with overlap) A match of the title/body with tag wikis (taking tags with overlap) All of the Above None of the Above Other (please explain)   Some additional info from :  The suggested tags seem to only pop up on meta.so (they do not work on regular Stack Overflow, or on other SE sites).  While we're on the topic, why isn't this feature implemented network-wide?


I have tried the following steps to move a list from root site to subsite.   Go to list Setting > Save List as a template and include the contents At sub-site > Add app > create a list from this template   But in the sub-site the list does not contains the information of the lookup fields. I have created the lookup table. Is it possible to move with the lookup information?

My issue is that I have two lists that I would like to move with their data.  While I am able to save both as templates and then upload to the new site, none of the lookup columns in my parent table are populated with data now.  Can this be done?


I'm new to the LWC, Getting this error when I'm trying to push to the org since two days, Earlie some components worked well now even they are showing this error .There are no duplicates and I tried uninstalling salesforce CLI too. Please some one help me in this.

I am trying to deploy a lightning web component to the org using vs-code but getting the error.  Starting SFDX: Deploy Source to Org  10:09:14.43 sfdx force:source:deploy --sourcepath d:\Aakriti\Projects\LWC\LWCLearning\force-app\main\default\lwc --json --loglevel fatal 10:09:25.813 sfdx force:source:deploy --sourcepath d:\Aakriti\Projects\LWC\LWCLearning\force-app\main\default\lwc --json --loglevel fatal ended with exit code 1   Earlier I was able to deploy components successfully but after updating vs-code, I am getting this error. I am not sure what is the issue. Can anyone please let me know how can I resolve this.   I am using api-version '45'.  Thanks.


For a startup company I thought of going with Ubuntu operating system for 200 desktops. To reduce cost to the company I don't want to rely on Microsoft.  Can I go ahead and install Ubuntu 18.04.3 LTS for all my employees and run my office? I don't want to encounter any legal issues.

Is  free for business platforms?  Has Ubuntu changed its conditions about using the OS for profit purposes?


How is resolution connected to ppi and dpi units? In the context of editing photos, resolution is a measurement of the output quality of an image. DPI and PPI because that is what you will be dealing with most often when printing photographs.

There are lots of other questions on Graphic Design which partly cover this, e.g. .  However, I have become frustrated at the number of questions and answers which confuse the two terms. I think understanding the difference is important.  So here's a place to answer this question well and clear up the confusion!


I've been looking at the Oxford Dictionary's page on , and see that they use this example:     He called this phenomenon "the memory of water."   This seems like it would work with or without the quotation marks, but I can't seem to find any specific guidance on the appropriate use of quotation marks for sentences that say something is called something. I've written some example sentences:     I call this 'the XYZ theory'.   or     I have a problem with a thing called 'small talk'.   Is it a case of quotation mark/inverted comma usage being appropriate when it's an unknown term, but inappropriate when it's a commonly used noun? The first example looks correct to me, whereas the second doesn't sit right unless the quotation marks are being used to draw emphasis.  I believe that you definitely wouldn't use them with proper nouns (my friend is called Peter, not my friend is called 'Peter'), and you could use them with film/book titles, etc. But what about nouns other than those?  I'm aware this may be a duplicate to  question, but the answers seem inconclusive.

The solution is to foo, producing what is called a bar.   or     The solution is to foo, producing what is called a "bar".   Should I use generally use one over the other; and if so, which one? If either is acceptable, then which style guides (if any) have an explicit preference?


I notice that in many research papers (viz. "Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption" by Cramer and Shoup) the authors showed that their cryptosystem is IND-CCA secure under standard model. What does it mean? What does an adversary have access to in a challenger-adversary game?  Actually, my aim is to get a clear idea on IND-CCA secure under standard model. I am confused on the statemant like "The given public key cryptosystem is IND-CCA secure under Diffie-Hellman assumption ". Is this statemant means that this particuler cryptosystem is IND-CCA secure under standard model?

There are many schemes that can advertise themselves with certain security notions, usually IND-CPA or IND-CCA2, for example plain ElGamal has IND-CPA security but doesn't provide IND-CCA security.  The most common ones are the "IND-" ones, advertising security against specific classes of attackers. Now these notion may not be that well-understood by many people so I ask hereby for a canonical answer, that explains what the following security notions mean. A (simple) description of the formal attack scenario is preferred. Please don't restrict the answer to "you can chose this and if you can break it with this it isn't IND-CCA2". Please at least outline the formal attack (like f.ex. real-or-random). Relations between the "IND-" are explained (f.ex. IND-CCA implies IND-CPA). The notions in question are:   IND-CPA IND-CCA IND-CCA1 IND-CCA2 IND-CCA3


So I'm mid-way through modelling a head, and so I decided to turn on subdivision surface modifier to see what it would look like with smoother geometry, but it created some weird creasing effects (not sure what else to call it) on the head, and I have no clue why.    This is without the modifier on:    Does anyone know how I can fix this?

Probably an obvious answer, but I can't figure out why my mesh is causing such a weird crumpled up look with the subsurf modifier.  I've gone through to make sure there are no doubles or overlapping vertices, but it still looks weird when I apply the subsurf.  Any idea what I might be doing wrong?      Here is the .blend


Let $x = 2017^{2017}$  How can I determine the least significant digit of $x$?  Can this be solved without using the Euler's totient theorem?

Let $x = 2017^{2017}$. How can I manually determine:   The remainder of the division of $x$ by $31$ The least significant digit of $x$


Suppose $f(x)$ and $g(x)$ are continuous functions on $[a,b]$ with $f$ monotone increasing. Assume there exists a sequence $x_n \in [a, b]$ such that for all $n \in \mathbb{N}$ , $g(x_n) = f(x_{n+1})$. Show that there exists $x_0 \in [a,b]$ such that $g(x_0) = f(x_0)$.  Just wondering if this question is wrong. My idea is that if I look at $g(x) := x+1$ and $f(x) := x$. Choosing the sequence $x_n = x$. Then I have  $g(x) = f(x+1)$. However, I don't think there is any $x_0$ such that $x_0 + 1 = x_0$. What am I misunderstanding here?

Suppose $f(x)$ and $g(x)$ are continuous functions on $[a,b]$ with $f$ monotone increasing. Assume there exists a sequence $x_n \in [a, b]$ such that for all $n \in N$ , $g(x_n) = f(x_{n+1})$. Show that there exists $x_0 \in [a,b]$ such that $g(x_0) = f(x_0)$.  Can someone provide an example of functions that fulfills this condition?


Let $\mathcal{L}$ be the Lebesgue measure on $Y=[0,\infty)$. Let $(X,\mathfrak{B},\mu)$ be a $\sigma$-finite measure space and let $f$ be a nonnegative $\mu$-measurable  function on $X$. Prove that $\int_X f \, d\mu=\int_Y\mu(f^{-1}[t,\infty)) \, d\mathcal{L}(t)$.   I'm learning measure theory and is this question correct? Because I get $\int_X f \, d\mu=\int_Y\mu(f^{-1}[t,\infty)) \, d\mathcal{L}(t)=\mu(f^{-1}[t,\infty))\mathcal{L}([0,\infty))=\infty$ and this is not true when $X$ has finite measure and $f$ is bounded. Thanks for your helps.

Let $({\Bbb R},{\mathcal A},\mu)$ be the measure space where ${\mu}$ is the Lebesgue measure.  Assume that $\int_{\Bbb R}|f|^pd\mu<\infty$ ($p\geq1$). There is an exercise for proving that       $$\int_{[0,\infty)}pt^{p-1}\mu(\{x:|f(x)|\geq t\})d\mu(t)=\int_{[0,\infty)}\mu(\{x:|f(x)|^p\geq s\})d\mu(s).$$   If one formally let $s=t^p$, then $ds=pt^{p-1}dt$ and one would immediately get the equality above. However, how can I justify it rigorously in the sense of Lebesgue integration?    [Edited] What puzzles me is that I have the "change of variable" theorem for Riemann integration, but all the integrations here are in the Lebesgue sense. Unless one has shown that the integrands are also Riemann integrable, how can I directly use "change of variable"?


This is my code for a program that is supposed to prompt the user to provide a single letter, and then reports whether the letter is a vowel or consonant:  #include <iostream> using namespace std;  int main() {     cout << "input a single letter";     int var;      cin >> var;     int vowel = 'a','e','i','o','u';     int consonant = 'b','c','d','f','g','h','j','k','l','m','n','p','q','r','s','t','v','w','x','y','z'     if (var == vowel) {         cout << "vowel";     } else if (var == consonant) {         cout << "consonant";     } else if (var != vowel && var != consonant) {         cout << "Error";     }     return 0; }   I am very very new at C++, and am trying to learn why I'm getting an error message.

This question attempts to collect the few pearls among the dozens of bad C++ books that are published every year. Unlike many other programming languages, which are often picked up on the go from tutorials found on the Internet, few are able to quickly pick up C++ without studying a well-written C++ book. It is way too big and complex for doing this. In fact, it is so big and complex, that there are very many very bad C++ books out there. And we are not talking about bad style, but things like sporting glaringly obvious factual errors and promoting abysmally bad programming styles. Please edit the accepted answer to provide quality books and an approximate skill level — preferably after discussing your addition in . (The regulars might mercilessly undo your work if they disagree with a recommendation.) Add a short blurb/description about each book that you have personally read/benefited from. Feel free to debate quality, headings, etc. Books that meet the criteria will be added to the list.  Books that have reviews by the Association of C and C++ Users (ACCU) have links to the review. *Note: FAQs and other resources can be found in the  and under .


An element $r\in R$ is called nilpotent if $r^n=0$ for some integer $n=1,2,\dots $.   We have the following:    When $r$ is nilpotent then $1-r$ is invertible in $R$.  If $R$ is commutative then the set $N(R)$ of nilpotent elements is an ideal of $R$. This is not true when the ring is not commutative.       I want to show that $N(\mathbb{Z}_m)=0$ if and only if $m$ is not divisible by a square of a prime.      Suppose that $N(\mathbb{Z}_m)=0$, then  $r^n\neq 0$, for all $n\in \mathbb{N}$, where $r\in \mathbb{Z}_m$, right?   How could we continue?

Let $n>1$ be an integer. Prove that $0$ is a radical ideal in $\mathbb{Z}/n\mathbb{Z}$ if and only if $n$ is a product of distinct primes to the ﬁrst power (i.e., $n$ is square free). Deduce that $(n)$ is a radical of $\mathbb{Z}$ if and only if $n$ is a product of distinct primes in $\mathbb{Z}$.  I don't really get it. For example, $8$ is not a square-free integer; so take $\mathbb{Z}/8\mathbb{Z}$. Why is $0$ not a radical ideal in this ring but is in $\mathbb{Z}/6\mathbb{Z}$?


how to determine the time taken to sort the elements in Quicksort using java program.I have a list of elements in unsorted manner.Quicksort sort the elements .problem is how to determine running time taken by quicksort to sort elements

How do you write (and run) a correct micro-benchmark in Java?  I'm looking for some code samples and comments illustrating various things to think about.  Example: Should the benchmark measure time/iteration or iterations/time, and why?  Related:


Theorem: 4 normals can be drawn from any point to the ellipse $\frac{x^2}{a^2} + \frac{y^2}{b^2} = 1$. $( a > b > 0)$  I had a doubt in the proof of the above statement given in my book.  Proof given in Book. The normal at the point with eccentric angle $\phi$ is $ax\sec\phi - by \csc\phi = a^2 - b^2 $. Let P$(h,k)$ be any point in $\mathbb{R^2}$. If the normal passes through P:  $$ah\sec\phi - bk \csc\phi = a^2 - b^2  = a^2e^2 $$ Let $ t = \tan \frac{\phi}{2}$, then $\cos \phi = \frac{1 - t^2}{1 + t^2}$ and $\sin \phi = \frac{2t}{1 + t^2}$. Substituting and rearranging, gives:     $$bkt^4 + 2t^3(ah + a^2e^2) + 2t(ah - a^2e^2) - bk = 0 $$   This is a quartic in $t$, hence has 4 roots, corresponding to 4 points on the ellipse which are conormal.      Doubt: My question is how do we know that the roots of that quartic equation are real and distinct? Because if not, then the theorem is not yet proved. I looked up the discriminant of a quartic on Wikipedia (), but the inequalities are too difficult to handle. How can I show that the roots are all real and distinct?

From a typical point $P$ inside an ellipse, how many points $Q_i$ on the ellipse have $PQ_i$ normal to the ellipse?  Someone asked me at school many years ago but I don't think I worked it out.


I have tried the following: $$ f(x) = \sin x-\frac{2x}{\pi} \\ f'(x)= \cos x-\frac{2}{\pi} \\ f''(x) = -\sin x \leq 0 $$ But this doesn't seem to be heading in the right direction as it would appear $f'(x)$ is decreasing and has a zero within the domain, so I'm not sure how this might be used to prove the inequality.

I need to show that $\dfrac{2}{\pi}<\dfrac{\sin(x)}{x}<1$ for $0<x<\dfrac{\pi}{2}$.  I know I need to use the mean value theorem, would I just say that since $f$ is continuous in the interval (call it I).  We know $\exists c\in I$ such that $f'(c) = \dfrac{f\left(\dfrac{\pi}{2}\right)-f(0)}{\dfrac{\pi}{2}}$. I don't know where this is going though.  Also, would I need to show $\lim_{x \to 0}\dfrac{\sin(x)}{x} = 1$? Is there a way to do this without L'H Rule?


Hello people here is my code below...              #ajax code after success             $.each(obj,function(index,Object) {                 ban_list += '
remove ban
';              })          $('.b_list').html(ban_list).toString();   above code works fine by creating a div with the class=ban_n and id=get1_name get1_name is nothing but Object.To now i have to set onclick for ban_n  $('.ban_n').on('click',function(){ console.log($(this).attr('id')); })   why is the above code does not work.. anyway to fix this??

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


I do have a term and would like to show several steps of a derivation, just like here:  \documentclass{IEEEtran} \usepackage{amsmath} \begin{document} \begin{align} thisIsATerm \\ &= \framebox[\columnwidth]{long equation 1}\\ &= \framebox[\columnwidth]{long equation 2} \end{align} \end{document}   Here, the equations 1 and 2 are filling up a single (double-column) line. which looks like:     How to I get something that looks better? Maybe something like this (please suggest something more beautiful or how you would do it):

\documentclass[11pt]{article} \usepackage{xfrac, array, tabu, multirow, graphicx, setspace, dcolumn, tikz} \usepackage[fleqn]{mathtools} %the argument for d specifies the maximum number of decimal places \usepackage[ngerman]{babel} \usepackage[applemac]{inputenc} \begin{document} \begin{align} \bar{x}&=7+(2\times9) + (2\times10) + (4\times11) + (6\times12) + (7\times14)\\  &+(2\times15) + (3\times16) + 17 + 18 + 19\\ \bar{x}&=14  \end{align}  \end{document}   I was looking long and hard for an answer, I believe {alignat*} is capable to do what I want, I just can't figure out how. I want the too long equation to align as follows: 1st and 3rd row the = should be aligned. But I also want the 1st and 2nd row to be aligned where the first + comes in.


I have been working on this for quite a few works now. I have a dynamic table to which I add more columns using a button. In one of these column's I wish to create a image upload button. I add columns to my table using javascript and to one of those columns I add the following form    tblBody.rows[row].cells[6].innerHTML = ' <form enctype="multipart/form-data" method="post">                                           <input type="file" name="file_upload" id="file_upload">                                           <input class="button green" type="submit" name="submit" value="Submit Content">                                           </form>';   For uploading the image using AJAX and jQuery I used the following code on   So I include the following javascript to my code  $(function() { // Variable to store your files var files;  // Add events $('input[type=file]').on('change', prepareUpload); $('form').on('submit', uploadFiles);  // Grab the files and set them to our variable function prepareUpload(event) {     files = event.target.files; }  // Catch the form submit and upload the files function uploadFiles(event) {     event.stopPropagation();      event.preventDefault();        var data = new FormData();     $.each(files, function(key, value)     {         data.append(key, value);     });      $.ajax({         url: 'submit.php?files',         type: 'POST',         data: data,         cache: false,         dataType: 'json',         processData: false, // Don't process the files         contentType: false, // Set content type to false as jQuery will tell the server its a query string request         success: function(data, textStatus, jqXHR)         {             if(typeof data.error === 'undefined')             {                 // Success so call function to process the form                 submitForm(event, data);             }             else             {                 // Handle errors here                 console.log('ERRORS: ' + data.error);             }         },         error: function(jqXHR, textStatus, errorThrown)         {             // Handle errors here             console.log('ERRORS: ' + textStatus);             // STOP LOADING SPINNER         }     }); }  function submitForm(event, data) {     // Create a jQuery object from the form     $form = $(event.target);      // Serialize the form data     var formData = $form.serialize();      // You should sterilise the file names     $.each(data.files, function(key, value)     {         formData = formData + '&filenames[]=' + value;     });      $.ajax({         url: 'submit.php',         type: 'POST',         data: formData,         cache: false,         dataType: 'json',         success: function(data, textStatus, jqXHR)         {             if(typeof data.error === 'undefined')             {                 // Success so call function to process the form                 console.log('SUCCESS: ' + data.success);             }             else             {                 // Handle errors here                 console.log('ERRORS: ' + data.error);             }         },         error: function(jqXHR, textStatus, errorThrown)         {             // Handle errors here             console.log('ERRORS: ' + textStatus);         },         complete: function()         {             // STOP LOADING SPINNER         }     }); } });   But for some reason this does not work when I include the form with javascript. It works fine when the form is in normal html file. Does anybody have a idea why it's not working?


I want to share my Public folder on Ubuntu 16.04, but in preferences I see that This feature cannot be enabled because the required packages are not installed on your system.   samba & system-config-samba are already installed on my PC. What exactly packages do I need to install? Thanks.

I see a pop up that says  Share Files over the Network This feature cannot be enabled because the required packages are not installed on your system  Simple enough, but what packages do I need?


We know, that in material/concrete conditionals the first half of the hypothetical proposition is called $antecedent$  and second half is called $consequent$.  Represented as;     IF antecedent THEN consequent.   We also have names for components of disjunction and conjunction, namely disjuncts and conjuncts.   So, do we have a special names for the components of Biconditionals?

I know that if we have $P\rightarrow Q$, $P$ can be called the antecedent and $Q$ the consequent or conclusion. If we have $P \leftrightarrow Q$, are there names for what we would call $P$ and $Q$ here?  I am writing a proof where I am proving $P \leftrightarrow Q$ and I already showed $P\rightarrow Q$ and I am trying to show $Q\rightarrow P$ but the statement of $Q$ is long and I was wondering if there is a word for $Q$ that I could use.


I'm trying to install PowerPanel Business Edition on Apple OS X.13. The server starts and exits (quits) - no log file, no error message. It works fine on my other OS Apple machines but on this High Sierra mac it won't run. The vendor is saying that there must be a conflict with another software and that it uses ports: 3052 (UDP/TCP), 53568 (TCP), 161 (UDP), 162 (UDP), 53566 (UDP), but I do not see those ports being used using this command:  $ lsof -nP +c 15 | grep LISTEN   Is there anything else I should be doing to check ports, and if no, is there any way (given that I don't have access to the source) to get a clue as to what this executable is doing when it crashes?

I am trying to get all the processes listening for a network connection on Mac OS X. netstat does not have the -p option and I am trying with lsof  lsof -i -sTCP:LISTEN   gives me a fair list of listening processes but not all. I can for example telnet to port 10080 where I have a process listening for a connection but this is not shown in the output of lsof. What am I missing?  $ telnet localhost 10080 Trying ::1... Connected to localhost. Escape character is '^]'. ^] telnet> Connection closed.   but  $ sudo lsof -n -i | grep 10080 $


Previously a user posted a question that doesn't expose the real problem. It's likely that it's an XY problem and that has been explained clearly why in the comments. Anyway I've posted a real solution to the unreal question and got many upvotes. But the OP didn't accept that fact and continue to insult many people, thus all the comments have been removed and the question has been closed  Then half a day after that I woke up with a ton of attacks in my facebook inbox request. I don't know how he could find my personal account but he used a lot of heavy words and said that I'm completely stupid without knowing those things are  I've checked again and saw his stackexchange account has just been suspended due to unknown reasons. But I still want to know what should be the actions in those cases?

I recently posted some comments to an answer on Math.SE.  I pointed out (politely, I thought) some critical errors in the answer.  Later, on my personal blog (which is linked from my profile), someone with a similar username tried to post a large number of comments containing juvenile insults.  The user's behavior on Math.SE itself has not been abusive, as far as I can tell.    Is it worth bringing this to the attention of moderators?  Should I use a flag or the "Contact Us" button?  Or is this beyond their purview, and I should just handle it like any other abuse on my blog?  I don't so much care about seeing the user punished, but it would be nice to help prevent anyone else from being similarly annoyed by this person.  (I haven't linked the answer here to avoid public escalation, but I can if it would help.  Anyway, it's since been deleted.)  Edit: michaelb958's comments below suggest the user has also been posting similar insults on MathOverflow, so his abuse does include the SE network itself.  I'm contacting team@stackoverflow.com and will pass along my logs.


I would like to demonstrate the  of the softmax function and its relation to the sigmoid function with a practical example.  With toy data, it's easy to show that:  logits = np.array([.123, .456])  softmax(logits) == np.array([ sigmoid(logits[0] - logits[1]), 1 - sigmoid(logits[0] - logits[1]) ])   With real data, I'm constructing both a vanilla logistic regression model and vanilla k=2 softmax regression model, each without a bias term. All weights are initialized to .0001. I'm running 1 step of gradient descent, using a batch size of 1.  Should the two functions make identical predictions? What relationship, if any, should we observe between the weights and/or logits of the respective functions?  Empirically, I'm not seeing any relationship between the two.

Suppose we have data matrix $X$ which is $n\times p$ matrix ($n$ data points, and $p$ features including intercept), i.e., we already add the intercept term (append $1$ column) to $X$   For logistic regression (binary classification), the model parameters / regression coefficients $\beta$ is a length $p$ vector. For softmax regression (multi-class classification), the model parameters $W$ is $p \times m$ matrix, where $m$ is the number of classes.   Now, suppose we set $m=2$, then $W$ is a $p \times 2$ matrix. They are the same model, so the number of parameters CANNOT be doubled and we should be able to derive one from another.   So, my question is  What is the relationship between $\beta$ and $W$?


Lets say i have folder with images and I want to import all of those images with IMG_Load or SDL_LoadBMP no matter what the names of those images are and no matter how many of those images are in that folder. For instance, if I have 10 images in folder "Images" I need to use IMG_Load 10 times, and every time to write name of every single image in IMG_Load function. So if I add another 10 pictures with different names this obviously wont work. So my question is how can I import images from folder with arbitrary amount of those images in it using SDL? So to be precise, is there a way to import those images with integers or array? I mean to sort names of those images ascending and call them by numbers. IMG_Load(1), IMG_Load(2), ...

How can I determine the list of files in a directory from inside my C or C++ code?  I'm not allowed to execute the ls command and parse the results from within my program.


I asked my teacher what is the real meaning of $\cfrac{0}{0}$, and the answer I got was "nobody knows". I can't leave this subject "as is". I need a decent explanation, at least an explanation to why "nobody knows". I'm sure you'll come up with a few good answers.

(This was asked due to the comments and downvotes on this  answer. I am not that good at maths, so was wondering if I had made any basic mistakes)  Ignoring limits, I would like to know if this is a valid explanation for why $\frac00$ is undefined:     $x = \frac00$    $x \cdot 0 = 0$        Hence There are an infinite number of values for $x$ as anything multiplied by $0$ is $0$.   However, it seems to have got comments, with two general themes.  Once is that you lose the values of $x$ by multiplying by $0$.  The other is that the last line is:      $x \cdot 0 = \frac00 \cdot 0$   as it involves a division by $0$.  Is there any merit to either argument? More to the point, are there any major flaws in my explanation and is there a better way of showing why $\frac00$ is undefined?


The Python round() function will theoretically take negative numbers to round to places left of the decimal. [ I.e. round(150, -2) => 200]   However, it seems to be very susceptible to floating point error.  For example, given a large number say 2e25, it gives weird results.  2e25 === 20000000000000000000000000  But, round(2e25, -23) gives a value like 20000000000000000273942742  When it should just be getting 20000000000000000000000000  I know there's a formatting function, a la this thread:   However, that only seems to work for rounding to the right of the decimal.  Am I wrong?  Is there another way to do this?  Very frustrating trying to get the math right.  Thanks!

The documentation for the  function states that you pass it a number, and the positions past the decimal to round. Thus it should do this:  n = 5.59 round(n, 1) # 5.6   But, in actuality, good old floating point weirdness creeps in and you get:  5.5999999999999996   For the purposes of UI, I need to display 5.6. I poked around the Internet and found some  that this is dependent on my implementation of Python. Unfortunately, this occurs on both my Windows dev machine and each Linux server I've tried. .  Short of creating my own round library, is there any way around this?


Prove that $\;\displaystyle\int_{0}^{a} \frac{\ln(1+ax)}{1+x^2}dx = \tan^{-1}(a)\ln(\sqrt{1+a^2})$  For $a=1$, this is Serret's integral. So I thought the self similar substitution $x \rightarrow \frac{1+x}{1-x}$ would help but it didn't.  I also applied integration by parts twice but it didn't help.

The integral specified in the title appears in Gradshteyn & Ryzhik 4.291.18, also followed by its sister integral: $$\int_0^a \frac{\ln(1+ax)}{1+x^2}dx=\int_0^a \frac{a\arctan x}{1+ax}dx=\frac12 \arctan a\ln(1+a^2) \tag 1$$  Some application of the above gives us some nice results, such as: $$\int_0^1\frac{\arctan x}x\ln\left(\frac{(1+x^2)^3}{(1+x)^2}\right)dx=0$$ Above follows by converting $\int_0^1 \frac{\arctan x\ln(1+x^2)}{x}dx$ to a double integral using $(1)$ and then swapping the order of the integrals.  Or another one: $$\int_0^1 \frac{\arctan x\ln(1+x^2)}{x(1+x)}dx=\frac{\pi^3}{96}-\frac{\pi}{8}\ln^2 2$$    But the question here would be how to prove the result given in $(1)$?  I tried to differentiate under the integral sign with respect to $a$, but something nasty appeared. Are there any other ideas?


I am not sure how to prove rigorously (using calculus) that $x^2=2^x$ has exactly $3$ real solutions.

How to solve this equation $$x^{2}=2^{x}$$   where $x \in \mathbb{R}$.  Por tentativa erro consegui descobri que $2$ é uma solução, mas não encontrei um método pra isso. Alguma sugestão?(*)  (Translation: By trying different values I've found that $2$ is a solution, but I couldn't find any method to this though. Any suggestions? )


I am trying to move very big file from one host to another host. Also the file names are too large so I have to use xargs. Also all the sub directories need to be copied also  I am using the below command in the source host current directory  find . -name "*" -type f -print0 | xargs -0 scp -r UserName@host:/path/to/destination   but it is throwing below error  scp: /path/to/destination: not a regular file

I want to find some files and then move them.  I can find the file with:  $ find /tmp/ -ctime -1 -name x*   I tried to move them to my ~/play directory with:  $ find /tmp/ -ctime -1 -name x* | xargs mv ~/play/   but that didn't work.  Obviously mv needs two arguments. Not sure if (or how) to reference the xargs 'current item' in the mv command?


I have two different layers, one is county boundary and another one is soil map.   My question is I would like to select only those areas which are outside the county boundary.   Using "Select by location" I can select every polygon located inside the county boundary but it is not what I need, I need only the unselected polygons.   What should I do?   I am using Arcmap 10.

I used the "create spatially balanced points" in Geostatistical Analyst in ArcGIS 10 to generate a large set of points with equal inclusion probability but a "spatially balanced" dispersal. I then buffered these using different buffer settings, with the idea of explicitly testing the influence of sampling unit size on population estimates (in my case, tree cover) using a fixed area sampled. This latter detail is key - I sum of the area for the sum of the selection of buffered points to be the same between comparisons. A toy example: what's the difference sampling 10 polygons 1 ha each in area (10 ha total) versus 100 polygons, each measuring 0.1 ha (again, 10 ha total). The point layer created by the tool qualitatively has the desired dispersion, but when you start buffering points, some start to overlap, reducing the total area (plus violating any possibility of independence between samples).   What I'm looking to for is an efficient way to find features that DO NOT intersect. I saw a post asking a similar question for PostGIS, but was looking for a way to approach the question using ArcGIS.


I would like to ensure that all figures in my document are referenced somewhere in the text.  With all the editing I've been doing, some of the figures are no longer being referenced and I would like to find out which (so I can either delete the figures or add appropriate references).  Is there a way (using a package, or custom function) to highlight or list any floats that do not have a corresponding \ref{fig:foobar} in the text body?  Example:  \documentclass{article} \usepackage{graphicx} \usepackage{flafter} \begin{document}  There's a lady who's sure all that glitters is gold (See Figure \ref{fig:gold}). And she's buying a stairway to heaven.  \begin{figure}[] \includegraphics{gold.png} \caption{Picture of gold} \label{fig:gold} \end{figure}  \begin{figure}[] \includegraphics{silver.png} \caption{Picture of silver} \label{fig:silver} \end{figure}  \end{document}   I'd like to run a function that tells me fig:silver was never referenced in the text  Note that I'm already using flafter to ensure floats only appear after they have been referenced.  Is there an argument I can pass to flafter or \listoffigures which has the functionality I'm looking for?

When writing documents, I consider it to be necessary that all figures and tables are referenced (\ref) in the text, whether or not I've remembered to \label them. LaTeX does not currently warn if a figure or table is not referenced. Is there a way to ensure that this is flagged up as a warning?  Note that I am specifically concerned about figures and tables, not chapter or section headings; it will be no good looking just at \labels that don't have an associated \ref.  In other words, it should report boo and not report bla in the following MWE:  \documentclass{article} \begin{document} \section{BLA}\label{bla} \section{BOO}\label{boo} In Section~\ref{bla} we do something. \end{document}


A disgruntled ex hijacked my Facebook account, which I abandoned years ago, and posted photos of me in compromised circumstances. I can no longer gain access to the account, and I don't remember the email address associated with it.  I've looked, and none of the categories on the FB help pages apply to my situation. I need the account, or at least the photos, deleted. Is there anything I can do to resolve this problem?

Someone has hacked my Facebook account and changed the password and I couldn't reset it following the regular steps.  Few days later, Facebook let me log in to my account but I'm not able to change my password since I don't know the old one now. What can I do?


I followed a guide to install ubuntu and put 20gb in '/' and the rest (150gb) in '/home'. I realized that everything I install goes to '/'. I am running out of space after installing Matlab, PyCharm, docker and still need to install many other stuffs. I don't know wtf '/home' is used for then. What are the dangers of allocating all my space to '/' ? Eg 200gb to '/' and 1 gb to '/home' for god knows what.  How can I make the Ubuntu installation / partition similar to Windows so I don't have to worry about partitions and shit EG: like a C drive for every effin thing ? I don't care if I lose everything if I do a re-install or upgrade Ubunutu.

i install ubuntu and followed a guide to put 20gb in '/' and the rest (150gb) in '/home'. Now i just found out that a lot of the things installed in ubuntu usually goes to '/' instead of '/home'. I have a lot more things to install.  So what is the point of '/home' ? How do I fix this ? Should I transfer 150gb from '/home' to / ?  Filesystem      Size  Used Avail Use% Mounted on udev            7.8G     0  7.8G   0% /dev tmpfs           1.6G  9.5M  1.6G   1% /run /dev/sda6        19G   16G  1.8G  91% / tmpfs           7.8G  676K  7.8G   1% /dev/shm tmpfs           5.0M  4.0K  5.0M   1% /run/lock tmpfs           7.8G     0  7.8G   0% /sys/fs/cgroup /dev/sda2        96M   29M   68M  31% /boot/efi /dev/sda8       159G  1.1G  150G   1% /home tmpfs           1.6G   56K  1.6G   1% /run/user/1000   what is /boot ? Its not '/' or '/home'


I am having trouble explaining what I really want...here is another try... On sheet The digits in range a5:a is multiply by 12,13,37,101,111 using the formula arrayformula(if(a5:a="",,a5*{12,13,37,101,111})).. the results are distributed across b5:f which is then conditionally formatted to highlight duplicates when compared to the list of digits in i5:I and k5:k.. This is working great.... But I to advance this setup.... I actually want the following... Once a duplicate is detected..... state's name and duplicate number (h5:I or j5:k)..is generated in the range B5:f or even A5:f .. thus displaying the state and exact number drawn in that specific state... And in the case where there are no duplicates....results from the arrayformula(if(a5:a="",,a5*{12,13,37,101,111})) Remains the same....until a duplicate is generated ....it is important to note that foundation of these data is scrapped from a webpage...I have got several help from persons online with the creation of formula as I develop the sheet

I have imported a webpage table in to Google Sheets. It frequently being updated. A series of calculations has been conducted on the sheet named Shawn Of the link spreadsheet.  I have filtered the my desired results into the Calculation sheet of that linked document... which is in columns A5:A. I then applied =ARRAYFORMULA(if(A5:A200="",,A5:A200*{12,13,37,101,111})) in columns B5. The Results of the formula extends from B5:F. This results from a5:F was subsequently conditionally formatted to highlighted duplicates in the aforementioned, i.e. a5:f using the lists of values in K5:K and I5:5. In Columns A5:F, is it possible to generate/place values in the range A5:f with matching name of states and aligned values in J5:K and H5:I?


The two planes in this image form an acute angle. What is its value?     Well, that's a confusing drawing. I don't even know why are there two $\theta$s there (or what do $S_1$ and $S_2$ even mean). Anyway, here are the equations:  $$x-3y+2z=14\\ -x+y+z=10$$  The angle is  $$\cos^{-1}\left(\frac{(1,-3,2)\cdot(-1,1,1)}{||(1,-3,2)||\cdot||(-1,1,1)||}\right)$$  That's like $107.97$ degrees. That's clearly not acute. Did I do something wrong?

I got to calculate the angle between two planes.  $$x-3y+2z=14\\ -x+y+z=10$$  As far as I am concerned, that's simply the angle between their normal vectors. And such vectors are $(1,-3,2)$ and $(-1,1,1)$. Therefore  $$\cos^{-1}\left(\frac{(1,-3,2)\cdot(-1,1,1)}{||(1,-3,2)||\cdot||(-1,1,1)||}\right)$$  Which is like $1.88$ radians.  Now then, to verify this I looked for online calculators, and I couldn't help but notice that all the calculators I found required to input the planes like this:  $$x+y+z=\color{red}{0}$$  See, they ask for plane equations to be equaled to zero. My questions are, then:   Do I need my plane equation to be equaled to zero to calculate such angle? Is there an advantage/disadvantage to having an equation equaled to zero? Is there a way to simplify my equation to equal it to zero?


I have 2 1TB drives that I set up in RAID0. Unfortunately, my old system is in pretty crappy shape and I might not be able to boot onto it. This means that the motherboard and old RAID controller are not available.  I can set up a RAID0 on the new system, but it's prompting me to create a new RAID. Will this erase/format the disks, or will it just set up the RAID and leave any existing data on the disks? This is extremely important because I have about 1.5TB of data on these disks that I absolutely cannot lose, and want to transfer onto a new 2TB disk.

My primary drive is a 250GB WD SATA drive. So, I added 2x 500GB 7,200 RPM WD SATA drives into my Windows Vista box and created a 1TB RAID0. I then formatted the the primary drive and installed Windows 7. To my pleasant surprise when I booted into Windows 7 my RAID0 was still intact and I kept trotting along the same as I did before.  Now I am replacing my motherboard, processor, and RAM and plan on formatting the primary 250GB drive again and using it to boot for a new clean install of Windows 7.  My question is: if I move these two SATA drives which are setup for RAID0 into the new system, install Windows 7 again, will the RAID0 remain?  Edit: Software RAID. I created it within Windows. The RAID0 does NOT contain the system boot partition.


I'd like to use a mid 2011 iMac screen as target video of my Dell PC (using dock station display link). I want to work on my Windows PC, but using 27" LCD monitor of my iMac.  How do I do it? Is it possible using software (display link?) or using a common USB cable?

Recently (less than one year ago) i bought an iMac 21,5". Now i would like to use it as secondary monitor for my laptop. (My laptop runs Windows 7).  Is it possible? (I found conflicting opinions on the web, even on the Apple forum).  What type of cable do I need? (I will appreciate also a link to the product on some online store: amazon, ebay etc.)  Thank you in advance.  UPDATE:  I tried air display... i'm not satisfied at all...  typical scenario: browser window on the main Windows laptop, dev tools/firebug on the secondary iMac screen. The mouse goes fast between the 2 screens (GOOD), but when i changed the selected tab nothing happens. I had to drag the dev tools window to the main screen to get an update of the selected tab.  My test is ended here.  I'm still waiting for other answers.   I will prefer an answer that suggest me what kind of cable i've to buy, and where i can find it on the web.


I have non-sudo ssh access to a server of which I want to know the list of users, I think the server is using ldap because:  -bash-4.2$ cat /etc/nsswitch.conf # /etc/nsswitch.conf # # Example configuration of GNU Name Service Switch functionality. # If you have the `glibc-doc-reference' and `info' packages installed, try: # `info libc "Name Service Switch"' for information about this file.  passwd: files ldap group: files ldap shadow: files ldap  hosts: files dns networks: files  protocols: db files services: db files ethers: db files rpc: db files  netgroup: nis   but:  -bash-4.2$ cd /etc/sssd/ -bash: cd: /etc/sssd/: No such file or directory   Please note neither of /etc/passwd, ls -lsa /varor getent passwd is giving the list I want (they don't even include my own username)  So, does anyone have any idea on how I can get the list of usernames and ids of this server?  -bash-4.2$ lsb_release -a No LSB modules are available. Distributor ID: Debian Description:    Debian GNU/Linux 7.11 (wheezy) Release:    7.11 Codename:   wheezy

I want to list all the users dirs on the machine.Usually, I will do:  ls -l /home   But I use it in a script that will be deployed on others machines and maybe on that machines they don't call it home (e.g. myHome). So I want to generalize it to ls -l ~. But it just lists my users home dirs instead of all users home dirs name (basically I want to get a list of the users names on the machine). How can I generalize it?


Say I am playing clash of clans or boom beach. A crash in the middle of an attack could be very fatal.  What happen is I was playing and then suddenly the screen go back to the home screen. No other apps are running. I can click the multi task button (or whatever button in bottom right) and the original apps shows up. However, it seems to be a crash because if I select it it reloads.  Does android have event logs I can check. What's going on? I got 4 GB memory. It's asus zenphone 2

There is a lot of interesting stuff in the Android system log, that is helpful in many ways   find root causes of problems identify misbehaving apps   How can I view and examine the Android log?


If a balloon bursts, then how should I tell about it to another person right after this event occurred?     the balloon has burst the balloon had burst the balloon has been burst the balloon had been burst the balloon burst (simple past)

Non-native speakers often get confused about what the various tenses  and aspects mean in English. With input from some of the folk here I've put together a diagram that I hope will provide some clarity on the matter.  I offer it as the first answer to this question. Consider it a living document. Input is welcome, and good suggestions will be  incorporated into the diagram.    Nota bene: What this is not is a discussion of whether there are  more than two tenses in English. , to which this question is not intended to supply arguments one way or the other.  Here, the aim is to provide an overview of what constructions English-speaking people use for conveying information about actions referring to past, present, and future, and to provide it first and foremost to precisely the people who are likely to use "tense" as a catch-all term in their search, rather than to linguists who know better.  Breaking News There is now an excellent ELU blog article titled  . It is highly recommended reading.


So... I have reacently installed windows 8.1 on my pc. Now i dual boot it with windows 7 and Ubuntu.On windows 7 i play minecraft and FTB with no problems. But, on windows 8.1 minecraft and FTB crashes before it even shows the Mojang logo it just crashes. The first line in the crash report is this: "org.lwjgl.LWJGLException: Pixel format not accelerated" I have updated java to 64bit. Also if i enter device manager in windows 8.1 after my graphics card it says microsoft Corp. Could that me the problem ?  PC: CPU: AMD Athlon 64 X2 Dual Core processor  6000+ @3.01 GHz  RAM: 5 GB DDR2  Graphics: ATI Readon HD 2600 PRO Memory: 2559 MB total aviable graphics memory  Windows 7 Profesional  and Windows 8.1 as OSs  If anything else is required for anyone, comment below.  Thanks in advance.

Similar to  on the bugs in Minecraft, I would like a complete list of what error codes exist in Minecraft and how they occur, as well as how they can be resolved.


I am trying to find the indefinite integral of $\lfloor \frac 1x \rfloor$  My attempt  Please be aware that what comes after this sentence is nothing more than my work. It makes to me, and a lot of it contains made up notations, a lot of which I have made up and are very difficult for me to explain and/or define clearly. If it makes no sense to you, feel free to ask, but since those things are tangential to the question, feel free to also ignore them and refer purely to my above queston.  So, since this is a piecewise constant function, I used the method of jump series to integrate it. I found the implied integral to be $x\lfloor x \rfloor$.  This means that the integral now equals $x\lfloor \frac 1x \rfloor - JS(x \lfloor \frac 1x \rfloor)$  Now, the piecewsie constant component troubles me. Because the function is infinite at 0, I cannot shift all of the disconnected pieces to line up with x = 0 held fixed (physically I mean). That would make the function infinite everywhere. Plus, I am not sure if the integral is divergent. I think the floor chops away enough area to make it finite. However, it throws me off.  Extra question  Assuming that the answerer understands my writing (or at least can understand my progression of computation), could the answerer find and compute JS(x * floor(1/x))? It shouldnt be too hard. (After all, it is just a matter of solving for it in the expression earlier mentioned involving it). If you cannot find it (doesnt reveal itself explicitly) or the weird notation confused you, feel free to ignore this "extra question". Its not relevant to the original question at the very top of this post, and as I said, these later sections pertain to my attempts, not neccessarily the solution that one finds. As they say, more than one way to skin a cat. Dont have to like my method to skin the cat. :p  Definitions (to help clarify things)  Implied Integral: A form of symbolic integration that holds all symbols of the form $\lfloor f(x) \rfloor$ constant. Implied Integration varies by piece-wise constants rather than constants. Eric Stucky more formally defined this concept  (note, I did not write that paper. 'Assistance' is merely credit to me making up this integral.)  Jump Series: The portion of a piece-wise continuous function (bounded or unbounded) that consists purely of jump discontinuities. The Jump Series will be a piece-wise constant function varying by a real number constant. If there is a jump from an infinite value to a finite value that cannot in some way be reduced down, we still consider the Jump Series to be existing, but either 'diverging' or 'unbounded'.  Integration Method of Jump Series: A method of integration where regular integration is split into an implied integral of the function being integrated minus the jump series of the aforementioned implied integral. This method is guaranteed to work so long as the final integral has a closed form. All of the operators involved are guaranteed to exist so long as the original function being integrated exists; however, the degree to which they can be expressed is... unknown.

How do you prove this identity:  $$\int_0^{n^2}\lfloor\sqrt{t}\rfloor dt = \frac{1}{6}n(n-1)(4n+1)$$  I'd very much appreciate your help on this one!


I currently play on Xbox one but I am looking to trade my Xbox for a Playstation 4, so that I can play with more of my friends. I know I've read about it not being possible to link accounts through PS4 and PC, but that's not really what I'm looking for.   Is it possible to link my account between the two consoles? Like being able to get my level and comp rating. Also, is it possible for me to transfer skins? I have a lot of legendaries and really don't want to lose them.

I have played a ton of Overwatch on console and am now am looking to make the most of my PC and play Overwatch there. Is there a way to transfer skins from console to PC?


I have  web site that as you can see on the top right has is a "Forums" button that links to my forums.   My problem is that if, for instance, I make a Google search "site:heliumscraper.com answers" I don't get any result, even though the word "answers" is in the forum's board index and it has been there for a few months already.  I don't have a robots file. I also uploaded a sitemap to Google that contained the forum. I'm thinking the problem might be the fact that the only link from my main page to the forum opens in a new window. Could this be the problem?

This is a general, community wiki  question and answer pair intended to address any questions   concerning the reasons a site or specific site contents do not appear   in search engine results.      If your question was closed as a duplicate of this question and you   feel that the information provided here does not provide a sufficient   answer, please open a discussion on .   My site (or specific pages on my site) is not appearing in search engine results.  Why isn't my content indexed and what can I do about it?


There's just one gym in my city and way to many players, so it's very competitive around here....i think i've read somewhere that this was suppoused to be a big feature for this game so i was wondering if it's possible to do so like right now or do we have to wait until an update that make that option avalaible?

After playing the game for a little while, I've noticed that Pokestops are chosen seemingly at random locations on the map. A few of them are even in inaccessible places; an abandoned church building, inside of an airforce base, etc. How are these locations chosen as Pokestops?


Let $H$ and $K$ be the finite subgroups of some universal group $G$. Define $$HK = \{hk \,| \, h \in H, k \in K \}$$ I want to prove that $|HK| = \frac{|H||K|}{|H \cap K|}$, where $|Q|$ is the number of elements in set $Q$. This was my process:  I proved that $H\cap K$ is also a subgroup. Think of $HK$ as a collection of left cosets of $K$ defined by $H$ i.e. $$HK = h_1 K \cup h_2 K \cup \ldots \cup h_{|H|} K $$ The set $HK$ as defined above has $|H||K|$ products. But if an element of $hk$ is repeated, we need to make sure we don't overcount. If $$hk = h'k' \\ hk = (ht)(t^{-1}k) \implies h' = ht, k' = t^{-1} k\\ $$ where $t \in H \cap K$. This tells me that each element of $HK$ has at least $|H\cap K|$ repetitions, each.  The problem I have is, how do I prove that if $t \in H$ but $t \notin K$, the statement $h' = ht, k' = t^{-1}k$ is untrue? Essentially, if $a \in G, b\notin G$, is it always true that $ab \notin G$? The closure property of groups states that if $a,b \in G$, then $ab\in G$. But it makes no mention of $a \in G$ and $b \notin G$. I feel like I am missing something obvious, but I can't place my finger on it...

Let $H$ and $K$ be subgroups of a finite group $G$.  A standard result is the formula $$\left|HK\right| = \frac{\left|H\right|\left|K\right|}{\left|H \cap K\right|}$$ for the cardinality of the set $HK$. The proofs of this that I've seen always involve some arbitrary choice, such as the choice of a transversal for $\{hK \colon  h \in H\}$. Is there a way to show that these quantities are equal without making such an arbitrary choice?  For example, can they be shown to be the respective dimensions of a pair of canonically isomorphic modules?


Have sort of a weird question. I'd like to create my own custom Ubuntu load, install specific software, change the interface and theme, then take that and create a live USB from it.   I'm making it for some people that are not computer smart, so I want to make it non-persistent, so if they mess it up, they can just reboot and have the exact same desktop from which they started. I was thinking maybe there is a way to convert a VirtualBox Ubuntu, or something like that. I'm not the best at the terminal, and I'd like to test it as I go to make sure that everything is working.  Any ideas?

I would like to customize Ubuntu live CD by installing some additional packages. I have followed   but it doesn't seems to work. Can anyone provide clear instructions?   Note: I do not prefer Remastersys, manual way will be appreciated.  Customization  Packages that I want to install:   Thunderbird    Samba    SSH       Changes that I need:   Remove Games menu from the Application menu Firefox shortcut on Desktop Radiance as the default Theme Different default Ubuntu Wallpaper   Configuration file changes   I want the panel to be placed at the bottom I want to paste my Samba configuration file instead of default Samba configuration I have few Firefox shortcuts and folders I would like to show that in Desktop Also it will be nice if you say me how to change the icon sets   Recent Updates   I have customized Ubuntu 10.10 with Firefox shortcuts and few folders on desktops. Everything went smooth. But the installer gets crashes after choosing the timezone. How do i fix this issue? Also setting wallpaper affects the login screen. The wallpaper which i set is displayed on the login screen also. I just want the default one for the login screen.


I am doing double-entry bookkeeping with GnuCash to track my personal finances.  Sometimes I spent money on expenses which my employer is supposed to spent, and I later get reimbursed. For example, I might need to go on a business trip or visit a conference, and I pay the flight, hotel, conference attendance fees with my private credit card. A few months later I get the money back from my employer as part of my salary.  I am unclear how to reflect both the laying out of the money, as well as being paid back, correctly in my double-entry bookkeeping.  For example, I just paid conference attendance fees from my credit card. I made an asset "Money owed to me by my employer", and book the transaction as a credit in the credit card account (type: credit card), and as a debit in the "Money owed to me by my employer" (type: asset) account. Is this the correct way to do it?  In one or two months my salary will be higher exactly by the amount I have spent (I don't get interest). How do I book this correctly?

I am new to accounting and trying to learn a few things as my accounts get more and more complicated.  I currently use GnuCash to record simple income/expenses/assets/liabilities and have had a new situation I don't know how to record.  I am currently billing some expenses for work and for my kayak club to my personal credit card.  Under normal circumstances I would do the following (my +/- may be backwards):  Expense +$100 Credit Card -$100  and then when the credit card bill comes I would pay it off  Credit Card +$100 Chequing Account -$100  For expenses that I get reimbursements for I would like to be able to note that I paid for the expense with my credit card and that I paid off my credit card with my chequing account.  At the same time, I would like to be able to create another parent account (maybe "claimable expenses") that shows that I purchased the item, and was then reimbursed so that an individual expense for work or my club has a zero balance.  I tried to look this up in previous threads but didn't quite understand how to apply this to my situation Any advice would be appreciated.


In the derivation of the LSZ reduction formula equation (5.21) Srednicki claims that in case of an interaction term in the Lagrangian density $a^{\dagger}(\textbf{k})$ will no longer be time dependent. Now does that mean that the only modification to the formula of $\varphi(x)$ will be a time dependence of $a$'s and $a^{\dagger}$'s? So is that like an ansatz we use for $\varphi(x)$? Now even if we do assume this form of $\varphi(x)$, in line two of the derivation he makes the substitution $$a^{\dagger}(\textbf{k},t)= -i \int\:d^3x \:[e^{ikx} \partial_0\varphi(x) - e^{ikx} ik_0 \varphi(x)]\tag{5.2}.$$ Now in the derivation of this formula if we remember we explicitly had to use the time independence of the $a$'s. So what am I missing in this derivation that justifies the substitution in the case the $a$'s are time dependent?

I was following Schwarz's book on quantum field theory. There he defines the asymptotic momentum eigenstates $|i\rangle\equiv |k_1 k_2\rangle$ and $|f\rangle\equiv |k_3 k_4\rangle$ in the S-matrix element $\langle f|S|i\rangle$ as the eigenstates of the full Hamiltonian i.e., $H=H_0+H_{int}$. Therefore, the states $|i\rangle=|k_1 k_2\rangle$ is defined as $$|k_1 k_2\rangle=a_{k_1}^{\dagger}(-\infty) a_{k_2}^{\dagger}(-\infty)|\Omega\rangle$$ where $|\Omega\rangle$ is the vacuum of the full interacting theory. Then the LSZ reduction formula connects the S-matrix element $\langle f|S|i\rangle$ to the Green' functions of the interaction theory defined as $$G^{(n)}(x_1,x_2,...x_n)=\langle \Omega|T[\phi(x_1)\phi(x_2)...\phi(x_n)]|\Omega\rangle.$$ Here are a few doubts. Doubt 1 When the particles are far away, the interaction can be considered to be adiabatically switched off. Therefore, at $t=\pm\infty$ the states are really free particle states and should have been written as $$|k_1 k_2\rangle=a_{k_1}^{\dagger}(-\infty) a_{k_2}^{\dagger}(-\infty)|0\rangle$$ and $$|k_3 k_4\rangle=a_{k_3}^{\dagger}(+\infty) a_{k_4}^{\dagger}(+\infty)|0\rangle$$ where $|0\rangle$ is the vacuum of the free theory.  I do not understand why these the states $|i\rangle$ and $|f\rangle$ are derived from $|\Omega\rangle$ instead of $|0\rangle$. Doubt 2 The initial and final states were derived from the vacuum of the interacting theory $|\Omega\rangle$. According to my understanding, this suggests that the states $|i\rangle\equiv |k_1 k_2\rangle$ and $|f\rangle\equiv |k_3 k_4\rangle$  are eigenstates of the full Hamiltonian $H$. Since then there is no perturbation, there should not be any scattering or transition at all.  More references Even Peskin & Schroeder, Bjorken & Drell, Srednicki take the same approach as Schwartz; they too define the external momentum eigenstates to the eigenstate of the full Hamiltonian $H$. However, if the system was initially in a stationary state why should it undergo a transition in absence of any perturbation?


On this machine, I installed Lubuntu 12.04 and then installed the ubuntu-desktop package. Now there is some Lubuntu software, such as the Lubuntu Software Center, Xscreensaver, and Abiword, that needs to be removed.   There are plenty of scripts online, like , that describe how to get back to a pure Ubuntu desktop (after installing the lubuntu-desktop package) by removing all the Lubuntu packages, that is, the packages that lubuntu-desktop depends on. Can I use that script to remove the old Lubuntu packages and fully migrate to pure Ubuntu? I am worried that the script may remove some packages, like libbluray, that Ubuntu needs.

I've install LXDE on my laptop due to Unity's disappointing performance. But now, I want to completely remove LXDE including it's entire list of programs that came installed with it. How do I go about doing so?


As far as I know, people suffer from the cold since ever. Why didn't and don't we evolve to resist it?

We all suffer from common cold, and that, frequently. Why have we not developed immunity against it till now? By immunity I mean immunity as a species.


Let $X$ and $Y$ be independent exponential random variables with parameters $a$ and $b$ respectively. Let $U=\min(X,Y)$ and $$V=\begin{cases}1,& U=X\\ 0,& U=Y.\end{cases}$$ Find the joint distribution of $(U,V)$.   Since the rv's are just exponential, then the distribution of $U$ is also exponential with parameter $a+b$. Also, $P(U = X)=P(X < Y)= \frac a{a+b}$ and $P(U=Y)=P(Y < X)=\frac b{a+b}$.  However, I cannot seem to use these info to come up with the joint distribution of $U$ and $V$. Can anyone help?

Assume that $X$ and $Y$ are independent random variables with $X \sim \exp(\lambda)$ and $Y \sim \exp(\mu)$. It is impossible to obtain direct observations of $X$ and $Y$. Instead, we observe the random variables $Z$ and $W$, where $Z = \min\{X,Y\}$ and $W =1$ if $Z=X$ and $W=0$ if $Z=Y$.  How to find the joint distribution of $Z$ and $W$?


sample log file:  apple AAA rose banana AAA tulip orange AAA marigold   replacement-text file:  111 222 333   Expected output:  apple 111 rose banana 222 tulip orange 333 marigold

I have an input:  a b TOCHANGE c d  e TOCHANGE   where I need to change the patterns "TOCHANGE" using an external file :  line1 line2 ...   so that I get the following output :  a b line1     c d e line2   I tried the following command :  while read k ; do sed -i "s/TOCHANGE/$k/g" input ; done < externalfile   but I got :  a b line1     c d e line1


I have a decimal to octal conversion function, and would like to call it with either an int or an unsigned int depending on some options. My first thought was to copy/paste the code and just change the parameter's type ... is there a better way ?

Is there any way to achieve function overloading in C? I am looking at simple functions to be overloaded like    foo (int a)   foo (char b)   foo (float c , int d)   I think there is no straight forward way; I'm looking for workarounds if any exist.


I see some PhD candidates except a supervisor, they do have a co-supervisor as well. What is co-supervisors duty? What are the advantages and disadvantages having a co-supervisor?

Are there any advantages or disadvantages in having two supervisors instead of one? Why would a graduate student want to do this or avoid this?  The context is in an MA where students usually have one supervisor and two committee members (examiners).


Inspired by , how long did it take to build the original Death Star?  Much of the dialogue in  indicates that the battle station is not "operational", but no mention is mead of how long it actually took to construct the station.  One could deduce that it took 19 years to build, since the construction begins at the end of  and is only just operational near the beginning of Episode IV, which is 19 years later.  However, it is equally as possible that the station has been built and ready for a while, but has simply not yet been used.  How long did the actual construction of the original Death Star take?

And not just any ships: battleships, super battleships and 'civilian' big ships.   From what I've read about the Star Wars Universe, given that it's science fiction, I never did understood how they could've build massive ships nor, I believe, read any preliminary explanations/details by authors.   Also, seeing some images of the fictional shipyards, they don't look impressive enough to give the idea that they could build massive [battle] ships in short periods of time. I mean, look at Kuat Drive Yards: a big ring around a planet. How many battleships, for the Republic or Galactic Empire, they could've build and how much time, as a whole for "one round" of ships, would it take?


In an attempt to find the optimal number of hidden nodes and number of training epochs (to obtain optimal performance while not over-fitting) in a single-hidden layer neural network, I generated the following figure.    The application is function approximation of temperature data and the error measure displayed in the figure is therefore mean square error (MSE) in degree Celsius squared. I used the Levenberg-Marquardt training algorithm and split the dataset into training(70%)-validation(15%)-test(15%) subsets. The neural network has 5 inputs and 1 output.  In Fig. a) the MSE falls to approximately 0.129 (training) and 0.144 (validation) at n=5 and remains there, meaning the network weights and biases have converged. However, in other applications, the validation error typically starts to increase at a given training epoch n (see for example Fig.1 in ). In such cases training should stop before this value of n. Why doesn't Fig. a) show this trend? Is there a neural network theorem or guideline stating what behaviour can be expected for different types of applications?  Similarly, in Fig. b) it seems that all errors continue to decrease. How should the optimal number of hidden nodes be selected given such a graph? Should I evaluate the number of hidden neurons at much higher values? (beyond $N_h$=98 I run into memory problems...).

I have a neural network with 3 hidden layers and I'm unsure about the number of hidden nodes for each layer.  Should the number of hidden nodes stay constant between the hidden layers, e.g. 500 nodes for each layer, or should it decrease or decrease?   Is there some rule about how to choose the number of nodes per hidden layer?


English is my second language and I have always been confused with 'have been/has been' and the idea that it could be replaced with 'was' in some contexts.  For instance, this is a part of an urgent email about a bomb threat:     An unconfirmed bomb threat has been received. The halls are being evacuated. More info to follow.   My doubt is: why couldn't it be 'was received' and what that would change?  Another example:     The thumbnails base has been updated.   Many times, I see 'have/has been' in something that could be 'was' from my understanding.  This is a question I have been asking myself for a long time.  I would appreciate if someone could help me.  Thank you!

Non-native speakers often get confused about what the various tenses  and aspects mean in English. With input from some of the folk here I've put together a diagram that I hope will provide some clarity on the matter.  I offer it as the first answer to this question. Consider it a living document. Input is welcome, and good suggestions will be  incorporated into the diagram.    Nota bene: What this is not is a discussion of whether there are  more than two tenses in English. , to which this question is not intended to supply arguments one way or the other.  Here, the aim is to provide an overview of what constructions English-speaking people use for conveying information about actions referring to past, present, and future, and to provide it first and foremost to precisely the people who are likely to use "tense" as a catch-all term in their search, rather than to linguists who know better.  Breaking News There is now an excellent ELU blog article titled  . It is highly recommended reading.


I have recently moved from Windows to OSX. I work with multiple screens, so was used to losing the cursor on occasion.  There was a setting in Windows to highlight the cursor location by pressing Ctrl. Is there a similar setting in OSX?

Due to a stroke, I have had some vision impairment in that I sometimes have a hard time locating my mouse pointer on the screen.  I have tried making the mouse pointer larger which helps but is still not the solution.  I am new to the Mac world and would appreciate your help.  In Windows, there is an option where pressing the CTRL key will help to identify the mouse pointer using a temporary display of several radiating concentric circles around the mouse pointer.  Is there something like this on OS X?


I have a character pointer of hex values like as follows. a= {0x01, 0x02, 0x00, 0x03, 0x04, 0x05, 0x00}; I have to find the length of the above array. But strlen gives 2 and sizeof gives 4(char pointer size). How can I find the length? I receive the character array from a socket.

First off, here is some code:  int main()  {     int days[] = {1,2,3,4,5};     int *ptr = days;     printf("%u\n", sizeof(days));     printf("%u\n", sizeof(ptr));      return 0; }   Is there a way to find out the size of the array that ptr is pointing to (instead of just giving its size, which is four bytes on a 32-bit system)?


Is there a method that, for a given $x\in \mathbb R$ finds the closest number in the ring $\mathbb Z[\sqrt2]$? It is trivial for $\mathbb Z$ and also for comlex rings of integers like $\mathbb Z[i]$ (if we $\mathbb R$ by $\mathbb C$). The problem is I don't even see a reason why there should be a closest number of the required form. I actually think that you can get as close as you want to $x$ by the numbers $a+b\sqrt2$. But I am unable to prove that. Do you have any ideas?

I've looked for help with this question but I have not found anything, I hope this is not a duplicate.  Define the set $A=\{\mid x+y\sqrt{2}\mid \ : x,y\in \mathbb{Z}\ \mbox{and} \mid x+y\sqrt{2}\mid\gt0 \}$, prove that the infimum of this set is zero.  This is what I've thought: Proving that $[y\sqrt{2}]$ (where $[\cdot ]$ is the floor function) can be close to zero as we want would prove the proposition, so I suppose that this doesn't hold and I want to arrive to the contradiction that for some $y_0$: $[y_0\sqrt{2}]=0$, this would contradict the fact that $\sqrt{2}$ is irrational.  Can someone give me a hand? Thanks! (This problem arised in the context of integer lattices)


I understand that in regular fusion, you use high levels of heat to accelerate atoms to speeds high enough to overcome nuclear force.  What method would be used to achieve ?

Cold fusion is being mentioned a lot lately because of some new setup that apparently works. This is an unverified claim.  See for example:         ( of that last link in the Wayback Machine, given frequent  from that page.)   While we should give the scientific community time to evaluate the set up and eventually replicate the results, there is undoubtedly some skepticism that cold fusion would work at all, because the claim is quite extraordinary.  In the past, after Fleischmann and Pons announced their cold fusion results, in perfectly good faith, they were proven wrong by subsequent experiments.  What are the experimental realities that make Fleischmann and Pons style cold fusions experiments easy to get wrong?  Would the same risks apply to this new set up?


My question is about the market cap figure on coinmarketcap.com and dealing with crypto currencies.  So yesterday the market cap was at 720 billion dollars. Today it's below 600b$.  Does this mean that people have converted 120b$ worth of cryptocurrency into regular currency?  I mean, I get that the value of a specific coin is driven by the number of people buying vs selling. But if they would sell crypto A and for the same amount buy crypto B, wouldn't the total market cap remain the same?

The share price went up about 6.9%, and the market cap is $466 billion. Does that mean that that much new money had to have been invested after hours? Would it otherwise be possible for the stock price to go up like that?


I am attempting to generate confidence intervals for a neural network, according to the article , one would bootstrap from the training set to generate new models several times, and then apply the model to the validation set n number of times to generate the relevant statistics.  Is there another way to generate confidence intervals that doesn't require retraining the network? Retraining the network is very computationally intense and requires a great deal of time-- so I would like to avoid it if at all possible.  Thanks so much!

To illustrate my question, suppose that I have a training set where the input has a degree of noise but the output does not, for example;  # Training data [1.02, 1.95, 2.01, 3.06] : [1.0] [2.03, 4.11, 5.92, 8.00] : [2.0] [10.01, 11.02, 11.96, 12.04] : [1.0] [2.99, 6.06, 9.01, 12.10] : [3.0]   here the output is the gradient of the input array if it were noiseless (not the actual gradient).  After training the network, the output should look something like this for a given input.  # Expected Output [1.01, 1.96, 2.00, 3.06] : 95% confidence interval of [0.97, 1.03] [2.03, 4.11, 3.89, 3.51] : 95% confidence interval of [2.30, 4.12]   My question is how can a neural network be created such that it will return a predicted value and a measure of confidence, such as a variance or confidence interval?


I have some code where I add a button dynamically to the page.  Next   I am using the .on() method with the selector parameter but nothing is happening when I click the button. I saw that other people had a similar problem for dynamically added elements but they were missing the selector and adding it solved it.  $(".next").on("click", ".next", function() {      alert(“next page");  });   I've put the button in the main body of my page when it loads and it works fine. It just doesn't work when it gets added to the page later.

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


Say that $S$ contains binary strings of length $n$ s.t. no two strings in $S$ differ in exactly one position.  How would I prove that $S$ contains no more than $2^{n-1}$ strings (Note $n$ can be any positive integer)  I can't seem to find a way to do even start this problem.

Let $n$ be a natural number and $X$ = {$1,2,...,n$}. For subsets $A$ and $B$ of $X$ we deﬁne $A\Delta B$ to be the set of all those elements of $X$ which belong to exactly one of $A$ and $B$. Let $F$ be a collection of subsets of $X$ such that for any two distinct elements $A$ and $B$ in $F$ the set $A∆B$ has at least two elements. Show that $F$ has at most $2^{n-1}$ elements. Find all such collections $F$ with $2^{n−1}$ elements.  I have no clue on how and where to start. Please help.


I am wondering what the difference is if I put   Both refer to string foo = "world";   Console.WriteLine("Hello" + foo); //Concatenation    and    Console.WriteLine("Hello {0}", foo); //Whatever this is called (still a beginner guys)

Let's say that you want to output or concat strings. Which of the following styles do you prefer?   var p = new { FirstName = "Bill", LastName = "Gates" }; Console.WriteLine("{0} {1}", p.FirstName, p.LastName); Console.WriteLine(p.FirstName + " " + p.LastName);   Do you rather use format or do you simply concat strings? What is your favorite? Is one of these hurting your eyes?  Do you have any rational arguments to use one and not the other?  I'd go for the second one.


This might be a collision with markdown support in chat, but it gets very annoying when you want to post images from e.g. ebay as they almost always contain the dollar sign, e.g.  http://i.ebayimg.com/t/00/s/MTAwMFgxMDAw/z/K~IAAOSwMpZUqz7i/$_12.jpg   When you post that in chat, the outcome is:     $_12.JPG   which is unexpected as well as unusable.

It appears that the onebox (and link-detecting, for that matter) mechanism is broken by special symbols (see ). For example, the URL https://stackapps.com/questions/2177/stackexchange™-supercollider-freehand-circle™-editor-now-supported-on-every-s#comment10630_2177 is registered in chat (and on sites) as https://stackapps.com/questions/2177/stackexchange (which still works, but doesn't jump to the specified comment). If you need any more proof than that, look at what it does here:


I have one column in my query and multiple rows (100+). I need to have the rows combined with only a space between so that I end up with one row.  Example:  1 2 3 4 5   Would actually be  1 2 3 4 5

Consider a database table holding names, with three rows:  Peter Paul Mary   Is there an easy way to turn this into a single string of Peter, Paul, Mary?


I just want to check my idea for what exactly is meant by ${\vdash}$ and ${\vDash}$ is correct (I am a noob to logic). ${S\vdash t}$ means "$t$ is provably true using finitely many elements of $S$ within that system", whereas ${S\vDash t}$ means "$t$ is true given $S$", but doesn't make any statements about whether we could prove it within that system $S$. Is this essentially correct? Thank you.

My current understanding:  $\vdash$ is "syntactic consequence", e.g. if we have $a \vdash b$ it means if we've written down $a$ as something we know, we can immediately write down $b$ as something we know. This is saying nothing about whether any of these pieces are true, false, something else, etc, it's just saying that we can say something about $b$ by virtue of being able to say something about $a$.  $\vDash$ is "semantic consequence", e.g. if we have $a \vDash b$, then it (usually) means if $a$ is always true in every interpretation (i.e. no matter how we mess with any of the underlying variables driving $a$'s valuation), then $b$ is true as well. However I don't know if this is necessarily just a "true"-only thing. It seems conceivable that we could make one for falsehoods too, i.e. if $a \vDash b$ might mean if $a$ is always false then $b$ is always false, of if $a$ is always "dog" then $b$ is always "dog", etc. But I am unsure of this one.  $\to$ is material implication, which exists solely within the logic system (as opposed to the previous two metalogical relations) and has a specific semantic meaning / definition in terms of a truth table in something like prepositional logic ($a \to b$ is always true unless $a$ is true and $b$ is false). It's defined this way simply because it is a helpful / useful model to describe things like "whenever $a$ is true, $b$ is true".  Do I have the right idea so far?


A nucleus and an electron attract each other, so if they are to remain apart, the energy of the electron’s movement must balance the energy of attraction. However, the laws of physics had previously established that a charged particle moving in a curved path must give off energy. If this requirement is applied to an orbiting electron, why did not the electron continuously lose energy and spiral into the nucleus?

I'm having trouble understanding the simple "planetary" model of the atom that I'm being taught in my basic chemistry course.   In particular,    I can't see how a negatively charged electron can stay in "orbit" around a positively charged nucleus. Even if the electron actually orbits the nucleus, wouldn't that orbit eventually decay?  I can't reconcile the rapidly moving electrons required by the planetary model with the way atoms are described as forming bonds. If electrons are zooming around in orbits, how do they suddenly "stop" to form bonds.     I understand that certain aspects of quantum mechanics  to address these problems, and that there are  of atoms. My question here is whether the planetary model itself addresses these concerns in some way (that I'm missing) and whether I'm right to be uncomfortable with it.


The biggest plan in defeating Voldemort is to hunt down and destroy all his Horcruxes, and a significant part of the last two books is spent doing this. Dumbledore, the most powerful wizard able to stand up against Voldemort, risks and sacrifices his life for it.  This is justified by Voldemort being immortal until all the Horcruxes are destroyed, so there is assumed to be no point in trying to kill him before that. But this justification doesn't make sense, for many reasons:   if he is killed again (in an ambush, in a fight, or an assassination), even if he doesn't truly die, his body will be killed, and he will spend a lot of time in a weakened state. Last time it happened, his side collapsed completely as soon as he died, and he needed 14 years to come back (the first 10 years of that being in a complete state of helplessness). It would be much easier to hunt for the Horcruxes while Voldemort was a weakened disembodied spirit and his supporters hiding or in Azkaban, than doing the same while Voldemort is in power, in the control of the Ministry, and you have to be constantly on the run from his goons. what if not all Horcruxes are identified correctly? The identity of most of them were just educated guesses. If Voldemort was even just slightly smart, he would have created one out of a pebble and hidden it in a desert. Or made it out of something heavy and dropped it into a volcano to sink deep into the Earth's mantle. even if not all Horcruxes could be found and destroyed, there are many other ways of permanently stopping him. Stun him, grab the body, then Obliviate all his memories. Or, if you aren't too morally restrained, then Crucio him to complete insanity. Or transfigure him into a piece of rock and bury it deep underground. Or place him in Azkaban, where he cannot use magic. And do it as soon as possible, instead of waiting until his followers get more and more numerous and gather more and more political power.   Am I missing something which makes it logical to try to find and destroy all Horcruxes before any attempt is made to attack Voldemort directly?

In Half Blood Prince, Dumbledore tells Harry that:     "The seventh part of his soul, however maimed, resides inside his   regenerated body. That was the part of him that lived a spectral   existence for so many years during his exile; without that, he has no   self at all. That seventh piece of soul will be the last that anybody   wishing to kill Voldemort must attack — the piece that lives in his   body.”      — Half Blood Prince, Chapter 23, Horcruxes.   Why does the master piece that lives in Voldemort have to be the last?  If Voldemort was killed*  in the usual way (as he was in 1981), i.e., this master piece was ripped of his body and then all his Horcruxes were destroyed, would he not be finished for ever, and meet the same fate in eternal limbo as he did at the end of Deathly Hallows?  The natural answer seems to be affirmative, if not for the fact that Dumbledore explicitly uses the word 'last'.  If no, what would happen in the alternate scenario described above?  I vaguely remember some mention of this problem in this site, but it could have been in the comments.  *I must clarify that 'kill' here must refer to ripping the (part of his) soul in his body, allowing for the possibility that he might regenerate, as opposed to the ordinary usage of the word 'kill', which leads to death for unhorcruxed people.


New to Ubuntu 14.04. Want to install adobe flash plug-in which I picked from the Ubuntu Software Center. After clicking on Install I have a choice of what application I want to use. When I choose the appropriate software i.e. (APT for Ubuntu 10.4+) the System is asking what launcher I will use to install. I have no clue what to answer/pick. Any assistance would be greatly appreciated.

Even though I have the latest Adobe Flash player 11.2 for Linux in Firefox -   - a particular online flash game still requests that I update to the latest flash player.  I've tried this online game on my laptop (Windows 8 with Flash Player 11.8) and it has no problems.  Is there a way to trick Ubuntu or this game into thinking Flash Player 11.8 is "installed"?


Any welcome text, modifying PS1, aliases not working after restart.  I have to put "source ~/.profile" every new terminal i open.  Wishing for complete fix for these all to effect everytime on launching terminal.  USING Ubuntu 14.04

Currently it is:   michael@Castle2012-Ubuntu-laptop01:~/Dropnot/webs/rails_v3/linker/spec/controllers$   Outside of renaming my machine and directory structure...  How could I make it be something more like:  michael:controllers$


In Minecraft how do you stop squids from despawning without name tags!

Is there any way for which we are able to stop a zombie from de-spawning no matter how far we go? If so, what are all possible ways?  Bonus question: what are all the other techniques for which we can prevent a zombie from de-spawning within a specific block radius?


I have a long word that describes all the values, so I don't want this big gap between A and B. The gap should be everywhere the same, so the word foooooo should not affect the gap between the values.   How to fix this?     \documentclass{article} \usepackage{booktabs}  \begin{document}  \begin{tabular}{@{} *5l @{}}    \toprule \emph{name} & \emph{fooooooo} &&&  \\\midrule Models    & A  & B  & C  & D  \\   Model $X$ & X1 & X2 & X3 & X4\\   Model $Y$ & Y1 & Y2 & Y3 & Y4\\\bottomrule  \hline \end{tabular} \end{document}

I have this table, but wanted to format the first row. I like to match the two columns of first row, and last two columns of the same first row. Any suggestion on how to do that?  \begin{table}[!h]  \caption{Comparison of percentages.} \begin{tabular}{lclclclclc} \hline \hline  Mode &  Var  &  Cum\\ \hline {}       & EF   & CHF    & EF2   & CHF2\\ 1   &  17.5 & 19.1   & 17.5  & 19.1\\ 2   &  11.8 & 12.7   & 29.3  &  31.9\\ 3   &  6.6  &  5.6         & 35.9    &  37.4\\ \hline \end{tabular} \end{table}


We have an AOAG named with "space" and I need to rename it to not have "spaces". It was created before my time. The 3rd party vendor tool does not work with AOAG that has spaces. There are about 40 databases in the AOAG (SharePoint).  The property is greyed out in SSMS. Is there another option? As this is production, I am looking for a solution with minimal downtime.  Thanks much, Debbie

I have two questions for you guys. I really appreciate your help.  1.- Is there a way to rename an Availability Group?  2.- Is there a way to get the T-SQL statements in order to re create a Availability Group in case that I need to drop it and create it again?  If there's information that you want me to share, please let me know and I will provide it.


I'm fairly new to contributing, but I've been trying to flag questions that are obviously off-topic when I see them.  Most of my flags get responded to almost immediately, but it seems like some linger for a long time, and I'm just kind of curious why.  Example:   It's clearly off topic, I voted it as off-topic, but it's still active almost a month after my flag.  It's not a big deal, I'm just curious why.  Thanks!

I have flagged the following question as a duplicate.    Now I want to know: after how long time will it be stated as active?  I do not have problem with anything here. I just want to know after how long time the request (of a duplicate question) will automatically be rejected or approved.  OK, I got the things, so it will remain active until moderators will have a look at it...  But don't you think we should have a limit that after a certain number of days this kind of request will be dropped (or cancelled)?


Just out of curiosity: When I open the GNOME System Monitor, there is always a  of the window. It doesn't disappear when I drag the window around or close and relaunch the application. It does not affect the functionality by any means, but I wondered how it comes that I observe this phenomenon always and exclusively for this application. I'm using Ubuntu 18.04.3 LTS, System Monitor version 3.32.1-3-g0ea89b4922

All snap apps seem to have broken close buttons. This can be seen for the Gnome System Monitor and Gnome Calculator. Apps installed via apt look good (Gedit and Gnome Terminal). Is this a known problem for Ubuntu 19.10?    echo $XDG_CURRENT_DESKTOP  sadf   gsettings list-recursively | egrep "gtk-theme|icon-theme"  org.gnome.desktop.interface icon-theme 'Adwaita' org.gnome.desktop.interface gtk-theme 'Adwaita'


Version 1.5.0 brought the new Appraise feature to Pokemon GO, as an added option in the menu button on individual pokémon:     What's New in Version 1.5.0 Posted August 23, 2016         Implemented Pokémon Appraisal: Trainers will now be able to learn about a Pokémon's attack and defense capabilities from their Team Leader (Candela, Blanche, or Spark) to determine which of their Pokémon have the most potential for battle.      The output of using it on a particular pokémon seems to be referencing what we've come to know as . Do these descriptive phrases represent IVs, and if so how accurately do these correlate to specific IV numbers?  Put another way, how useful is the new Appraise feature as a replacement for IV calculators?

The new update to Pokémon go brought Pokémon Appraisal to the game. The information it tells you I'm still trying to decipher. For example, when I apraise my strongest Pokémon a 1500 CP Vaporeon, I get the following information:  Overall, your Rainer is a wonder! What a breathtaking Pokémon! I see that its best attribute is its Attack. Its stats exceed my calculations. It's incredible. Your Rainer is tinier than any we have on record. Astounding.  The first line seems like just filler and the last line is already denoted by the size markings on my Vaporeon. I get the general idea that it is statistically strong and it has good attack from lines 2 and 3, but does it mean that the attack IV is perfect? How exactly do you relate the appraisal to your Pokémon's stats?


is there some way to make the items in enumerate, itemize, and similar environments right aligned instead of left aligned. I'm thinking sort of like what the equation environment does automatically numbering equations, but which would work the same way for other kinds of propositions. Something like this:  A=B, according the ...    (1)  B=C, since every ...      (2)  (1) & (2) --> A=C         (3)

I'm trying to put equation numbers next to text as if said text was an equation. If I use \text{} in an align* environment, it typesets the text right-aligned and the whole environment centered, but that's not what I want. I would like the text to look like in an itemize or enumerate environment (for example, indented), but still with an equation number behind it. And that equation number should come from the regular equation number "pool".  Ideally, it would look like this:  We have to make sure that:   A is very b,             (1)   A is not c.              (2)   How can I write this in LaTeX?


These days, whenever I encounter a CAPTCHA, instead of verifying with pictures or the usual, 85 tells me download apps and run them for 30 seconds. These apps usually require a monthly subscription and other things I'm not willing to do. Is it just me, or are there also people out there with the same problem?

When I get a captcha on Stack Overflow, I don't see the image or the input box with Firefox. I originally had the "HTTPS Anywhere" extension installed but still have the same issue when it's disabled (This caused issues previously when Google's SSL certs were expired for an old domain IIRC).  The requests to Google seem to be never-ending; browsing to the URLs that are still loading results in some pages of JavaScript, but no errors as you'd hope.  The screenshot was taken after the page had been open for more than 3 minutes, and I'm not sure why the GETs are still running. The request popup visible in Firebug is for "GET challenge?k=...."  When browsing to the same captcha page in IE, there are no issues.  I'm aware this could be an issue with my Firefox configuration, as opposed to the site, but would appreciate it if someone could verify if it's just me, and suggest a fix.  EDIT   While visiting the Recaptcha site, I can see a Captcha with no problems If I right-click the problem URLs in FF and Open in new tab, the pages load fine. From the fact that FB omits IP Addresses for the problem ones, I assume that it's not even opening a connection (nor perhaps performing a DNS lookup) Other sites that use Recaptcha seem to work fine (I picked 3 at random from Google)


Is there a word or phrase for describing a person who is always curious? Curiosiac?  Example usage (as requested by a comment):     The boy is such a ___, he asks questions all the time!   UPDATE  I appreciate all your answers, but my question was if there was any word - a noun - to describe a person of that kind, e.g. maniac, lunatic, weirdo, nerd, etc.

I am writing a note in which I want to ask (curious) readers to refer another paper. The phrase curious minded comes to mind, but it seems somewhat awkward.  Is there a better way to convey similar import?


Is it:     a spectacular movie   or it is said:     an spectacular movie   I'm writing a book in English but I'm Latino so I might need some help with this, I'd appreciate it a lot

Which indefinite article should precede hour — a or an?        an hour     a hour      Does the usage of an vs a depend on the pronunciation — a history, a hobby, but an hour, an honor?


I am generating a pdf with pandoc (source is markdown) and as latex formatting is want to do, the images sometimes go onto the next page and not exactly where they are inside the content.    This is okay, but my latest version of a document has an image which is intersecting a code block.  code here   IMAGE + image tile  code continues   For obvious reasons this is jarring and not what I expected to happen.  Is there a way to fix this?  I do not want to inline the image (everything about how the image is displayed is how I want it, except its location).  Thanks!

I am using pandoc to convert markdown to pdf, but I need to place some figures with more formating than the     ![Alt text](image.png)   so I use something like this:    # Document with figures    This document have figures but they appear before the title    \begin{figure}   \centering   {\includegraphics[width=2.5in]{some_figure.png}}   \caption{Comparing Dq from different p-model}   \end{figure}   and then I use the following command:   pandoc -H test_fig.sty test_fig.md -o test_fig.pdf   and test_fig.sty have:   \usepackage{graphicx}   the resulting pdf have first the figure and then the title.


How many $\alpha \in S_n$ are there with $\alpha^2 = 1$?  I want to use just linear algebra, I have done it using combinatorics but in class that does not work, can I get a little help? What I know is that  (i j) = (j i) and (i j)(k I) = (k l)(i j).

This is not for homework, but I am not great at counting arguments and would like some feedback.  The question asks     Let $n \in \mathbb{N}$. How many $\alpha \in S_n$ are there such that $\alpha^2 = 1$?   I know that, if $\alpha^2 = 1$, then either $\alpha = 1$ or $\alpha$ is the product of disjoint transpositions.  If $\alpha = (i, j)$ is a single transposition, then there are $\frac{1}{2^1 \cdot 1!} \binom{n}{2}$ such $\alpha$ (the $2^1$ and $1!$ are put in the denominator to help in noticing the pattern later).  If $\alpha = (i, j)(k, l)$ is the product of $2$ disjoint transpositions, then there are $\frac{1}{2^2 \cdot 2!} \binom{n}{2} \binom{n-2}{2}$ such $\alpha$, where the $2^2$ appears in the denominator to account for the cyclic permutations of each transposition, and the $2!$ appears to account for the permutation of the transpositions themselves.  If $\alpha$ is the product of $3$ disjoint transpositions, then there are $\frac{1}{2^3 \cdot 3!} \binom{n}{2} \binom{n-2}{2} \binom{n-4}{2}$ such $\alpha$.  Extrapolating from this, I find that the total number of $\alpha \in S_n$ such that $\alpha^2 = 1$ is $$ 1 + \sum_{i=1}^{\lfloor \frac{n}{2} \rfloor} \frac{1}{2^i \cdot i!} \prod_{k=0}^{i-1} \binom{n-2k}{2}. $$  Does this look OK?  It looks like a rather ugly answer to me, so I have my doubts.  Any input would be welcomed.