I am completely new to the world of mortgages and home loan lending, and I am looking to buy a new house. I am either looking to take out a traditional mortgage or a home equity loan on a house that I own with my parents (which has been mostly paid off now).  I really have no idea how to begin this process. I got some  , but I am still not clear on how to start shopping around for the best loan.  Should I go to my local bank and speak to someone there, or lendingtree.com, or hire a realtor?  (Please do not consider this question subjective, I am just looking for advice and not necessarily the "right" answer).

I have already been prequalified with 3.8% (but I am sure I can do better :)). Now, I am about to make an offer on a house. So, once the seller accepts my offer, how do I rate shop ?    Do I need to do the rate shopping before making an offer, or after the seller accepts my offer ?  When the seller accepts my offer, then I will go to a banker and submit a full application, so will it be legally binding for me to go with the approved mortgage application ?  Or, once the seller accepts my offer, may I simultaneously apply for a mortgage with 3-4 bankers, and then choose the lowest rate ?     I asked my realtor, but she recommends to go with just one banker (her friend), and not to do any rate shopping. Is it the right way ?   (I live in a state of Arkansas, so I am thinking of going with the local bankers)


Is it possible to know how many views form unique IP addresses a shared question has received to track Announcer, Booster, Publicist badges?

I shared a link to a question and now I am wondering whether I am almost going to get an announcer badge.  Can I somehow see which links I shared and how many clicks were on it for the last days?  Update:  Maybe this would be a nice feature. Next to any question you can see who has promoted it the most (number of fresh hits from a referer link) and also the amount of new ip's through search engine's and other referring sites.  Note the progress feature should include the Announcer, Booster, and Publicist badges.


i have a problem when calculating floating point in python, here is an example:  import numpy print numpy.floor(3*1.4+2*1.4) >> 6.0   it return 6.0 while i am excepting 7.0  i can fix this simply by  print(numpy.floor( (3*100*1.4*100 + 2*100*1.4*100) / 10000 )) >> 7.0   but seems its not a very good practices, i have google for a while and try a different type of numpy.float, Decimal, int etc. The problem is still persist. Does anyone have any idea better than this?

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


Are fillers "approved" by the original author (i.e. the mangaka) or do studios just write fillers and hope for the best?

Fillers are a given in most long running anime. If the anime is based on a manga then who writes the plot for the fillers?  Who decides the plot story for a filler season, so that it, for example, doesn't conflict with the original story of the manga?


My build is modifying a large file (~256MB) and I want to diff it to the pristine copy. Using a diff tool takes too long and listing the contents is enough for me.  I can do this to list the current contents   unzip -l build.war > current.txt   How can I get the unmodified copy from git (so that I can do the same thing then diff the text files)? Ideally I don't want to reset the current copy (i.e. I want to leave it in its current modified state)

I have a Git repository and I'd like to see how some files looked a few months ago. I found the revision at that date; it's 27cf8e84bb88e24ae4b4b3df2b77aab91a3735d8. I need to see what one file looks like, and also save it as a ("new") file.  I managed to see the file using gitk, but it doesn't have an option to save it. I tried with command-line tools, the closest I got was:  git-show 27cf8e84bb88e24ae4b4b3df2b77aab91a3735d8 my_file.txt   However, this command shows a diff, and not the file contents. I know I can later use something like PAGER=cat and redirect output to a file, but I don't know how to get to the actual file content.  Basically, I'm looking for something like svn cat.


I'm getting that error eventhough the name of my function is different from that of my variable inside the function. import pandas as pd  df = pd.read_csv('file.csv', usecols=('Date','Col2','Col3'))  def foo():     df['Date'] = pd.to_datetime(df.Date)     df = df.dropna()     return df print(foo())  Here's the error that I'm getting: df['Date'] = pd.to_datetime(df.Date) UnboundLocalError: local variable 'df' referenced before assignment  What should i do to resolve the issue?

The following code works as expected in both Python 2.5 and 3.0:  a, b, c = (1, 2, 3)  print(a, b, c)  def test():     print(a)     print(b)     print(c)    # (A)     #c+=1       # (B) test()   However, when I uncomment line (B), I get an UnboundLocalError: 'c' not assigned at line (A). The values of a and b are printed correctly. This has me completely baffled for two reasons:   Why is there a runtime error thrown at line (A) because of a later statement on line (B)? Why are variables a and b printed as expected, while c raises an error?   The only explanation I can come up with is that a local variable c is created by the assignment c+=1, which takes precedent over the "global" variable c even before the local variable is created. Of course, it doesn't make sense for a variable to "steal" scope before it exists.  Could someone please explain this behavior?


My Analytical Mechanics class this quarter has one required textbook:   "Classical Dynamics of Particles and Systems" by Thornton & Marion   and three recommended readings:   "Mechanics" by Landau and Lifshitz "Classical Mechanics" by Goldstein "Modern Analytical Mechanics" by Pellegrini & Cooper   Due to time constraints, I won't be able to read all of them, so I am wondering if any of you are familiar with these books and would be able to make suggestions as to which I should read this quarter.  These books seem to cover the same topics, though perhaps from different perspectives and cover different aspects of those topics.  Or would you suggest that I stick to the required book, and refer to the recommended books when I get confused?  It seems my professor uses a lot of the same notation and terminology from Landau's book during his lectures, so that book is probably also a "required" to some degree.

I'm a bachelor student majoring in math, and pretty interested in physics. I would like a book to study for classical mechanics, that will prepare me to work through . What books would be good for a beginner?


I know a proof which starts with proving the convexity for "dyadic rational" numbers. I would like to know if someone has some other ideas.

Let $\,\,f :\mathbb R \to \mathbb R$ be a continuous function such that $$ f\Big(\dfrac{x+y}2\Big) \le \dfrac{1}{2}\big(\,f(x)+f(y)\big) ,\,\, \text{for all}\,\, x,y \in \mathbb R, $$ then  how do we prove that $f$ is convex that is $$ f\big(tx+(1-t)y\big)\le tf(x)+(1-t)f(y) , \forall x,y \in \mathbb R , t\in (0,1)? $$ I can prove it for dyadic rational's $t=\dfrac k {2^n}$ and then argue by continuity ; but I would like a more direct proof . Thanks in Advance


$$f(n) = \left\{\begin{matrix} 0 & n=1\\  1 & n=2\\  f_{n-1} + f_{n-2} &  n\geqslant 2\end{matrix}\right.$$   How can I prove by induction that $$f_{n} \geq \left ( 1.5 \right )^{n-1}$$ for all$$  n\geq l_{b}$$, I have to find the smallest value for $$l_{b}$$

I have fibonacci numbers defined as such:  $$  f(n) = f(n-1) + f(n-2)$$with$$    f(0) = 0 $$$$f(1) = 1$$  I have to prove that $$ F(n) \geq 1.5^{n-1}, n \geq 6$$  Base Case:  $$ f(6) = 8 \geq (1.5)^5 = 7.6 $$  Base holds  Inductive hypothesis $$  k \geq 6 $$$$ f(k) \geq (1.5)^{k-1} $$  Inductive Step  Here is how I have started, any hints or pointers on how to continue are appreciated  $$ f(k-1) \geq (1.5)^{k+1-1}$$ $$ f(k) + f(k-1) = (1.5)^{k-1} + (1.5)^{k-2}$$ now I think where I want to go from here is to expand the right side of this equation out, but I am unsure how to do this.


Despite being a native speaker of American English, I cannot find a construction that sounds natural when trying to form a possessive from coordinated subjects including a first person pronoun, like "He and I" or "My brother and I." If it's "You and I," I can just use "our." But what is the proper way to form a possessive in these other instances?  The cat which belongs to my brother and me ran away.  ? My brother and I's cat ran away. * My brother's and my cat ran away. */? Me and my brother's cat ran away.   Oddly enough, the one which sounds the most natural to me (and which I hear most often in natural speech, is the last: "me and my brother's." My hypothesis is that this is used to avoid the issue with the first-person possessive form, but that could very well be wrong. However, I'm not sure this is the best answer, either, as it introduces some pretty bad ambiguity in some places.  A person who is a friend to both my brother and me got married yesterday.  */? Me and my brother's friend got married yesterday.   I think you can see the obvious problem. What is the proper way to possessivize coordinated first-/third-person subjects? Edit: I would much prefer an answer which does not require rephrasing the entire sentence.

I just stumbled upon a :     My wife and I's seafood collaboration dinner. How does it look?   Sure enough, the top comment immediately points out that it should be "my wife's and my". However, a cross-post to the Grammar subreddit produced :     It's fine as it is written. "my wife and I" is a noun phrase, functioning as a subjective pronoun in the singular and made possessive with the apostrophe. It is exactly the same as "our".      It seems weird because you would never use "I's" on its own but it is not on its own here - it is part of a noun phrase.   That's a rather intriguing argument. Does it hold any water?


Let $R$ a un Principal Ideal Domain(PID) and $J\neq 0$ a ideal of $R$. Show that $R/J$ have a finite number of ideals.

Let $aR$ be a nonzero ideal in a PID $R$. Show that $R/aR$ is a ring with only finitely many ideals.  Honestly, I do not know how to start. Appreciate any tips.


Evaluate $$ \lim_{x \to 0}\left[\frac{(1+x)^{1/x}}{e}\right]^{1/x} $$  The answer is $$\ e^{-1/2}$$ Any help is appreciated.

Find the limit of function  $$\lim_{x\to 0}\left(\frac{(1+x)^\frac1x}{e}\right)^\frac1x$$


Find the number of ways to select $k$ objects from available $(n-k)$ objects, for all possible values of k such that $k < n/2$ and assume $n$ to be odd.  What I have inferred from this till now is that I need to find the sum of the series $$\binom{n}{0}+\binom{n-1}{1}+\binom{n-2}{2}+ \ldots + \binom{\frac{n+1}{2}}{\frac{n-1}{2}}$$ Please help me understand, how to convert it to some formula in $n$. Somewhere I saw it had some equivalence with $Fib(n)$ (i.e., $n^{th}$ term in Fibonacci sequence). I couldn't derive the intuition behind it either.

The question: Let $f_n$ be fibonacci numbers. Prove: $\sum_{k=0}^{n-1} \binom{n+k}{2k+1} = f_{2n-1}$ and $\sum_{k=0}^n \binom{n+k}{2k} = f_{2n}$  For every $n\in N$.  $f_0=f_1=1$, $f_n=f_{n-1}+f_{n-2}$ for $n\ge 2$  I'm supposed to do this through induction.  What I did, first, is that I've seen that for $1$ both statements are true, then assumed for $n$.  For $n+1$ I got that the first sum is equal to the first sum for $n$ and the second sum for $n$, which under the definition of fibonacci numbers, makes the assumption true.  Similarly I did the process for the second sum.  Is this all that I had to do to solve this problem? What's bugging me is that I need to use both of the sums for a certain $n$ in proving that either one of those sums is valid for $n+1$, which I haven't encountered yet in exercises containing induction.


Let $A$ be an $n \times n$ matrix over $\mathbb{K}$ such as $\text{rank}(A)=1.$ Show that it's minimal polynomial is $m_A(x) = λ(λ-a) , a \in \mathbb{K}.$  I tried to prove it using induction. My work so far:  Let $n =2$ and $A = \begin{bmatrix}a&b\\c&d \end{bmatrix}$:   If $c=0_{\mathbb{K}}:$  Since $\text{rank}(A)=1$, $d=0_{\mathbb{K}}$. So, $A=\begin{bmatrix}a&b\\0&0 \end{bmatrix} \implies \det(A-λI) = λ(λ-α) = m_A(λ)$ If $c\ne 0_{\mathbb{K}}$  $A = \begin{bmatrix}a&b\\c&d \end{bmatrix} \to \begin{bmatrix}a&b\\0&-ad/c +b \end{bmatrix} \implies b = ad/c \implies A = \begin{bmatrix}a&ad/c\\c&d \end{bmatrix} \implies \det(A-λI) = λ(λ-(α+d)) , (a+d) \in \mathbb{K}$   On that point, I tried letting $n=3$ and writing the matrix in the form of $A = \begin{bmatrix}A_1&0\\0&A_2 \end{bmatrix}$,after Gauss elimination, where $A_1$ is a $2 \times 2 $ matix and $A_2$ is a $1 \times 1$ matrix and working my way from $n=k$ to $ n =k+1$, but it seems like I'll be doing way too much work. I there a better/shorter way of doing it?

This question aims to create an ""  of numerous questions that ask about determinants of specific matrices (I may have missed a few):              The general question of this type is  Let $A$ be a square matrix of rank$~1$, let $I$ the identity matrix of the same size, and $\lambda$ a scalar. What is the determinant of $A+\lambda I$?  A clearly very closely related question is  What is the characteristic polynomial of a matrix $A$ of rank$~1$?


EDIT: Apparently someone has brought this up before , dating back to 2014. It was status declined because 'you should read all answers before answering' and 'Sandbox questions' like what I am talking about are edge cases to the system. Well I would disagree that on sites like Code Golf that gets well received with answers you absolutely don't need to read the other answers and some questions get a lot of answers.. so for basically any question on Code Golf we're forcing this bad functionality. I would like to revisit the issue if possible.   I was on Code Golf meta using the iOS app and was going to post a proposed challenge in the . I couldn't find how to add an answer.  I realized its at the very bottom of every other answer, checked by going to another question.    So do I really need to scroll through 1000+ answers before I can add my own? Is there no way to add an answer without scrolling to the absolute bottom? Should there be a way to if there's not? As it is I would be scrolling for a while..   For the record I don't just 'go into desktop mode on Chrome' because I actually prefer using the mobile app for writing questions and answers especially with the recently added functionality making drafts easier. Also I know the buttons in the top right go to the next and previous question. It doesn't change anything except for asking then 'do I need to tap 1000 times'. Disclaimer: this question was wrote with the iOS app.

When there's one answer, it's no big deal. But when there's dozens and you have to scroll past every single other answer to add a new one, loading them in batches on a sketchy network, that takes a lot longer than it should.  When already on the Answers tab, display a + button to add an answer.


I've trouble with placing images in LaTeX. I know that is a starter problem.  In my document (research) I have a lot of graphs (40 graphs on 20 pages). So LaTeX just throw all images in all directions and the text in another direction. So I have some text clustert on some pages, and just a huge among of images on another one. So actually there are some text with the corresponding image like four pages beneath.  Is there any method to make LaTeX place the images correctly? So there is an image and then some text and than the next image? Like how I wrote it in my Tex-Document?  It doesn't matter if LaTeX just make a pagebreak and let some free space on sites, so that the text and images are in the right order. And \pagebreak doesn't help, LaTeX doesn't make anything. And it would actually be nice, if I not have to write \pagebreak all the time, but when LaTeX would do it for me.  Could you please make a suggestion for a one columnd and a twocolumn document? I write in documentclass article.  PS! I think a lot of us who are new to LaTeX have the same problem.  \documentclass{article} \usepackage{graphicx}  \begin{document} \end{document}

I have a problem when a lot of figures are in question. Some figures tend to "fly around", that is, be a paragraph below, although I placed them before that paragraph. I use code:  \begin{figure}[ht] \begin{center} \advance\leftskip-3cm \advance\rightskip-3cm \includegraphics[keepaspectratio=true,scale=0.6]{slike/visina8} \caption{} \label{visina8} \end{center}\end{figure}   to place my figures. How can I tell latex I REALLY want the figure in that specific place, no matter how much whitespace will be left?


I have a data list with some property. I want to convert that list data into data table. How to convert a list into datable.

I have few methods that returns different Generic Lists.   Exists in .net any class static method or whatever to convert any list into a datatable? The only thing that i can imagine is use Reflection to do this.  IF i have this:  List<Whatever> whatever = new List<Whatever>();   (This next code doesn't work of course, but i would like to have the possibility of:  DataTable dt = (DataTable) whatever;


I read half a book in a library a while ago that followed a guy from the first set of marines to actually go fight. They have gel-pod-beds to survive accelerations in space. after the first mission, which goes poorly, he gets back to earth like 20 years later and finds everyone else got really old, there's massive crowding, and society has gotten very corrupt. He rescues his fellow female marine from her family farm, and they go back into service, wanting to escape but not really being able to deal with society as it races past them.  Any ideas on what this book is called?

I've been looking for the name of a sci-fi romance book about space travel but haven't been successful so far. I came across it a few years ago, read the plot on its back cover but didn't read the book. It is about two spacecraft pilots, a man and a woman, who travelled at light speed (or maybe FTL, I can't remember) in separate ships. Every time they return to Earth, centuries have passed on Earth because of time dilation. They meet each other for a few times on Earth in different eras, but don't know when, if ever, they will meet again. I don't know how it ends.   If anyone knows which book I'm talking about, could you please tell me the name? Thanks a lot!


I'm trying to get the directory where the executable is.  On debian, I know I can get the pid and do a "realpath" on /proc/[pid]/exe in order to have the absolute path. But I'm stuck on windows, because I don't know how to do. I want something usable on Windows 7 and upper.  GetCurrentDirectory doens't give me this information, since if the program is run from command-line, the current directory is not necessarly the rigth one.  My program will be a windows service, so it's even more true.  I can't use command line argument (like argv[0] or else) to determine the program's name or location. edit : My program is not necessarly in $PATH, so I can't use "where".  Is there a Windows API function that I have missed ? Or do I need to search like on Debian ?

Is there a platform-agnostic and filesystem-agnostic method to obtain the full path of the directory from where a program is running using C/C++? Not to be confused with the current working directory. (Please don't suggest libraries unless they're standard ones like clib or STL.)  (If there's no platform/filesystem-agnostic method, suggestions that work in Windows and Linux for specific filesystems are welcome too.)


I think I've been using the word 'occlude' incorrectly.  I had thought that one of its meanings was something like "to cause to be hidden" or "to conveniently ignore", so one might say:     By describing the history of boxing exclusively in terms of the star athletes, Miller occludes the significant impact the surrounding cultural paradigms had upon the sport.   or else one might say     With the changes in the court, it became convenient to the imperial narrative that the citizens of the northern province be wealthy industrialists, and so the very existence of their homelessness problem became gradually occluded in depictions of the region.   I'm pretty sure there is a word that means what I am trying to use occlude to mean here, and it probably starts with an 'o' or something, but my googled definitions for the word don't match what I remember/how I've been using it.  Is there a different word that I might have forgotten?  Whenever I try to think of what it could be I just end up with 'obviate', but I know that means something entirely different (i.e. to make unnecessary, to get rid of). Does 'occlude' actually mean what I've been using it to mean?  If so, where can I find that definition?

Imagine that someone skips a step, with the hope that the audience will never know that it existed.  I was thinking extends or circumvents.  I'm not sure if these words are on the nose; I am looking for a word that really shows intent to conceal.    Here's a sample sentence:     Any plan of action that ______ preservation of human life is, at its core, flawed.


So you open the door and see your friend and say "Come on in" that means you are asking him/her to come in, okay?  But then I read in a book that it was wrong English but it did not mention what was the correct form.So that is my question.  What is the grammatically correct English phrase or sentence having the same meaning as "Come on in" and according to which particular rule this one is wrong ?  EDIT: This was from a story book written in my native language and it's from a conversation between two characters. One says "Come on in" and the other thinks to himself "speaking wrong English." This might seem strange but I really wanted to know what would be the right English and hence this post.

I am reading a journal and found a sentence which seems wrong. The sentence is,     It  is apparent  that  the errors originate from outside the model.   This sentence used from and outside together which are supposed to be preposition here. I guess double preposition is not allowed in the English Grammar. May someone clarify this point for me? Moreover, I rewrote the sentence. May anyone check whether my modification makes the sentence correct?  The modified sentence:     1.) It is apparent that the errors originate outside the model.       2.) It is apparent that the errors originate from the outside of the model.   Any help are appreciated!  UTC +8:00 12/13/2013 4:05 PM  Follow-up question:  So double preposition is not incorrect. But in this example, it seems redundant to use "from outside". Like my 1st alternative, just "outside" is enough to express all the meaning. Should we avoid double preposition in this case? Or does it express some specific meaning that I have not understood yet?


Is it possible to match multiple occurrances of a regular expression in a string for example, I wanna know if my string contains multiple url and I want to get a usable result like an array:  "hey check out http://www.example.com and www.url.io".match(new RegExp("([a-zA-Z0-9]+://)?([a-zA-Z0-9_]+:[a-zA-Z0-9_]+@)?([a-zA-Z0-9.-]+\\.[A-Za-z]{2,4})(:[0-9]+)?([^ ])+"))   would return:  ["http://www.example.com","www.url.io"]     console.log("hey check out http://www.example.com and www.url.io".match(new RegExp("([a-zA-Z0-9]+://)?([a-zA-Z0-9_]+:[a-zA-Z0-9_]+@)?([a-zA-Z0-9.-]+\\.[A-Za-z]{2,4})(:[0-9]+)?([^ ])+")))     and maybe there is a better way to match urls but i didn't find it

I want to match a portion of a string using a  and then access that parenthesized substring:  var myString = "something format_abc"; // I want "abc"  var arr = /(?:^|\s)format_(.*?)(?:\s|$)/.exec(myString);  console.log(arr);     // Prints: [" format_abc", "abc"] .. so far so good. console.log(arr[1]);  // Prints: undefined  (???) console.log(arr[0]);  // Prints: format_undefined (!!!)   What am I doing wrong?    I've discovered that there was nothing wrong with the regular expression code above: the actual string which I was testing against was this:  "date format_%A"   Reporting that "%A" is undefined seems a very strange behaviour, but it is not directly related to this question, so I've opened a new one, .    The issue was that console.log takes its parameters like a printf statement, and since the string I was logging ("%A") had a special value, it was trying to find the value of the next parameter.


I have tried below URL for filter using Author column in list in REST API.  siteURL/_api/web/lists/GetByTitle('ABC')/Items?select=*&$filter=AuthorId%20eq%201  but it doesnt work in OnPremise. It works as expected in SharePoint Online.Please provide solution if anyone have.

I was making a rest api call with Odata filter author/id. I want to get survey responses of a particular user.  _api/Web/Lists(guid'id')/items?$select=Id,Author/ID&$expand=Author/ID&$filter=(Author/ID eq 21)   But I am getting an error :  The field 'Author' of type 'User' cannot be used in the query filter expression.   How to resolve this issue?


Is there any package that can easily allow you to obfuscate a Latex->PDF generated document such that copy-paste is not longer possible and produces random letters for instance.  And if yes, is it possible to control which letters get modified?  Mailin

Is it possible to produce a PDF with un-copyable text? I mean, when you want to copy text from the PDF, you can't copy it or what you copy is nonsense characters.


From MacLane's Category Theory:  A group is a category with one object in which every arrow has a two-sided inverse under composition.  So the analogies I see between a category group $CG$ and a group $G$ is as follows:  Arrows : Elements of the group Identity arrow : identity element composition of arrows : group operation Associativity function : associative group operation Unit law : identity properties All composable arrows exist : closure of the group  But the one I can't seem to understand is: What is analog for the single object in $CG$?  Single object in category : (Something for a group)?

A groupoid is defined to be a category where every morphism is an isomorphism. So sometimes a group is said to just be a groupoid with one object.   When I try to make sense of this, I denote the single object as $G$. I view the morphisms as the analogue of "elements." The identity $1_G$ is the analogue of the usual identity $e$, we can compose any two morphisms since they are all arrows on $G$, and for any arrow $f$, we have some $f^{-1}$ such that $f\circ f^{-1}=f^{-1}\circ f=1_G$, so the idea of inverses is still there.  So I informally associate the elements of the group in the usual definition to be the arrows in the groupoid. But what does the sole object $G$ in the groupoid "correspond to" if I were to try to informally make sense of a group in the usual sense? Does it even correspond to anything?


When i add an
 with the css below i can select the item but if i add it using .append i cannot what am i doing wrong?

Opt 1

   .  $('ul.select li').click(function(e){   var item = $(e.target);   item.addClass('selected');   item.siblings().removeClass('selected');   $('#events').val(item.text()); });  $('#events').append('
Opt 2
');   .  ul.select {    list-style: none;    margin:  0;    padding: 2px;    height:50vh;    overflow-x: hidden;    border: 1px solid grey;    width: 50vw;    background-color: black;    color: white }  ul.select li {    padding: 2px 6px; } ul.select li:hover {    cursor: pointer; } ul.select li.selected {    background-color: lightgrey;    color: black; }   See  for example of issue.

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 wanted to modify some files in /lib/plymouth/themes/ubuntu-logo. As those were read only, I tried to edit its permission. But it is showing that the owner is root and as I am not the owner I cant change the permissions. Is there any way to modify those files?

I can't seem to edit and save config files in the root system (eg: /etc/dhcp/dhcpd.config); it just says "permission denied" or the save option is blocked in the text editor.  I'm pretty sure I'm a root user, but how do I make sure? If I am a root user, how do I fix this?


I copied the properties from one object to multiple objects and then duplicated these objects with AltD, now I want to convert them to single objects to modify specific ones.

I duplicated a few objects with Alt+D and now I want to apply some modifiers to them, however I can't, because they are multi-user objects.  I tried U > Objects but I still can't apply the modifier.  How to make multi user objects single user?


EDIT: Accepting the duplicate based on answers to that question being similar to my suggestion.  Sometimes after downvoting a post, somebody improves the post. Hence the reason for the downvote may vanish. Still the downvote remains. This is bad in particular if the downvote causes the post to have a negative score.  Is there an easy way to list all the votes a user (oneself) has cast that are contested (other votes opposing mine), along with the current up/down ratio of the post?  Or is there a way to quickly find all posts that I have downvoted which were edited after my downvote?  Currently the "votes" tab on my user page only list what I voted, not the voting status of the object in question.  (Somewhat related:        )

To me, a downvote usually indicates a problem with an answer. When I downvote it's to mark the answer as having a problem, not the person. If the answer is fixed, I want to remove that downvote - but it's tricky to keep track of all the questions I've looked at over the last few hours.  I don't actually downvote very much, but it's very easy to forget what's going on.  It would be nice to have some way of indicating in an edit that you (the editor/answerer) believe the reason for the downvote has now been resolved, so that the downvoters could come and undo their downvotes or explain why it's still not fixed.  (Note: this isn't about rep-recovery, but quality control. I would feel a lot better about downvoting on "iffy" answers if I felt it was likely that the answer would be fixed and I could undo the vote. Whether or not I'd get back the cost of the downvote is somewhat immaterial.)


I'm generating html tags with jQuery. Like this  jQuery:   $(document).ready(function() {     $('#example').DataTable();      var cas = ["1", "2", "3", "4", "5", "6"];     var text = "";     var i;      for (i = 1; i <= cas.length; i++) {       text += '

';     }            jQuery("#bitacorapagination").html(text);     jQuery('.active').click(function () {         suplementos(this);               jQuery(".active").removeClass("active").addClass("noactive");        jQuery(this).removeClass("active").addClass("noactive");         console.log("Event");           });    jQuery('.noactive').click(function () {        suplementos(this);         jQuery(".active").removeClass("active").addClass("noactive");        jQuery(this).removeClass("noactive").addClass("active");                console.log("Event");           });  });   html code:

   what I need is to remove and add some class to the
 element generated by jQuery , but the event doesn't activate on the event onclick()  Do you have any idea how to solve this?


My friends and I want to do a Magic v Science server where each team can only use their given mods. Is there a way to prevent the magic team from using mods like Thermal Expansion, Industrial Craft 2 etc., and the science guys not having access to Ars Magica, Witchery etc?

I'm wondering if I could play Minecraft with my friend. A modded Minecraft, only myself with mods and him without mods.  Is it possible?


I’m visiting my girlfriend who moved to Abu Dhabi for work.  Is it ok to hug when we meet at the airport or is it something we should avoid?  We are not married and it’s my first time in UAE, so I want to be cautious.   If it makes any difference, we are both Europeans.

I'd wish to visit Dubai with my girlfriend, but after reading  and  I started to get a little worried about it. How should I book an hotel? Must I book two singles? Could it be a problem if we walk together in the city and go together to restaurants and malls without being married?


Einstein states that the fastest thing in the universe is light. He also states that velocity interacts with time (faster you go the slower time is relative to you). The speed limit of the universe is light, so if you were to go at the speed of light time would stop... If something were to go faster than the speed of light then it makes sense for time to go backwards. This would technically not be possible because if time was to go backwards then the speed of light would return to its "fastest" state hence making it not possible to go faster....Is this true fact?  Or am I completely off....

Let's say I have two planets that are one hundred thousand lightyears away from each other. I and my immortal friend on the other planet want to communicate, with a strong laser and a tachyon communication device.  I record a message on the tachyon communication device and release the message at exactly the same time as I activate the laser, both of which are directed to the other planet which is one hundred thousand lightyears away. Say it is the year 0 for both of us at the time I did this.  If tachyons existed, then the message would arrive to my friend before the photons in the laser. It would arrive, say, a thousand years earlier. From my vantage point, that message will arrive to her at year 99,999; the same would be true for my friend's vantage point. However, she will only see the laser at year 100,000.  So since she got the message at year 99,999, she immediately sends me a reply back going through the same procedure as I did. She records a message and releases it at the same time as the laser. The tachyons will arrive 1,000 years earlier than the laser, so for me, I will receive the message at year 199,998. I will receive the laser, however, at year 199,999.  It seems to me that communication this way does not violate causality. I will still have received the message after I had sent it.   If tachyons truly violated causality, though, I realize it should arrive at year -1 for her, and so she can reply to me at year -2, which would mess me up by year 0 as I will ask her how she knew I was planning on sending her a message before I sent it. I could send her a different message, which she would end up receiving at year -1, and will end up confusing her as she would have received one message asking her out, and the other asking her how did she know I was asking her out. She then decides I am crazy and sends me a message at year -2 that she does not want to date me, and so she will have both turned me down and entertained me before I have even asked her out.  On the other hand, let's go back to year 0 and add a third device to our list: an Alcubierre drive. After I send out the message and the laser, I get impatient and do not feel like waiting 99,999 years, so I get on my Alcubierre drive spaceship and arrive on her planet at the same year 0. My friend is not in her office, so I leave a note to her also immortal secretary saying I dropped by and that she should expect a message for her in year 99,999.  I then get back on my Alcubierre drive and land back on my planet, still on year 0. Meanwhile, the tachyons and photons I sent out are still racing to arrive to her. By year 99,999, she receives the message just as I Alcubierre drive back to her, and I pick her up for dinner.  But the point of my question is, it seems to me that just going faster than light, if that alone was what you had, would not violate causality. It must be something else. I understand time dilation and that things with mass cannot travel at the speed of light, but using the Alcubierre drive, hypothetically speaking, I was still able to outpace the photons while also having mass. It still did not produce causality problems. Alcubierre drives are also valid solutions to GR.  It seems circular to me to say that what makes traveling faster than light violate causality is because it violates causality (if faster than light communication was divorced from causality problems, then the causality problem would cause itself -- thereby violating causality and, hence, we would scrap it and conclude that there is no causality problem after all).  What is it that I am missing? If someone could help me out, that would be excellent. I've been itching to ask my friend out for a few millenia now. :)


How to compare a decimal value with a integer in shell scripting?  Example:  i=1 j=1.2  if [$j -gt $i];then   echo "growth" else   echo "None of the condition met" fi   Im getting output as None of the condition met  But i need output as growth,As 1.2 is greater than 1.

I want to compare two floating point numbers in a shell script. The following code is not working:  #!/bin/bash    min=12.45 val=10.35     if (( $val < $min )) ; then       min=$val fi echo $min


I installed GDAL via wheel (32 bit).  Added it to my system path. Also added an environment variable GDAL_DRIVER_PATH pointing at my gdalplugins folder (on my system, C:\Python27\ArcGIS10.4\Lib\site-packages\osgeo\gdalplugins). Rebooted. At the prompt I tested it by typing     gdalinfo --help-general I received this:     ERROR 1: Can't load requested DLL: C:\Python27\ArcGIS10.4\Lib\site-packages\osgeo\gdalplugins\ogr_FileGDB.dll     126: The specified module could not be found. It repeated this error twice. Yet when I listed directory contents of C:\Python27\ArcGIS10.4\Lib\site-packages\osgeo\gdalplugins, I see two files: ogr_FileGDB.dll and FileGDBAPI.dll (This is the Esri FGDB API dll I pasted in there) I do notice that ogr_FileGDB.dll is much smaller than the Esri driver.  The ogr one is 181KB, whereas the Esri dll is 9,502KB. What gives, any ideas?  UPDATE: I am reopening this question because I have followed all of the directions in the listed answer, and I still cannot get the FileGDBAPI.dll to register as an available driver.  Here is what I've done to this point:   Followed all the instructions in  Ensured I have a GDAL_DRIVER_PATH environment variable and that it is pointing to C:\Python27\ArcGIS10.5\Lib\site-packages\osgeo Ensured I have C:\Python\ArcGIS10.5\Lib\site-packages\osgeo in my PATH. Ensured I have the FGDB API v. 1.3 (MSVC 2008), 32-bit DLL sitting in the C:\Python\ArcGIS10.5\Lib\site-packages\osgeo folder. I installed Boundless Desktop 1.0, but its components do not have any presence in my PATH, PYTHONPATH or GDAL_DRIVER_PATH variables. I have pip installed the GDAL 32-bit wheel for 2.1.3, but when I put in ogrinfo --version it yields GDAL 2.1.0, released 2016/04/25 which is incorrect - even though the only pointers for anything GDAL in my environment variables is pointing to the Python27\ArcGIS10.5 install. ogrinfo --formats does not give me an error, but it simply fails to find the FileGDB driver.

There has been a tons of questions on that but none of them solved my problem.  I have a machine with:   Windows 7 x64 Python 3.4.3 x64 gdal installed: gdalinfo --version --> GDAL 1.11.4, released 2016/01/25; gdal was installed from a wheel GDAL-1.11.4-cp34-none-win_amd64.whl from    The GDAL is installed into C:\Python34\Lib\site-packages\osgeo. There I have a bunch of .exe files for gdal and ogr and .pyd files.    fiona installed: was installed from a wheel Fiona-1.6.3-cp34-none-win_amd64.whl, from the same website.   I am able to run this code and it executes successfully:  import gdal import ogr from gdalconst import *  shp = r"C:\Data\GIS\PTS.shp" driver = ogr.GetDriverByName('ESRI Shapefile')  dataset = driver.Open(shp)     layer = dataset.GetLayer() layer.GetFeatureCount()     schema = layer.schema fields = [field.GetName() for field in schema]     feature = layer.GetNextFeature()   I am also able to get OGR formats: ogrinfo --formats prints a bunch of them in the Windows cmd (with no FileGDB there though).  I am able to run this code and it executes successfully:  import fiona with fiona.drivers():   with fiona.open(path=r'C:\Data\GIS\TemplateData.gdb', driver='OpenFileGDB') as source:     print(source.meta)   However, this code won't run:  with fiona.drivers():     with fiona.open(path=r'C:\Data\GIS\TemplateData.gdb', driver='FileGDB') as source:         print(source.meta)   Because I don't have Esri File GDB compiled libraries which are required.  I have downloaded and unpacked FileGDB_API_VS2012_1_3.zip from the . As I understood, there is no need to compile anything as the .dll is already there.   What is the correct procedure to register the dll of the Esri File GDB API to be able to use them in fiona in my environment?    UPDATE: (based on Luke's answer)  I have downloaded the File Geodatabase API 1.4 version for Windows (Visual Studio 2010) from the . I copied the FileGDB_API_VS2010_1_4\bin64\FileGDBAPI.dll to the C:\Python34\Lib\site-packages\osgeo. Now I have two files in here, ogr_FileGDB.dll and FileGDBAPI.dll.  I have created a Windows variable GDAL_DRIVER_PATH : C:\Python34\Lib\site-packages\osgeo\gdalplugins. In the PATH variable, I don't have anything Python specific except the C:\Python34\Lib\site-packages\osgeo.  Now when running the ogrinfo --formats I get -> "FileGDB" (read/write) and am able to use the Python code for working with the FileGDB driver.


Proof the limit of the sequence $\lim_{n\to\infty} [\frac{1}{n+1}+\frac{1}{n+2}+...+ \frac{1}{2n}]=\log 2$ ...  I think that each term of the sequences is of the type $ {\frac {1}{n}}$, then why the result is $ \log 2$?

What is the sum of the 'second half' of the harmonic series?  $$\lim_{k\to\infty}\sum\limits_{n=k+1}^{2k}{\frac{1}{n}} =~ ?$$  More precisely, what is the limit of the above sequence of partial sums?


I remember there was a cog in the menu in the uuper right corner of the screen The cog opened the app for editing the preferences Now the cog is gone and I can't open the preferences anymore What have I done ? How can I fix this ? :~$ lsb_release -a No LSB modules are available. Distributor ID: Ubuntu Description:    Ubuntu 20.10 Release:    20.10 Codename:   groovy

I usually go to the right top corner and at the drop down menu I select the tool icon to go to the settings.  However, 19.10 does not have a tool icon.  How can I go to settings now?


When the 'photon' is emitted, it would reason that the result of the energy fluctuation that creates 'it' rather is created as an energy wave, which when measured by us or a surface, it 'becomes' as a particle.  If my reasoning is right, the question then becomes why, or how, this wave appears as a corpuscular disturbance..   The more you know, the more complicated it will get, so I can see why knowing so little makes these questions easy for me to ask. I'm curious to see who is patient enough to educate a naiive question with a good natured 'schooling'.

Are photons , quantum waves, or both?  If I subdivide an electromagnetic field into smaller , should I eventually find an electromagnetic wave of a ?   How can individual quantum waves combine to form the macroscopic observable of an electromagnetic field?


I ran into this problem :  Prove that the axiom of choice is equivalent to the proposition that for every pair of sets A,B, and for every relation R such that $R \subseteq A \times B$ and $\text{dom}(R) = A$, there exists a function $f : A \to B$ such that $f \subseteq R$.  So, first off I'm not sure how to prove equivalence, but I assumed it would be similar to an if and only if  kind of proof where you show both directions lead to each other, here's what I did for the first direction:  Let us assume the axiom of choice, and let $A,B$ be two sets. Let $R$ be a relation such that $R \subseteq A\times B$ and $\text{dom}(R) = A$ . Let $B' \subseteq B$ such that $B' = \{b \mid \exists a (\langle a,b\rangle \in R)\}$, let $I$ be a set of indices such that for every $i \in I$, there exists a set $B_{i}$ and an element $a_{i}$ such that $B_{i} = \{ b \mid \langle a_{i}, b\rangle \in R\}$. Since $B' = \bigcup_{i\in I}B_{i}$, from the axiom of choice there exists a function $f : \bigcup_{i\in I}B_{i}\to B'$ such that $f( B_{i}) = b_{i} \in B_{i}$ for every $i$ in $I$. Therefore we may define a set $A_{i}$ such that $A_{i} = \{ a \mid \langle a, b_{i}\rangle \in R\}$ for every $i$ in $I$. Since $B' = \bigcup_{i\in I}B_{i}$ and $A = \bigcup_{i\in I}A_{i}$, we may define a function $g: A\to B$ such that for every $a \in A_{i}$, $g(a) = b_{i} \blacksquare$.  I'm not sure that I used the axiom of choice the way I was supposed to, but more importantly I have no idea how to go about the other direction, how do deduce the existance of an axiom? Any help would be much appreciated, thanks!

The axiom of choice asserts that for any set $X$ there exists a function $f : (2^X − \{\emptyset\}) \rightarrow X$ such that for any nonempty $A \subseteq X$, $f(A) \in A$. Show that this is equivalent to the assertion that every relation includes a function with the same domain. I am given this problem in my assignment. My approach is following. I have a set $X$. Then it has a choice function $g : \mathcal{P}(X) \setminus \left\{\emptyset\right\} \rightarrow X$. Suppose $X$ has a relation $R \subseteq X \times X$. $dom(R) \subseteq X$. Then the required function $f : dom(R) \rightarrow X$ is $$f(x) = g(\{y\ |\ (x, y) \in R\})$$ Conversely, suppose $X \supseteq Y$ is a non-empty subset. Let $$R_Y = \{(x, y)\ |\ y \in Y, x \in Y, (p, q) \in R_Y \Rightarrow p = x\}$$ Then there is a function $f_Y : dom(R_Y) \rightarrow X$. But $dom(R_Y)$ is singleton from the definition of $R_Y$. Then $im(f_Y)$ is also singleton. We define our choice function as $f = \{(Y, y)\ |\ y \in im(f_Y)\}$ Are my arguments correct?  Edit.1: what I tried to do for converse is, for any subset $Y$, I construct a relation $Y_1 \times Y$ where $Y \supseteq Y_1 = \{y\}$. Then there is a function $f_Y : Y_1 \rightarrow Y$. Then if $f$ is my choice function I define $f(Y) = f_Y(y)$. May be I should define $R_Y$ as $$R_Y = \{(x, y)\ |\ y \in Y; x \in Y; (p, q), (p', q) \in R_Y \Rightarrow p = p'\}$$ I understand there may be multiple $R_y$'s. But can't I define a singleton set as $\{s\in S\ |\ a, b \in S \Rightarrow a = b\}$? This can be $\{s\}$ $\forall s \in S$. But isn't it a valid specification?  Edit.2: This is the final solution with the help from @Asaf.  If we assume axiom of choice then for any $X$ there is a choice function $f : \mathcal{P}(X) \setminus \left\{\emptyset\right\} \rightarrow X$ such that $f(A) \in A$. Suppose $R$ is a relation between $P$ and $Q$. Then we have a choice function $f_Q$ for $Q$. Let $f_R(p) = f_Q(\{q\ |\ pRq\})$. The function $f_R : P \rightarrow Q$ and $dom(f_R) = dom(R)$. So this is our required function.  Conversely, if every relation includes a function with same domain. Let $R$ be a relation between $\mathcal{P}(X) \setminus \left\{\emptyset\right\}$ and $X$ such that $aRb \Rightarrow b \in a$. Now $R$ includes a function $f : \mathcal{P}(X) \setminus \left\{\emptyset\right\} \rightarrow X$. Then $xRf(x) \Rightarrow f(x) \in x$. So $f$ is the choice function for $X$.


arr = [] try:     test_cases = int(input())     print("testcase: ",test_cases)     for i in range(0, test_cases):         arr_len = int(input())         print("Array Length:", arr_len)         for j in range(0, arr_len):              val = input()              arr.append(val)              print("Array:", arr)              while j < (len(arr)+1):                  if arr[j]<arr[j+1]: print("-1")                  else: print(arr[j]) except EOFError: print("Exception Handled\n")   This is the error I am getting:  2 testcase:  2 5 Array Length: 5 4 1 1 5 3  Traceback (most recent call last):   File "C:/Users/Rupali Singh/PycharmProjects/Geeks_for_geeks/immediate_smaller_element.py", line 15, in <module>     if arr[j]<arr[j+1]: print("-1") Array: ['4 1 1 5 3 '] IndexError: list index out of range 1   Why is it saying that the length of array is 1? please help me with code. Is my logic wrong?

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


How can light experience change if it is motionless in time?

I read with interest about Einstein's Theory of Relativity and his proposition about the speed of light being the universal speed limit.    So, if I were to travel in a spacecraft at (practically) the speed of light, would I freeze and stop moving?  Would the universe around me freeze and stop moving?  Who would the time stop for?


I am reading .  In Module chapter, It said:      macros are mainly useful to avoid having magic values floating around your modules.    But what is magic values floating?

What is a magic number?  Why should it be avoided?  Are there cases where it's appropriate?


There seems to be a macro for typesetting the acronym LaTeX, but I cannot think of manual to look it up or search term that would return relevant results.  How can I typeset the word LaTeX as it usually appears in LaTeX documentation - with the vertically staggered letters?  I know this is going to be a duplicate, but cannot help it :(

I  there's a LaTeX package for printing the text of "lorem ipsum".  Surely then, there's also a macro / package for writing "LaTeX" (with the proper super-/subscript) in a document.  But I found googling for this a bit hard. ("LaTeX macro"? Probably not.)  Can any of you groks help me out here?


I really don't understand why this needs to be. To be reversible, isn't all we need is that there is no net energy change in the system so, who cares how fast or slow it goes?

I have seen several questions and good answers on the link between reversible and quasistatic processes, such as  or . However, these questions only adress one side of the problem : a reversible process is necessarily quasistatic.  I am interested in the other side of the equivalence : is there a process that is quasistatic, yet not reversible ? It looks to me that an irreversible process cannot be made perfectly quasistatic.  The  article about quasistatic processes takes as an example the very slow compression of a gas with friction. As the compression occurs very slowly, the transformation is quasistatic, and the friction makes it irreversible. I am not convinced by this example : if you press on the piston with a vanishingly small force you will have to reach the threshold of the Coulomb law for solid friction before moving the piston anyway. It makes the process non-quasi-static, however small the Coulomb threshold might be.  Another example I've heard of is the reaction between a strong acid and a strong base. It is always an irreversible process, and you could make it quasistatic by adding very small drops of base into acid at a time. But by trying to do that, you would inevitably reach a limit to the size of the drop imposed by surface tension.  Even if "reversible" and "quasistatic" mean very different things, is it true to consider that in practice, a reversible process and a quasistatic process is essentially the same thing ?


I am practicing proving things with index notation in order to get a good grasp of the way it works. One of the problems that I came up against is $\nabla(\frac{1}{2}v^2) = \vec{v}\times(\nabla\times\vec{v})+(\vec{v} \cdot \nabla)\vec{v}  $  You can write the right hand side as $\epsilon_{ijk}v_i\epsilon_{xyj}\partial_xv_y + v_i\partial_iv_k$ this comes down to $v_iv_i\partial_k - v_i\partial_iv_k + v_i\partial_iv_k$ the last two terms cancel so you are left with $\nabla v^2$ but where is the half?

I'm having some trouble using index notation to prove the identity   $$\frac{1}{2}\mathbf{\nabla (u \cdot u) = u \times (\nabla \times u ) + (u \cdot \nabla)u}$$  The closest I can get is by expanding the first term on the RHS, which gives  $$\mathbf{u \times (\nabla \times u)} = 2u_j \partial x_i u_j - u_j\partial x_i u_i - u_i \partial x_j u_j$$  but I don't see what to do from here (if what I've done so far is correct).  Any help will be appreciated!  EDIT  The comments so far are all a bit dubious about my expression for the first term on the RHS, here's my work:  $$\mathbf{u \times (\nabla \times u)} = \epsilon_{ijk}u_j\epsilon_{klm}\partial x_lu_m$$ now I move the second Levi-Civata symbol to the left and use the identity GFR posted to get   $$\epsilon_{ijk}u_j\epsilon_{klm}\partial x_lu_m = (\delta_{il}\delta_{jm}-\delta_{im}\delta_{jl})u_j\partial x_lu_m$$ expanding this gives  $$\mathbf{u \times (\nabla \times u)} = u_j\partial x_i u_j - u_j\partial x_j u_i$$ This next step i'm not sure about, I move the derivatives to the left of each term  $$u_j\partial x_i u_j - u_j\partial x_j u_i = \partial x_iu_ju_j - \partial x_j u_ju_i$$  then the product rule gives my original equation for $\mathbf{u \times (\nabla \times u)}$


I am new to Stack Overflow. After commenting repeatedly on an answer from somebody, suddenly a warning (automatic, I guess) popped up: "Please avoid extended discussions in comments. Would you like to automatically move this discussion to chat?"  I get the idea behind this move. Only problem: As a newbie, I can't use chat rooms. Wouldn't it be better to show this warning only, if you actually can use chat rooms?   On a side note: These automatic warning messages might scare away new users. My first posting got a warning like "Postings with these headlines are often down voted and deleted". It nearly made me leave the site. Maybe a less restrictive warning, if you are not a repeat offender, would increase the attractiveness to new members.

Simple request, really.  Can we add a detection for the     Please avoid extended discussions in   comments. Would you like to   automatically move this discussion to   chat?   prompt, so that if one of the users in the "extended discussion" has under 20 rep it doesn't appear?  I think a lot of the users this apply to will have low rep and it may take some back and forth to get good info out of them.  New suggestion: how about if a sufficiently high-rep user is clicking on the link, the low-rep user gets a field promotion sufficient to chat? Low-rep users are particularly prone to post questions to lead in this direction of needing to move to chat.


I am trying to run a virtual machine in VirtualBox, but it gives me the following error:  VBoxManage.exe: error: AMD-V is being used by another hypervisor. (VERR_SVM_IN_USE). VBoxManage.exe: error: VirtualBox can't enable the AMD-V extension. Please close all other virtualization programs. (VERR_SVM_IN_USE)  Is is possible to find out which program or service exactly has taken control of virtualization, so that I can uninstall it?

Recently I started having an issue with VT-x on my Windows 10 running on HP EliteBook. I was using Oracle VirtualBox to run some VMs on it before and VT-x was enabled in BIOS and was working fine.  I started getting VT-x is not available error every time I was trying to start any of my VMs. That started happening after I installed Docker on my machine, so I tried uninstalling it and rebooting. Didn't help.  I checked BIOS settings and it says VT-x is enabled but checking with Intel(R) Processor Identification Utility shows that VT-x is not supported and Oracle VirtualBox also doesn't see it.  There were no hardware changes and the only software change was installing/uninstalling Docker.  How can this issue be fixed?


This question come about do to an annoying though infrequent issue I have been having in QGIS. On occasion, I will begin processing a tool that will take some time to run but realize midway through that I do not want to complete the algorithm with the provided inputs. Previously I have had to end the task with my task manager since I have found that closing out of the window does not always stop the process. Ending in this way can cause data loss sometimes. Does anyone know of a way, inside the QGIS console, to stop a process?

I'm writing a Python script to use it in Processing framework. I need to cancel script execution if certain conditions are met (to save user's time). I tried to use sys.exit(arguments) command. The issue is that not only the script, but QGIS itself shuts down too. I also tried quit() but result is the same. How should I terminate script in Processing framework? The following code is for reproduction purpose only. I don't need ad hoc solution for this particular case because I already have it. I need to know how to deal with this issue in general. ##Raster processing=group ##raster_1=raster ##raster_2=raster   from osgeo import gdal import sys from numpy import * import ntpath import re import platform from PyQt4 import QtGui   raster_1 = gdal.Open(raster_1) raster_2 = gdal.Open(raster_2)  rasters_list = [raster_1, raster_2]  # create a message for the case when CRSs of rasters do not match class WrongCRS(QtGui.QMessageBox):    def __init__(self):     super(WrongCRS, self).__init__()      self.initUI()    def initUI(self):      self.warning(self, 'Oops!',             "Rasters must have the same CRS!\n\nExecution cancelled!", QtGui.QMessageBox.Ok)  # check CRS proj = None for raster in rasters_list:   new_proj = raster.GetProjection()   if proj is None:     proj = new_proj   else:     if proj != new_proj:       WrongCRS()       sys.exit('CRSs do not match!')     else:       continue


A good residual vs fitted plot has three characteristics:   The residuals "bounce randomly" around the 0 line. This suggests that the assumption that the relationship is linear is reasonable. The residuals roughly form a "horizontal band" around the 0 line. This suggests that the variances of the error terms are equal. No one residual "stands out" from the basic random pattern of residuals. This suggests that there are no outliers.   (Source:  link not working January 2019)  In particular, I am no sure what they mean what they mean by a horizontal band in the second point.Is that the red curve in the graph?   So the second point deals with homoscedasticity?

I have a model that attempts to predict a nation's quality of life index by it's moral indifference to contraception and moral rejection of gambling. Initially the model contained several predictors, but I eliminated most using backwards elimination via AIC. Here is a summary of the model (generated using R):  > summary(fit1)  Call: lm(formula = Quality.of.life.index ~ Morally.unacceptable.ga +      Not.a.moral.issue.co, data = qli_and_moral_ind)  Residuals:     Min      1Q  Median      3Q     Max  -89.670 -25.443  -4.732  36.129  64.441   Coefficients:                         Estimate Std. Error t value Pr(>|t|)     (Intercept)             143.1410    32.7499   4.371  0.00019 *** Morally.unacceptable.ga  -1.7690     0.3603  -4.910 4.71e-05 *** Not.a.moral.issue.co      1.4471     0.7925   1.826  0.07981 .   --- Signif. codes:  0 ‘***’ 0.001 ‘**’ 0.01 ‘*’ 0.05 ‘.’ 0.1 ‘ ’ 1  Residual standard error: 40.39 on 25 degrees of freedom Multiple R-squared:  0.6079,    Adjusted R-squared:  0.5765  F-statistic: 19.38 on 2 and 25 DF,  p-value: 8.266e-06   There are two plots of the model that I can't interpret:    According to the web, the residuals plot above may indicate predictable error, ie that I'm missing some variable in my model. Is that assessment correct? If so, what should I consider adding to the model? It kind of looks like the $y = x^3 - x$ graph - maybe add a cubed term?


So that's the question. But I am unable to find a counter example if it's false. Or how should I proceed to prove if it is true? I am confused please help. Many thanks.

If $\sum a_n$ with $a_n>0$ is convergent, then is $\sum {a_n}^2$ always convergent? Either prove it or give a counter example.  Im trying in this way, Suppose $a_n \in [0,1] \ \forall\  n.\ $ Then ${a_n}^2\leq a_n\ \forall\  n.$ Therefore by comparison test $\sum {a_n}^2$ converges.  So If $a_n$ has certain restrictions then the result is true.  what about the general case?  How to proceed further? Hints will be greatly appreciated.


Let $R$ be a ring with unity not necessarily commutative and $I$ an ideal of $R$.  Let for every element $a \in I$ there exists an element $c\in I$ such that $ac=a$. Note that $c$ is related to $a$. Now we have the following question:     Can we say that  for every element  $a\in I$ there exists an idempotent element $c\in I$ such that $ac=c$?     Off course we have many examples such that the answer is true for them but in general  we don't know.

Let $R$ be a ring with unity (not necessarily commutative) and $I$ an ideal of $R$.  Suppose that for every element $a \in I$ there exists an element $c\in I$ such that $ac=a$. Note that $c$ is related to $a$. Now we have the following question:  Can we say that  for every element  $a\in I$ there exists an idempotent element $c\in I$ such that $ac=a$?    Of course we have many examples such that the answer is true for them but in general  we don't know.


I am used to using my smart phone to browse Stack Overflow with a web browser, but I feel that that's not a very good solution. Now I want to use a mobile app to browse SO.  Is there a mobile app for Stack Overflow, or plans to develop one? Third-party apps (both Android and iOS) would be fine for me.

I like using Stack Overflow (or any other Stack Exchange sites) and was wondering if there was an app I could install on my phone or other device that would allow me to use the site on-the-go or straight from my desktop.  Some systems to consider:   Windows 8 Android iPhone/iOS   What are some apps that I could install to my computer or phone to enhance my Stack Exchange experience?


I've tried turning off my Surface Pro running Windows 10 from "automatically turning off the power to a USB Root Hub" thru the Device Manager but found it didn't help. I'm running the 64 bit version of windows and was wondering if I switched to the 32 bit version whether it may solve my problem. I don't recall having this problem with earlier versions of Windows. I've been using my Surface Pro in it's Surface Docking Station but no matter which USB port I choose, I get the same result. Has anyone tried this with success..? How do I switch over from my current 64 bit Windows 10 to the 32 bit version..?

My mouse will reconnect/disconnect (will even hear the sounds from Windows), and the light on the bottom of the mouse will turn off/turn on as it starts working again.  It really sucks to be playing a game (and happens on desktop as well) for the mouse to just die out for a few seconds and come back. Sometimes it will not happen for days and other times it will do it two or more times within 15 seconds.  I tried two different wired mice, tried multiple USB ports (on the front of the computer, back of the computer, used a USB hub and plugged in a card that connects to the USB connectors on the motherboard and adds a few USB ports to the back of the computer, and I also bought a USB 2.0 PCI card and that did not help).  Nothing else seems to reconnect like this, my USB keyboard has never once cut out like the mouse does and neither have any of the other devices I have connected (webcam, USB hub, various devices sometimes connected through USB cables, and IR receiver for windows Media Center remote). I have disconnected all USB devices except for my keyboard and mouse and the problem still occurs.  I guess it could be something wrong with my motherboard but since no other devices behave similarly I'm just hoping that it is some kind of driver conflict. Installing Logitech's drivers has had no effect. It seemed at first that if I go to  and uninstall  mouse (that and Logitech mx518 are listed) that would fix it, but it doesn't seem to work anymore or at least not every time (it keeps re-installing).  I have googled "USB mouse disconnects and reconnects", and it seems to be fairly common but none of those were resolved.  To stick some easy steps:   It happens with or without the drivers installed It has happened with multiple mice on the same computer The BIOS is the latest version (P08) Motherboard drivers are the latest version Device Manager isn't listing any problems on any USB devices Happens with every USB port, even addon USB cards Happens when all USB devices aside from mouse and keyboard are unplugged   I read that maybe it is an IRQ conflict, and I tried to look into that but did not really know what was going on, but didn't see anything obviously wrong.  Specifications:     CPU EVGA 780I SLI motherboard 4 GB RAM  mouse Windows 7 64-bit  screen card 650 W power supply (single rail).


I have 3,5 GiB .sql file with MS SQL Server database dump (created from MS SQL Server Management Studio). How to restore this database now?

I use RedGate SQL data compare and generated a .sql file, so I could run it on my local machine. But the problem is that the file is over 300mb, which means I can't do copy and paste because the clipboard won't be able to handle it, and when I try to open the file in SQL Server Management Studio I get an error about the file being too large.  Is there a way to run a large .sql file? The file basically contains data for two new tables.


The 5e PHB states:     While you're mounted, you have two options. You can either control the mount or allow it to act independently.    It then describes a number of situations where that choice is made for you (e.g. you cannot control an intelligent mount nor a mount that refuses a rider).    There don't seem to be any situations in which you are required to not choose to let your mount act independently.  For example, you could allow your warhorse to act on its own initiative, potentially granting you extra attacks and other options.  Is this correct? There seems to be resistance to the idea that non-intelligent mounts can be allowed to act independently.

The rules for mounted combat (PHB p.198) state:  While you're mounted, you have two options. You can either control the mount or allow it to act independently. Intelligent creatures, such as dragons, act independently. You can control a mount only if it has been trained to accept a rider.  The first two sentences seem to always give you the choice but the next two appear to limit this choice. What is the correct interpretation?


I have a   iMac (early 2009)  with    2,66 GHz Intel Core 2 Duo   4 GB 1067 MHz DDR3   640GB 7200-rpm Serial ATA hard drive  If I create a partition for the iTunes library and another one for the iPhoto library (they are pretty heavy), do you think this makes my Mac faster or not? And, if possible, can you shortly explain why?  Thanks!

Back in the day you could gain some performance by partitioning your hard drive to several partitions:   Pagefile OS and Apps data   There was some debate regarding the order of the drives as the first partitions are faster. Is all this still relevant for modern OSs such as Win7 and latest linuxes? What optimal partitioning scheme would you suggest? Assume there's only a single (non-ssd) drive in the system


If I have a directory wibble, the following command does what I want:  WIBBLE=wibble wc $WIBBLE/*   If I have a directory foo bar, the following command does what I want:  wc foo\ bar/*   But this doesn't do what I want  FOO="foo bar" wc $FOO/*   I get:  wc: foo: No such file or directory wc: bar/*: No such file or directory   I've tried everything I could find here, but nothing wants to work for me! What am I missing? I do not want a solution using for as I want to pipe the output from wc to other commands.    Examining the dup, this works:  FOO="foo bar" BAR=("$FOO"/*) wc "${BAR[@]}"   My question now becomes "Can I avoid the intermediate variable?". This just prints the straightforward expansion:  FOO="foo bar" wc "("$FOO"/*)[@]"

Or, an introductory guide to robust filename handling and other string passing in shell scripts.  I wrote a shell script which works well most of the time. But it chokes on some inputs (e.g. on some file names).  I encountered a problem such as the following:   I have a file name containing a space hello world, and it was treated as two separate files hello and world. I have an input line with two consecutive spaces and they shrank to one in the input. Leading and trailing whitespace disappears from input lines. Sometimes, when the input contains one of the characters \[*?, they are replaced by some text which is is actually the name of files. There is an apostrophe ' (or a double quote ") in the input and things got weird after that point. There is a backslash in the input (or: I am using Cygwin and some of my file names have Windows-style \ separators).   What is going on and how do I fix it?


I am new to Ubuntu and did an install of 13.10 on a laptop. I get an error message   Error: Opening the cache (E:read error-read (5: input/output error),  E:the package lists or status file could not be parsed or opened.)'     How do I correct this?

The computer gave me this output in a window:  E: Encountered a section with no Package: header E: Problem with MergeList /var/lib/apt/lists/archive.ubuntu.com_ubuntu_dists_natty_main_binary-i386_Packages E: The package lists or status file could not be parsed or opened.   How can I fix this?


I've been looking for this answer a lot and people say diferent things are true. Is it shyer and the shyest, shier and shiest or more shy and the most shy? According to Merriam-Webster dictionary it's shyer and the shyest, shier and shiest. () The same goes to Dictionary.com (). So does this mean both are right?

My Longman dictionary states that the comparative of 'shy' is 'shyer'. However, at least two online dictionaries also give the form 'shier' as being acceptable:  and . On an English language  I came across a reference to British (shyer) vs. American (shier) spelling. But an Ngram chart shows that even in American English 'shyer' is much more used.  My problem is that I've been told that it is definitely wrong, but if it's in dictionaries then... has there been a change to what is wrong?   P.S.:


Is there a way to produce a table in LaTeX in the way as is depicted in the attached image?    I have tried the following code, but I am not able to obtain an entire empty row with, say, "cold cache" written in its center. Is there some way to do so in LaTeX?  \begin{tabular}{|l||l|l|l|l|l|l|l|}         \hline         &\multicolumn{3}{c|}{A}&\multicolumn{3}{c|}{B}\\         \cline{2-7}         \hline\hline         1 & a & b & c & d & e & f \\         2 & g & h & i & j & k & l \\         \hline       \end{tabular}   I mean, I want to get the right LaTeX code for the table in the image above, but with the exclusion of the "#Results" row.

I would like to have a table that looks like the image below.  \documentclass{article} \begin{document}     \begin{table*}         \begin{tabular}{|l|l|l|l|l|l|l|} \hline              &\multicolumn{3}{c|}{A} &\multicolumn{3}{c|}{B} \\ \cline{2-7}            1 & a & b & c & d & e & f \\ \hline           2 & g & h & i & j & k & l \\ \hline          \end{tabular}     \end{table*} \end{document}   However, I cannot obtain the table with an entire empty row, like the cold cache, written in its center. Is there some way to do so?    I also want the caption below the table.


I have tried many link and none of them works for me. I have internet access in my college through a proxy 172.16.24.4 with port 3128 and the proxy type is either http or https. I want to use apt-get to install softwares on ubuntu. Please help me. Please explain in detail as I am fairly new to ubuntu.  Thanks

I've got an Ubuntu 11.10 system connected via a proxy to the internet, and I would like to install packages via apt-get. When I try to do that I get this error message:  sudo apt-get install libboost-program-options-dev [...] Err http://gb.archive.ubuntu.com/ubuntu/ oneiric/main libboost1.46-dev i386 1.46.1-5ubuntu2 407  Proxy Authentication Required   Any ideas?


For example:  watchdog('alerts', 'Message for %user was sent.', array('%user' => $user));   and  drupal_set_message(t('options: @options', array('@options' => $form_state['values'])));   Is there any difference?

I'm using the Message module on Drupal 7.  For Replacement tokens, the help text says:     A comma-separated list of replacement tokens, e.g. %title or !url, of   which the message text makes use of. Each replacement token has to   start with one of the special characters "@", "%" or "!". This   character controls the sanitization method used, analogously to the   t() function.   What's the difference between %, !, and @?  Are there standards about when I should use each symbol?


I have a very simple problem. I want to write "a" in an equation, however output is .... Please see output. Please see "a" carefully, the problem is there. How i can overcome this problem?

I have a very simple problem. I want to write "a" in an equation, however output is .... Please see output. How i can overcome this problem?


$\int\frac{1}{kx}dx$  There are two ways to integrate this...  Method 1 (Separating the coefficient from the variable):  $\frac{1}{k}\int\frac{1}{x}dx$  $\frac{\ln|x|}{k} + c$  Method 2 (knowing that it is an ln() function and multiplying by the reciprocal of the coefficient):  $\int\frac{1}{kx}dx$  $\frac{\ln|kx|}{k}+c$  When both solutions are derived, we get the same answer of $\frac{1}{kx}$.  Which solution is the correct solution?

What is right way to calculate this integral and why?     $$ \int\frac{1}{2x}\text dx $$   I thought, that this substitution is right: $$ t = 2x $$ $$ \text dt = 2\text dx $$ $$ \frac{\text dt}{2} = \text dx $$ $$ \int\frac{1}{2x}\text dx=\int\frac{1}{t}\frac{\text dt}{2}=\frac{1}{2}\ln|2x| + C . $$  But it's not right, because this is the correct answer: $$ \int\frac{1}{2x}\text dx=\frac{1}{2}\int\frac{1}{x}\text dx=\frac{1}{2}\ln|x| + C . $$  Can someone explain me, why is the first way wrong? When I derive both results, I get the same result.


I have a virtual machine host running Centos 6. It is serving an android application with apache/php/mysql.  When online users gets high in number , the server responds very slowly. Even ssh connection to the server becomes slow.  So how can I find what is the bottleneck for this and how to fix it? Is it low RAM or a lot of hard disk write/read , high cpu usage , and which program is causing this?  This is the output of free -m in normal situations:               total       used       free     shared    buffers     cached Mem:          1877       1714        162          0         16        202 -/+ buffers/cache:       1495        381 Swap:         1023        231        792   Output of htop in normal situation:

This is a  about  Related:      I have a question regarding capacity planning. Can the Server Fault community please help with the following:   What kind of server do I need to handle some number of users? How many users can a server with some specifications handle? Will some server configuration be fast enough for my use case? I'm building a social networking site: what kind of hardware do I need? How much bandwidth do I need for some project? How much bandwidth will some number of users use in some application?


Somehow, my nephew (who destroys everything he touches) has managed to disable the wifi on his Acer Aspire One series netbook (Model #ZG5).   It's running 14.04 LTS (32-bit). rfkill list indicates it's not soft blocked, but hard blocked.   However, there is no wifi switch on this particular model, and no Fn key shortcut, either. I've scoured the internet... but none of the solutions I've found so far seem to work. Any advice?  I've looked at this question and it doesn't apply to me:

I'm using Ubuntu 13.04 and I have ASUS X550V laptop. This is my rfkill list:  0: asus-wlan: Wireless LAN     Soft blocked: no     Hard blocked: no 1: asus-bluetooth: Bluetooth     Soft blocked: no     Hard blocked: no 2: phy0: Wireless LAN     Soft blocked: no     Hard blocked: yes 3: hci0: Bluetooth     Soft blocked: no     Hard blocked: no   Before you start going: Hey, just turn on your hardware switch, dummy... my hardware switch is Fn + F2 and it works perfectly fine on my Windows boot. But, on my Ubuntu boot it does nothing... All the other Fn + F_ combos work (turn off the touchpad, screen turn off, screen brightness, sound) and they give some kind of visual indicator when I press it.  My lshw log:  *-network DISABLED                 description: Wireless interface                 product: AR9485 Wireless Network Adapter                 vendor: Atheros Communications Inc.                 physical id: 0                 bus info: pci@0000:03:00.0                 logical name: wlan0                 version: 01                 serial: 24:0a:64:28:b4:25                 width: 64 bits                 clock: 33MHz                 capabilities: pm msi pciexpress bus_master cap_list rom ethernet physical wireless                 configuration: broadcast=yes driver=ath9k driverversion=3.8.0-19-generic firmware=N/A latency=0 link=no multicast=yes wireless=IEEE 802.11bgn                 resources: irq:17 memory:f7900000-f797ffff memory:f7980000-f798ffff


This question is not a duplicate because I am asked here to use the fact that  $1 + \cos \alpha + \cos 2 \alpha + \cdots + \cos n \alpha = Re (1 + z + z^{2} + \cdots + z^{n})$, where the question this is suspected of being a duplicate of does not use this  I am supposed to use the fact that $1 + \cos \alpha + \cos 2 \alpha + \cdots + \cos n \alpha = Re (1 + z + z^{2} + \cdots + z^{n})$, where $z = \cos \alpha + i \sin \alpha$, ro find a trigonometric expression for $1 + \cos \alpha + \cos 2 \alpha + \cdots + \cos n \alpha$.  Now, when $z \neq 1$, we have the geometric sum $\displaystyle 1 + z + z^{2} + \cdots + z^{n} = \frac{1-z^{n+1}}{1-z}$. (When $z = 1$, $1 + z + z^{2} + \cdots + z^{n} = n + 1$, so $Re(1 + z + z^{2} + \cdots + z^{n}) = Re(n+1) = n+1$, finished.)  So, in the case where $z \neq 1$, $\displaystyle 1 + \cos \alpha + \cos 2 \alpha + \cdots + \cos n \alpha = Re(1 + z + z^{2} + \cdots + z^{n}) = Re\left(\frac{1-z^{n+1}}{1-z} \right) = Re \left(\frac{1-(\cos \alpha + i \sin \alpha)^{n+1}}{1-(\cos \alpha + i \sin \alpha)} \right) = Re \left[ \left(\frac{1-(\cos \alpha + i \sin \alpha)^{n+1}}{(1-\cos \alpha) - i \sin \alpha} \right)\cdot \frac{(1-\cos \alpha) + i \sin \alpha}{(1 - \cos \alpha)+ i \sin \alpha}\right] = Re \left( \frac{(1-\cos \alpha)+i\sin \alpha - ( 1- \cos \alpha)(\cos \alpha + i \sin \alpha)^{n+1}-i \sin \alpha (\cos \alpha + i \sin \alpha)^{n+1}}{(1-\cos \alpha)^{2} + \sin^{2} \alpha}\right)$.  Then, to make a long story short, after an application of De Moivre's Theorem to turn the $(\cos \alpha + i \sin \alpha)^{n+1}$'s into $(\cos(n \alpha + \alpha)+ i \sin (n \alpha + \alpha))$'s, usage of the sine and cosine of sum identities, collecting of like terms and cancelling some things, we obtain   $\displaystyle Re \left(\frac{1-(\cos \alpha + i \sin \alpha)^{n+1}}{1-(\cos \alpha + i \sin \alpha)} \right) = Re \left(\frac{(1-\cos \alpha + \cos (n\alpha)) + i(\sin \alpha - \cos (n\alpha)\sin \alpha + \sin (n \alpha))}{2-2\cos \alpha} \right) = \frac{1-\cos \alpha + \cos (n \alpha)}{2-2\cos \alpha}$.  At least I think it does.  Which brings me to my question: is this correct? If not, where did I go wrong and how do I fix it?

Possible Duplicate:          Prove $$\cos(\alpha) + \cos(\alpha + \beta) + \cos(\alpha + 2\beta) + \dots + \cos[\alpha + (n-1)\beta] = \frac{\cos(\alpha + \frac{n-1}{2}\beta) \cdot \sin\frac{n\beta}{2}}{\sin\frac{\beta}{2}} $$


It blends with lower layers in difference mode, I know, but how can I achieve this "distorted color" effect it produces on highlight areas? (the orange and magenta areas)

so there are some idiosyncrasies with the method they use to invert that part of the image which I can't figure out. It could be that they just invert the luminosity but I don't know how i would do that in a dynamic way.


so umm my if else is buggy it only shows the else option and not the if(data == "heavy") i just want that is type is equal to heavy and not light then one of the linearlayout vanishes goes invisible and the other way around... help me please...  heres my code:      Intent intentType = getIntent();     String valueType = intentType.getStringExtra("type");     EditText displayType = (EditText) findViewById(R.id.editTextType1);     displayType.setText(valueType);      LinearLayout one = (LinearLayout) findViewById(R.id.type1);     LinearLayout two = (LinearLayout) findViewById(R.id.type2);       String data = displayType.getText().toString();     if(data == "heavy") {         one.setVisibility(View.VISIBLE);         two.setVisibility(View.INVISIBLE);     } else {         one.setVisibility(View.INVISIBLE);         two.setVisibility(View.VISIBLE);     }   the codes from previous .java file:      EditText units = (EditText) findViewById(R.id.editTextUnits);     units.setOnClickListener(new View.OnClickListener() {         @Override         public void onClick(View v) {             Intent intent = new Intent(new Intent(MainActivity.this, MainActivity3.class));             Intent intentType = getIntent();             String valueType = intentType.getStringExtra("type");             intent.putExtra("type", valueType);             startActivity(intent);         }     });   the other .java file   private void SetOnClickWeightButton(){         Button btn = (Button) findViewById(R.id.buttonWeight);         btn.setOnClickListener(new View.OnClickListener() {             @Override             public void onClick(View v) {                 Intent intent = new Intent(MainActivity2.this, MainActivity.class);                 intent.putExtra("type", "heavy");                 startActivity(intent);             }         });     } private void SetOnClickLengthtButton(){      Button btn = (Button) findViewById(R.id.buttonLength);     btn.setOnClickListener(new View.OnClickListener() {         @Override         public void onClick(View v) {             Intent intent = new Intent(MainActivity2.this, MainActivity.class);             intent.putExtra("type", "light");             startActivity(intent);         }     }); }

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


I got to a state when upgrade is not possible - old system (10.10, packages index too broken) I dediced to reinstall.  Now I'd like to keep my /home. Ideally, I'd like to burn a CD or ISO to USB and click Next, Next, Next.  How should I proceed?

Recently I installed Ubuntu 12.10 x64 Server Edition on my PC. Unfortunately, I attempted to install a lightweight desktop but due to the fact that I have an old graphics card, the PC does not perform so well. I am thinking of re-installing an Ubuntu version but I do not want to lose the contents in my home folder. Is there any way to do that with a Live CD?


I have code that uses BASE64Decoder class which is imported from package sun.misc.BASE64Decoder.But,our code got upgraded from java 8 to java 11.Java 11 rt.jar doesn't contain this package now.What is the jar to be provided in classpath that contains this package?

I have an image that is Base64 encoded. What is the best way to decode that in Java? Hopefully using only the libraries included with Sun Java 6.


I'm toying with the idea of a character based game. The characters, robots, monsters, heroes (and weapons I suppose) will all have various attributes as per a D&D game for example.   They player should be able to configure those attributes to personalize their character, so maybe they'll be given 100 points at the start to allocate how they see fit to things like strength, speed, etc...  Also, I'd like the player to be able to add additional options, like maybe shields or individual spells, things like that.   Is there a standard design pattern for things like that?   I'm hacking my way through a prototype right now, and I've been considering an Options  object that accepts an Option in the constructor, with methods addOption() and getOption.  For my implementation of Option I did the following:   class Option{    final String optionKey;   String optionString;   int optionInt;   long optionLong;   float optionFloat;   char optionType;    public Option(String optionKey, Object option){      this.optionKey = optionKey;      if(option instanceOf String){        optionString = (String) option;       optionType = 's';   }else if(option instanceOf int){      optionInt = (int) option;     optionType = 'i';     }else if(option instanceOf long){      optionLong = (long) option;     optionType = 'l';     }else if(option instanceOf float){      optionFloat = (float) option;     optionType = 'f';     }     }  public String getOptionKey(){   return optionKey; }  public String getOptionValue(){   return optionValue; }  public void setOptionValue(String optionValue){   this.optionValue = optionValue; }  public void getOptionType(){   return optionType; }  }   But now I'm thinking this is a bit much, and perhaps I should be using an options class that encapsulates a Hashmap instead. So maybe something like this:   class Options{  HashMap<String, Object> options;   public Options(String key, Object value){     options = new HashMap<String, Object>();     options.put(key, value); }  public void putOption(String key, Object value){      options.put(key, value); }  public void getStringOption(String key){      return (String) options.get(key); }  public void getFloatOption(String key){      return (float) options.get(key); }  //....... and so on...  }   I'm thinking the version directly above is better, is there a standard for this type of thing?

Overview:  Lots of games with RPG-like statistics allow for character "buffs", ranging from simple "Deal 25% extra damage" to more complicated things like "Deal 15 damage back to attackers when hit."  The specifics of each type of buff aren't really relevant.  I'm looking for a (presumably object-oriented) way to handle arbitrary buffs.  Details:  In my particular case, I have multiple characters in a turn-based battle environment, so I envisioned buffs being tied to events like "OnTurnStart", "OnReceiveDamage", etc.  Perhaps each buff is a subclass of a main Buff abstract class, where only the relevant events are overloaded.  Then each character could have a vector of buffs currently applied.  Does this solution make sense?  I can certainly see dozens of event types being necessary, it feels like making a new subclass for each buff is overkill, and it doesn't seem to allow for any buff "interactions".  That is, if I wanted to implement a cap on damage boosts so that even if you had 10 different buffs which all give 25% extra damage, you only do 100% extra instead of 250% extra.  And there's more complicated situations that ideally I could control.  I'm sure everyone can come up with examples of how more sophisticated buffs can potentially interact with each other in a way that as a game developer I may not want.  As a relatively inexperienced C++ programmer (I generally have used C in embedded systems), I feel like my solution is simplistic and probably doesn't take full advantage of the object-oriented language.  Thoughts?  Has anyone here designed a fairly robust buff system before?  Edit: Regarding Answer(s):  I selected an answer primarily based on good detail and a solid answer to the question I asked, but reading the responses gave me some more insight.  Perhaps unsurprisingly, the different systems or tweaked systems seem to apply better to certain situations.  What system works best for my game will depend on the types, variance, and number of buffs I intend to be able to apply.  For a game like Diablo 3 (mentioned below), where nearly any bit of equipment can change a buff's strength, the buffs are just character stats system seems like a good idea whenever possible.  For the turn-based situation I'm in, the event-based approach may be more suitable.  In any case, I'm still hoping someone comes along with a fancy "OO" magic bullet which will allow for me to apply a +2 move distance per turn buff, a deal 50% of damage taken back to the attacker buff, and a automatically teleport to a nearby tile when attacked from 3 or more tiles away buff in a single system without turning a +5 strength buff into its own subclass.  I think the closest thing is the answer I marked, but the floor is still open.  Thanks to everyone for the input.


I would like to let run my script on background on my server. I red about nohup. I have my script.py. I run it like this:  python3 script.py&   It runs on background even when I close terminal. The script write numbers to file /tmp/aaa.txt every second, started from 0. I disconnect from server and reconnect to it and sow that there is numbers over 3000 (over 50 minutes). So my question is, do I really need to use nohup? If yes/no why?  # hostnamectl                                                                                Static hostname: my-server                                                                                Icon name: computer-vm                                                                                Chassis: vm                                                                                Machine ID: XXXX                                                                                Boot ID: XXXX                                                                                Virtualization: vmware                                                                                Operating System: Ubuntu 16.04.3 LTS                                                                                Kernel: Linux 4.4.0-116-generic                                                                                Architecture: x86-64    My script script.py:  import time  i = 0  while True:   f = open('aaa.txt', 'a+')   f.write('Doing somethign: {0}\n'.format(i))   f.close()   i = i + 1   time.sleep(1)

I've read and understood about how you create a daemon process, but from everything I read I never really understood why it needs to be done.  I've read that we do the fork - setsid - fork to avoid the process to gain control of a terminal, but what does this mean ? If I start a program in the background using & (for example './script &' ), what makes this process' execution different than if I ran normally a program that turns itself into a daemon ?  Does this simply mean that if I logout the background process will stop and the daemon will keep running ? I'm really having trouble understanding the 'gain control of a terminal' thing.  The reason this bothers me is because I'm working on an embedded RPi on a robot and I thus need to make programs start on boot. Currently I'm just starting them from rc.local with a command like this su user -c 'python /home/user/launcher.py &' &. I've never had any problem with the program starting on boot (I can even see the process using ps -e when SSHing to the RPi), but I would like to know if there's any risk / if it's bad practice.


I know that "myself" is a reflexive pronoun and can also be used for emphasis.  When writing something to the tune of "I myself would love to go hiking."  Wouldn't it be proper to use it as an interjection "I, myself, would like to go hiking." An interjection of this sort would typically clarify to whom the pronoun is referring, however "I" is already a clear indicator of who I am, without the "myself" attached.    TL;DR:  Shouldn't I be using interjection commas for the phrase "I, myself, ..."?

The boy's innate goodness will withstand the challenges because unless he himself wants to turn evil, [...].   My teacher thinks that commas should set off the word "himself", but I disagree. Who is right, and why?


I have a problem with my mesh (blend file at the bottom), I want to connect these two sides of the object so the mesh creates something like a loop. Mesh is fine and smooth if those sides are not connected, but every time I try to connect them with "merge by distance" the lighting on "shade smooth" will break and the mesh will end up looking weird. I have no idea why is that.  My mesh is not that bad (I personally think it's clean).  I was trying to make this mesh as simple and clean as I could. Here is my blend file.

While rendering a mesh with smooth shading on, I get a dark region/shadow on certain faces. The effect is more evident when smooth shading is applied to a mesh containing ngons, with the ngons turning black when rendered.   The blackening effect is visible in the viewport too.  How can I solve this problem?


The Stack Exchange Android app hasn't been working for me for half a year. I only still have it for the notifications.  Even after reinstalling, notifications are the only feature that works. When I start the app, it only loads for some time and then shows a loading error. No home page, no notification drawer.  I also see that it's last been updated in 2017. Have they been working on a PWA the last two years or what?  I'm using an HTC one M9 with Android 7.1.

I'm using the official Stack Exchange mobile app for iOS or Android, and  My app crashed! It doesn't look good on my new smartphone. It won't run after I updated my device. I noticed another bug. I have an idea for a new feature which is currently not in the app.  How do I report bugs with or request features for the iOS and Android apps? Also:  I've used the built-in functionality of the app to report a bug or submit a feature request. Did I do the right thing? The app prompted me to post on Meta after an error occurred. Should I post about it here? I'm wondering why the latest version is from 2017. I've heard rumors that the apps are no longer supported; is that true? I can't find the app on my device's app store anymore! Where did it go?     We get a lot of bug reports from users about the mobile apps, which are unsupported, and at the moment, there is no centralized Q&A pair for those to be closed as duplicates of (the relevant answers are spread across multiple unrelated questions). This question is an FAQ proposal, to serve as a directly-related duplicate target for those questions.


Ex. I have one script Test.sh  #!/bin/sh echo "/n read the value" read info  if [ "$info" = 1 ]; then echo "yes" else echo "no" fi   I want to call Test.sh script from another script (test2.sh) in nohup mode. Is there any way i can provide the value to "read info" by passing with arguments/ any other way.  test2.sh  #!/bin/sh Test.sh

I know that shell scripts just run commands as if they were executed in at the command prompt.  I'd like to be able to run shell scripts as if they were functions... That is, taking an input value or string into the script.  How do I approach doing this?


How many distinct eigenvalues are there in the matrix.  $$     \begin{bmatrix}     1 & 1 & 1 & 1 \\     1 & 1 & 1 & 1 \\     1 & 1 & 1 & 1 \\     1 & 1 & 1 & 1 \\     \end{bmatrix} $$  I was wondering that is there any specific eigenvalues for matrices like this??  I hope I wouldn't have to find the determinant of this 4×4 matrix.

This question aims to create an ""  of numerous questions that ask about determinants of specific matrices (I may have missed a few):              The general question of this type is  Let $A$ be a square matrix of rank$~1$, let $I$ the identity matrix of the same size, and $\lambda$ a scalar. What is the determinant of $A+\lambda I$?  A clearly very closely related question is  What is the characteristic polynomial of a matrix $A$ of rank$~1$?


Hello I need to create folder based on a filename and in this folder create another one and then move file to this second folder  example:  cat.jpg create folder cat create folder picture move cat.jpg to picture    all my .jpg files are in      /root/Desktop/My_pictures   so it should look like this:  example picture "cat.jpg"   /root/Desktop/My_pictures/cat/pictures/cat.jpg   Sorry if I'm not precise but English is not my native language.  Best Regards and Thank You

I have some files with different extensions such as *.pdf, *.mp3, *.jpg and a few others. All of them are stored in a parent directory.  How can I get a list of all extensions, create some folders based on these  extensions and then move all files into their relevant folders?


I read these books in the late 60s or 70s. There were two books in the series. I don't remember the author or titles.  There is a war between humans and aliens. A human ship crashes on a unexplored planet. They struggle to survive and live in a bunch of caves. One of the politicians refuses to work and is finally executed for hoarding. There is native life on the planet. A wolf-like species battles the humans but eventually they are found to be sentient and a truce is made. Another alien is a gopher-like creature that is telepathic and can relay messages.  After many years the humans, wolves and gophers live in harmony. Then an alien spaceship lands on the planet. The humans and their allies kill the aliens and take over the ship.  The second book is about them going out and conquering the alien empire and rescuing the human planets. It has a little of the flavor of Poul Anderson's The High Crusade.

I'm trying to find a short story that I read years ago.  There were a group of humans marooned on a high gravity planet by an alien species.  On the planet they encountered saber-tooth cat-type animals that they eventually became allies with. There were also telepathic squirrel-like creatures that allowed them to communicate over distance.  The aliens that marooned them returned generations later, but the high gravity and hardships of the planet made the offspring of the original humans become superior warriors, which allowed them to destroy the aliens.