Do both imply the same meaning?   John told me to be there at 6pm. I will be there on time. John told me to be there at 6pm. I will be there in time. John told me to be there at 6pm. I will be there at that time.   I can feel that in time needs a for or a to but am not sure. Like in I'll be there in time for the show to start. or  I'll be there in time to see it. (on time won't work)

I have an appointment at 8 and I arrive there at 7:55, is it "on time" or "in time"? What about "the nick of time"?


I have a doubt that why TWRP Recovery tool is being developed for each smartphone specifically even it does an almost same thing in android phones?

Whenever I follow a root guide, I see a link to super su and twrp files. Is this super su and twrp file the same file for all phones or is there a different super su for each phone? Also, if it exists for each phone, is it rom specific? Do I need a seperate super su file for cm 13 and stock rom on the same phone?


I have a new fortress that is coming along great. I have a axedwarf squad set up and armed with copper. I found a small vein of one stone that is used for smelting into iron. I don't think that the vein I found will be enough. I need to find more, so my axe-dwarves can get real armor and weapons. Any advice?

From reading the wiki, it seems that iron ores can be found in layers consisting of chalk. I've now mined out almost two complete layers of chalk, and found nothing but gems. Is it possible that my map doesn't have any iron ore, or am I misunderstanding how to find the ore?  The first couple of layers consist of chalk, so that's where I'm digging. Unfortunately the strip mining makes the fortress quite ugly, as that's where I've got my workshops. The lower levels have mainly phyllite and schist.


I have a tar.gz file. I was extracting the original from it but tar command gives following error:   where numeric off_t value expected   While gtar runs perfectly.  Tar.gz was made using gtar command. I have other tar made with same process but they are fine.   Can anyone tell me what might be the cause of this. I have googled a little, but cannot find a satisfying answer.

I have a corrupt tarball on my hands. My first attempt at recovery went like this:  $ tar --ignore-failed-read --ignore-command-error -xf tarball.tar tar: Skipping to next header tar: Archive contains ‘180738 0’ where numeric mode_t value expected tar: Archive contains ‘0.445647 -9.’ where numeric time_t value expected tar: Archive contains ‘.259273 ’ where numeric uid_t value expected tar: Archive contains obsolescent base-64 headers tar: Archive contains ‘-0.94874’ where numeric gid_t value expected tar: text from a text file is here: implausibly old time stamp 1969-12-31 18:59:59 tar: more text file contents are here: Unknown file type 'p', extracted as normal file tar: Skipping to next header tar: Skipping to next header tar: Exiting with failure status due to previous errors   This didn't extract much from the tarball before erroring out. The exit status is 2 which the tar man page says is a fatal error.  The documentation for "" suggested this:  cpio -F tarball.tar -i -v   This extracted 1.2G of a 1.8G tarball, which is pretty good. It stops with a bunch of garbage entered after the terminal prompt -- it isn't printed to the screen, it's as if I had typed it and didn't hit return yet.  Is there a way to do any better? Is there a way to try and "jump over the bad chunks" of the tarball?  With --ignore-zeros tar seems to be reading through the entire tar file.  tar -R --ignore-failed-read --ignore-command-error --ignore-zeros -xvf tarball.tar [...] block 3670356: ** Block of NULs ** block 3670357: ** Block of NULs ** block 3670358: ** Block of NULs ** block 3670359: ** End of File ** tar: Exiting with failure status due to previous errors   There are a lot of Block of NULs errors so it looks like the contents might be irretrievable.


I am wondering if the Activity Monitor does not work correctly. In both cases I had the browser open with one tab pointed to Google.com  Neither browser has any additional extensions installed and both are up to date as of 05/13/19 ( Firefox Quantum and Safari 12.1 )

I have been peaking in macOS Activity Monitor and found this:  One tab spawns atleast 3 processes:   Firefox ~400MB FirefoxCP Web Content ~200MB FirefoxCP Web Extensions ~200MB     Update - ran again and got these numbers ...


Can someone please tell me how to prove that there is no last prime number? I am familiar with Euclid's one, but I'm looking for a different way. I'm in 11th grade and I can do intermediate algebra and basic calculus. Only a basic idea/guidelines would suffice.

This is just a curiosity. I have come across multiple proofs of the fact that there are infinitely many primes, some of them were quite trivial, but some others were really, really fancy. I'll show you what proofs I have and I'd like to know more because I think it's cool to see that something can be proved in so many different ways.  Proof 1 : Euclid's. If there are finitely many primes then $p_1 p_2 ... p_n + 1$ is coprime to all of these guys. This is the basic idea in most proofs : generate a number coprime to all previous primes.  Proof 2 : Consider the sequence $a_n = 2^{2^n} + 1$. We have that  $$ 2^{2^n}-1 = (2^{2^1} - 1) \prod_{m=1}^{n-1} (2^{2^m}+1), $$  so that for $m < n$, $(2^{2^m} + 1, 2^{2^n} + 1) \, | \, (2^{2^n}-1, 2^{2^n} +1) = 1$. Since we have an infinite sequence of numbers coprime in pairs, at least one prime number must divide each one of them and they are all distinct primes, thus giving an infinity of them.  Proof 3 : (Note : I particularly like this one.) Define a topology on $\mathbb Z$ in the following way : a set $\mathscr N$ of integers is said to be open if for every $n \in \mathscr N$ there is an arithmetic progression $\mathscr A$ such that $n \in \mathscr A \subseteq \mathscr N$. This can easily be proven to define a topology on $\mathbb Z$. Note that under this topology arithmetic progressions are open and closed. Supposing there are finitely many primes, notice that this means that the set $$ \mathscr U \,\,\,\, \overset{def}{=} \,\,\, \bigcup_{p} \,\, p \mathbb Z $$ should be open and closed, but by the fundamental theorem of arithmetic, its complement in $\mathbb Z$ is the set $\{ -1, 1 \}$, which is not open, thus giving a contradiction.   Proof 4 : Let $a,b$ be coprime integers and $c > 0$. There exists $x$ such that $(a+bx, c) = 1$. To see this, choose $x$ such that $a+bx \not\equiv 0 \, \mathrm{mod}$ $p_i$ for all primes $p_i$ dividing $c$. If $a \equiv 0 \, \mathrm{mod}$ $p_i$, since $a$ and $b$ are coprime, $b$ has an inverse mod $p_i$, call it $\overline{b}$. Choosing $x \equiv \overline{b} \, \mathrm{mod}$ $p_i$, you are done. If $a \not\equiv 0 \, \mathrm{mod}$ $p_i$, then choosing $x \equiv 0 \, \mathrm{mod}$ $p_i$ works fine. Find $x$ using the Chinese Remainder Theorem.   Now assuming there are finitely many primes, let $c$ be the product of all of them. Our construction generates an integer coprime to $c$, giving a contradiction to the fundamental theorem of arithmetic.  Proof 5 : Dirichlet's theorem on arithmetic progressions (just so that you not bring it up as an example...)  Do you have any other nice proofs?


Regarding the new vote in the EU parliament, I wanted to know the affect on traveling in the EU if already possessing a visa.    For the case of already having a visa to enter one EU country, either long-term work or study, would there be a need to obtain another visa when entering another EU Country? (Ex. Possession of US Passport + German Work Visa, but want to visit France)

I have planned travel to Iceland, Germany and Spain this summer, from July 1st to July 21st. I see that EU Commission is now considering visa requirements for US citizens and may come to a decision by mid June.    How do I apply for a visa when there is no current requirement?


Is it possible for an iOS app to retrieve the cell number of an iPhone? It is possible on Android but I am not sure about iOS. Any help would be appreciated.

Is there any way to get own phone number by standard APIs from iPhone SDK?


I'm curious to see if there are any useful metrics to evaluate classification models using numeric probabilities.  Traditionally, I would train a classification model, generate factor predictions on the test set, and use a confusion matrix or ROC curve to decide on the best models. However, in this instance, I'm interested in doing model evaluation from looking at the numeric probablities.  Update  An example of what I'm talking about is this: I fit a multiple models and have it predict classes on the test set. Usually I can create a confusion matrix  Model 1       Yes  No   Yes  10   5  No    2  13    Model 2       Yes  No   Yes   3  11  No    8   8   From the confusion matrix, I can clearly tell that model 1 is more accurate than model 2.  How would I evaluate two models if I have them give me numeric probablities instead, for instance:  Model-1 Preds    Model-2 Preds     Test Set      .59               .25             No     .14               .08             No       .                 .              .       .                 .              .       .                 .              .     .33               .29            Yes     I have thoughts of discretizing them or converting the yes and no's into 1 and 0's and calculating the residuals. Just wanted to know if there are more formal best practices to use in this case.

I'm modelling an event with two outcomes, a and b. I have created a model which estimates the probability that either a or b will happen (i.e. the model will calculate that a will happen with 40% chance and b will happen with 60% chance).  I have a large record of outcomes of trials with the estimates from the model. I would like to quantify how accurate the model is using this data - is this possible, and if so how?


I want to generate a unique id for my patient class, so I referred question    And the class below  class patient {      int id;      static int current_id;      patient() : id(current_id++) {} };  int patient::current_id;   For each time executing program it is generating 'current_id' from 1 to 'n'. Here n=1,2,3,4.....  I want to generate 'current_id' uniquely, even I execute program for any number of time it should be unique.  And  I am doing a c++ project to store Customer and Product information, and I want to store it in a file.  class Customer {     int id;     string name;     string type;     unsigned long long int PHNO;     string street,city;     unsigned int PIN; public:     Customer(){}     friend void readdata(); }; class Product {     int pid;     string pname,ptype;     unsigned int price;     string brand_name,suitable_for; public:     Product(){}     friend void readdata(); };   Here I will not take 'id' or 'pid' as input but I want to generate it automatically and then it should be stored in a file.  I also referred     but I don't know how to use in above class.  Is there any way to generate unique 'current_id' ?  If anybody know answer post suitable OR modified class also.

What is the best way to programmatically generate a GUID or UUID in C++ without relying on a platform-specific tool? I am trying to make unique identifiers for objects in a simulation, but can't rely on Microsoft's implementation as the project is cross-platform.  Notes:    Since this is for a simulator, I don't really need cryptographic randomness.  It would be best if this is a 32 bit number.


I was trying to solve a question from Hatcher's book in section 3.3.  Question is:  Show that there exist a non-orientable 1-dimensional manifold if Hausdroff condition is droped from the definition of manifold.  I know real line with two origin is a 1-dimensional non-Hausdroff manifold. But I don't know how to show that this is orientable or not? I will apprecite if somebody explain this to me using the local homology definition of orientability.

Is there any nice example of a 1-dimensional non-hausdorff manifold that is not oriented? I have tried the line with two origins, but maybe something more exotic is needed?


. It is a mathematical expression/sequence/set of numbers with the arrow exactly under any one of the numbers (with or without n= 0). How to do it in latex? Any of the up arrow types (single line or double line) shown in the figure is okay.


For instance, . A non-user (Anonymous) changed the to they while there were , but they added a comment to the bottom, which I have seen before1:  <!--- please remove it, it's for 6chars limit -->   This makes me a little angry, I'll be honest -- either change 6 characters like you're supposed to, or live with nothing changing until a user with edit privileges comes along.  In this case, I would say reviewers should have unanimously rejected with "this edit does not fix critical issues with the post".  Even if there aren't other changes that really need addressing, should reviewers really be accepting edits which make such a tiny change and which make no attempt to hide the fact they're breaking the rules?    1I swear there's an MSE or MSO question complaining about the 6-char limit and this is given as an answer.

I regularly review suggested edits on the . One common situation is that a user will propose a tiny edit, like , or removing only the salutation from a post. In many cases there are still multiple further improvements that could be made, but that editor hasn't seen them - or can't be bothered.  I feel uneasy accepting such edits. On the one hand, it reminds me of the army of 'twiddlers' on Wikipedia, who spend their time making tiny inconsequential edits when they could be doing something much more useful. It also feels lame to award someone any points at all for capitalising a single letter in a title. I sometimes feel that this may be a kind of gaming of the system on the part of some users - suggesting multiple small edits for point gain rather than just fixing the whole post. I also see this with tag wiki editing.  On the other hand, it is a valid edit, and it does objectively improve the post.  There has been a prior ruling on part of this. There was some substantial discussion about the aggressive removal of salutations during the Rich B era (remember that wonderful chap?). I seem to remember that the conclusion was that removal of "hi! / thanks!" on their own was not sufficient grounds for a post edit, although I can't find that now ( is relevant, but inconclusive).  I have been erring on the side of 'this edit is pointless' and voting to reject, but I notice I am often overruled by other reviewers.  Perhaps one answer would be to provide a third option, after accept/reject:insufficient?  What behaviour are we intending to reward here?


I'm wondering if it's possible to hide a folder without renaming it with a dot on the Desktop.  Ubuntu 12.04  Thanks

The OCD in me wants directories I do not like the name of to be hidden since I do not interact with them directly.  How can I hide directories without using the dot notation?


I'd appreciate if anyone could help me figure out what font Munkres used in his famous "Topology" book. I am interested in the font used in the main body as well as the font used in his "theorem" environment.  I searched the Internet for similar questions with no success. I also tried "myfonts.com," but that did not yield any satisfactory results. Finally, I looked at PDF version of his book and by going to "documents properties," I checked the fonts that the pdf viewer was able to detect. However, the results (mainly variations of Courier, Helvetica, and Times) do not look quite similar to what it really is.  The reason I am asking this question is that Munkres strikes me as an incredibly easy book to read and I would like to format my papers in a similar manner. As a example, his "f" in a theorem environment looks differently than his "f" in a math mode, which makes it extremely easy to distinguish between the two.  Below you can a few screenshots from his book.  Thank you for all your help.  EDIT: I understand that some of you may think it is a duplicate of  , but I tried methods mentioned in that post and it did not solve my problem. However, thankfully some of you have already answered my question, which I am very grateful for.

Is it possible to identify the font used in a specific document/picture?  Answers to this question should identify:   Possible methods to do this (perhaps one answer per method) and adequately describe how to use it (as opposed to merely stating it); Ways of finding the identified fonts, if possible (free or not); and Any prerequisites associated with the method used, if required (for example, "In order to use method X, your document has to be in format Y").   This question is meant as an FAQ, based on an . Its aim is to facilitate the community with the general procedures involved in font identification. Similar cases are solved on a per-usage basis on 's  tag.


I missed the chance to get the hard mode on the Cayo Perico heist on GTA Online, so if I complete the normal one again can I get the hard mode again?

After I finished The Cayo Perico Heist, I tried setting up another heist in the Kosatka, and got this message :  The setup cost for The Cayo Perico Heist is $25000. Setting up now will set the heist to Hard Mode. Do you wish to proceed?  It seems that there is a cooldown period before the heist reverts to normal mode from hard mode. How long will it take before it reverts to normal mode? Also, does the cooldown timer run even if you're logged out of GTA Online? E.g., if I quit GTA Online just after finishing the heist, the next time I log back in, will I have to wait for the cooldown period to finish before it reverts to normal mode?


I have a large number of samples (say $N$) from a multimodal joint probability distribution, for example:  a     b     c     d     e     f  0.01  5.37  2.87  3.22  1.93  5.38 0.07  5.24  2.99  3.56  2.02  6.01 ...   I want to find the values $(a,b,c,d,e,f)$ at which the joint probability density function attains its maximum value.   How can this be best achieved?

Short version: What's the most computationally efficient method of estimating the mode of a multidimensional data set, sampled from a continuous distribution?  Long version: I've got a data set that I need to estimate the mode of. The mode does not coincide with the mean or median. A sample is shown below, this is a 2D example, but an N-D solution would be better:    Currently, my method is   Calculate kernel density estimate on a grid equal to the desired resolution of the mode  Look for the greatest calculated point   Obviously, this calculates the KDE at a lot of non-plausible points, which is especially bad if there are a lot of data points of high dimensions or I expect good resolution on the mode.  An alternate would be to use a simulated annealing, genetic algorithm, etc to find the global peak in the KDE.  The question is whether there's a smarter method of performing this calculation?


I am a teacher. Usually, at the end of my classes, I want to share some files and folders in my computer (Windows 8) with my students. I have bought a USB hub that supports 4 parallel usb drives. However, I must copy the clipboard for each student, one by one (I usually forget about to which one the files are copied, so I have to resend them :(  ). I am seeking a solution that can send my clipboard to all connected removable drives (, and if possible, send them to a new folder).  Any help is appreciated.

I have a several large files on optical media I would like to copy to multiple targets - in this case I have two hard drives attached to the same computer. Is there a utility that can function like:  copy source target1 target2 ... targetN


For dot net programs, where is the "right" place to store serialized data?   In the /user/username folder? Program Files/MyAppName/? Someplace else?

What I want to achieve is very simple: I have a Windows Forms (.NET 3.5) application that uses a path for reading information. This path can be modified by the user, by using the options form I provide.  Now, I want to save the path value to a file for later use. This would be one of the many settings saved to this file. This file would sit directly in the application folder.  I understand three options are available:   ConfigurationSettings file (appname.exe.config) Registry Custom XML file   I read that the .NET configuration file is not foreseen for saving values back to it. As for the registry, I would like to get as far away from it as possible.  Does this mean that I should use a custom XML file to save configuration settings?  If so, I would like to see code example of that (C#).  I have seen other discussions on this subject, but it is still not clear to me.


Please, suggest any single word that can define the meaning of this following phrase:     Group of intelligent people.

What could be a good word for "a group of intellectuals" or "a group of smart learners"? Any suggestions of related terms also invited.


My bank offers 11% interest rate for 1-year deposit in USD. This is similar to what other Ukrainian banks offer but much higher in comparison with our neighboring countries, Belarus (3.5%) and Poland (1.8%). In the US it seems to be even lower at .2%.  Why is it so different from country to country? Is it all about the risk? I believe this rate was the same even before the war.

I was in Ukraine and ran into a few banks that offer anywhere from 5% to 10% interest rate on investment per annum. For example, Erste Bank is willing to pay . I have few accounts with Chase, and those guys are offering 0.25% APY for 12 months. This made me thinking because the difference is huge.  I have looked at  and answers there highlight the risk of investment associated with exchange rates and non-FDIC insured banks. On top of it, I still have few questions.   If I make an investment in USD, in foreign bank, does that imply currency conversion or no? I have heard that all financial operations must be performed in national currency. Does it mean that to deposit or withdraw money to/from bank account in foreign country, even though in US dollars, money must be converted to and from national currency? Is FDIC insurance really that expensive to drop the interest from, say, 5% to 1.25%? Or otherwise why foreign banks offer that much higher rate of return? I am thinking about splitting some money across many foreign banks. Is there anything else I should take into account?


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

In PHP, the HEREDOC string declarations are really useful for outputting a block of html.  You can have it parse in variables just by prefixing them with $, but for more complicated syntax (like $var[2][3]), you have to put your expression inside {} braces.  In PHP 5, it is possible to actually make function calls within {} braces inside a HEREDOC string, but you have to go through a bit of work.  The function name itself has to be stored in a variable, and you have to call it like it is a dynamically-named function.  For example:  $fn = 'testfunction'; function testfunction() { return 'ok'; } $string = <<< heredoc plain text and now a function: {$fn()} heredoc;   As you can see, this is a bit more messy than just:  $string = <<< heredoc plain text and now a function: {testfunction()} heredoc;   There are other ways besides the first code example, such as breaking out of the HEREDOC to call the function, or reversing the issue and doing something like:  ?> <!-- directly output html and only breaking into php for the function --> plain text and now a function: <?PHP print testfunction(); ?>   The latter has the disadvantage that the output is directly put into the output stream (unless I'm using output buffering), which might not be what I want.  So, the essence of my question is: is there a more elegant way to approach this?  Edit based on responses: It certainly does seem like some kind of template engine would make my life much easier, but it would require me basically invert my usual PHP style.  Not that that's a bad thing, but it explains my inertia..  I'm up for figuring out ways to make life easier though, so I'm looking into templates now.


In One Piece, I know that when a Devil Fruit eater is unconscious the people that were affected by the fruit are then returned to normal, like in Sugar's situation for example. And I was thinking, being asleep is also a state of being unconscious.  So does Sugar ever sleep or is being asleep a different story?

I have noticed something rather strange: Why do devil fruit users abilities nullify when they are knocked unconscious but not when they fall sleep?  Take Moria for example. Moria had control of all the shadows when Luffy knocked him out, allowing the shadows to escape, so why does sleeping not do the same? Certainly he had to have fallen asleep at some point in time before Luffy had knocked him out.  Same is the case with Sugar. She was scared unconscious by Usopp and all the toys turned back to their human forms. Is there something about being knocked unconscious and falling asleep that is different in the One Piece Universe?


I'm an Indian citizen travelling back to India. On the way, I have a layover time of 8 hours at Frankfurt International Airport. Do I need a transit visa? I have an Indian passport and Brazilian tourist visa.

I found many related questions on this site but I am still not sure about the rules. How can I decide if I need a visa to transit? Schengen members as of May 2021 are as follows:  Austria Belgium Czech Republic Denmark (excluding Greenland and the Faroe Islands - but an open border with the Schengen Area is maintained) Estonia Finland France (excluding overseas departments and collectivities) Germany Greece Hungary Iceland Italy Latvia Liechtenstein Lithuania Luxembourg Malta Netherlands (excluding Aruba, Curaçao, Sint Maarten and the Caribbean Netherlands) Norway (excluding Svalbard) Poland Portugal Slovakia Slovenia Spain (except Ceuta and Melilla) Sweden Switzerland


I'm confused about the 200mm and the 300mm zoom ranges. I am looking for some examples of the same subject, in order to visualize the difference between 200mm and 300mm focal lengths.  I want to compare the results for a very distant subject (like the moon) to a far subject (may be 1km away) and a nearer subject (around 100 meter away).

I have seen many camera review sites illustrate the effect of using different focal lengths on the same photograph using frames. There are also similar illustrations to compare different sensors (). I find this kind of visualization to be very useful in comparing the actual effect of the longer focal length\different sensor size. Of course the ability to do a wider focal length visualization would also be equally useful, but that's not possible.  Is there any ready-made software or plugin that enables this? If not, is there any simple technique to visualize the effect of longer focal lengths on an image (one would of course have to use the zoom information in the image EXIF data to accurately represent this)? All I can think of is to use some trigonometry to do the necessary calculations for the frame sizes for cropping.


My try:  Consider points $a_0,a \in A$ where A is star convex. Now by the definition of star convex there exists a path between $a, a_0$ lying in A. That is, $F(a,t)=(1-t)a+t(a_0)$. Consider a loop $p$ . Then the map defined by $f:I \times I \to A$, $$f(s,t)=F(p(s),t)$$ such that $f(s,0)=p(s), f(s,1)=a_0$ is a path homotopy between the constant map and $p$ . Since the straight line homotopy is the path homotopy here, $\pi_{1}(A,a_0)$ is trivial. Also A is path connected . These two show that A is simply connected.  Is my proof correct?

We define a set $S \subset \Bbb{R}^n$ to be star convex if there exists $a \in S$, such that the line segment connecting $a$ and any other point in $S$ lies entirely in $S$.  I would like to show that it's simply connected.  Can someone verify my proof?  The set $S$ is certainly path connected since given $x,y \in S$, we can construct a path from $x$ to $a$ and $a$ to $y$ , and so adjoining the paths yields a path from $x$ to $y$.  Also given any loop $p(r)$, $r \in [0, 1]$, we have a straight-line homotopy  $$H(r, t) = ta + (1-t)p(r)$$  with $H((r, 0) = p(r)$ and $H(r, 1) = a$, so $p$ is homotopic to a point, meaning $S$ is simply connected.


I am running a C program in a Cent OS machine. Now, the lab is locked in this weekend, but I have access to another lab of the institute. I can access the files etc. via SSH from a Mac machine in the second lab, but I need to get access to the terminal (to see the output from the C program).

I have a running program on a SSH shell. I want to pause it and be able to unpause its execution when I come back.  One way I thought of doing that was to transfer its ownership to a screen shell, thus keeping it running in there.  Is there a different way to proceed?


Let's say I have a vector like this: $⟨-2,7,4⟩$ What's the best way to find a perpendicular vector for this? Right now I'm doing $-2x+7y+4z=0$ And plugging in random values for $x$, $y$, and $z$ until I get $0$. This can't be right, right?

How do I find a vector perpendicular to a vector like this: $$3\mathbf{i}+4\mathbf{j}-2\mathbf{k}?$$ Could anyone explain this to me, please?  I have a solution to this when I have $3\mathbf{i}+4\mathbf{j}$, but could not solve if I have $3$ components...  When I googled, I saw the direct solution but did not find a process or method to follow. Kindly let me know the way to do it. Thanks.


I made a small animation. Very simple, just a floating cube and a color changing light. After fighting a bit with key frames it was time to render, I realized I have no idea how to export this. How do I export the video?

Yesterday I was working on a simple animation, an animated logo.   Here is an image of the progress:    I already have the animation working and everything is okay with the project, but I can't figure out how I can render the animation and turn it into an AVI format video.  How do I render an animation in Blender?


I have recently purchased a Canon MP230 for college and I am trying to install it onto my computer which is running Ubuntu 12.04. I have checked the connections and it is switched on.  I initially couldn't find the printer in system settings. The only options given was URI and Network Printer. Eventually, after installing updates, it found a printer connected through USB. When I searched the database, it didn't have the model of this printer. I tried searching for the PPD file but couldn't find it on the installation disk. (I'm still new to Ubuntu in some aspects). I tried typing the make and model in manually but it wouldn't search for the drivers. I downloaded the drivers from the Canon Europe website, both the Debian 32 bit version and the RPM version. The RPM version wouldn't install at all and the debian I tried running through the Software Center. I tried to access the printer again through system settings and it will not find it as happened before the updates. I proceeded to install through the terminal but it could not find a connected printer.   I have an art project due in 2 weeks and need the printer and scanner up and running asap.

when installing scangear (using scangearmp-mp230series2.0-1-deb) for canon pixma mp230 it stops with    Error: Dependency is not satisfiable: scangearmp-common (>= 2.00),      and scanimage -L responds   No scanners were identified. If you were expecting something different, check that the scanner is plugged in, turned on and detected by the sane-find-scanner tool (if appropriate). Please read the documentation which came with this software (README, FAQ, manpages).


I have a function for replacing a shortcode with a bulletpoint (Unordered list)  Shortcode looks like this:   [bullet:This is my bullet]  And becomes this

This is my bullet

   When it's been processed by this  function replaceBulletTag(text) {     if (~text.indexOf('[bullet:')) {         var value = text.split('[bullet:')[1].split(']')[0];         text = text.replace(/\[bullet:(.+?)\]/g, '

'+value+'

');     }      return text; }   This works wonders.    My question is; How do I use a variable in my regex?  I want to replace a button shortcode with an html button. I need this to be a variable, because the button changes based on some other code.  var text = 'Are you happy? Then press the button [yes-button:Yes, I am happy]'; var button = '[yes-button:'; var value = text.split(button)[1].split(']')[0]; //Yes, I am happy   But if i use the same regex as in my replaceBulletTag function, it doesn't work.  text = text.replace(/\button(.+?)\]/g, '<button>'+value+'</button>');   I've also tried  text = text.replace('/\'+button+'(.+?)\]/g', '<button>'+value+'</button>');   It should become  Are you happy? Then press the button <button>Yes, I am happy</button>     EDIT  I have also tried   var regex = new RegExp(${button}(.+?)],'g'); text = text.replace(regex, '<button>'+value+'</button>');

I would like to create a String.replaceAll() method in JavaScript and I'm thinking that using a regex would be most terse way to do it.  However, I can't figure out how to pass a variable in to a regex.  I can do this already which will replace all the instances of "B" with "A".  "ABABAB".replace(/B/g, "A");   But I want to do something like this:  String.prototype.replaceAll = function(replaceThis, withThis) {     this.replace(/replaceThis/g, withThis); };   But obviously this will only replace the text "replaceThis"...so how do I pass this variable in to my regex string?


If $ a > 1 $, then      $$ \lim_{x \to \infty} \frac{a^x}{x} = \infty. $$   Above one can find the limit which is to be shown. Any tips? The epsilon/delta method, taylor series, definition of a derivative, etc, are not accepted as it is viewed as circular reasoning. Anyways, I really do not know how start but I guess that I should use the squeeze theorem someway down the track.

In other words, how to prove:  For all real constants $a$ and $b$ such that $a > 1$, $$\lim_{n\to\infty}\frac{n^b}{a^n} = 0$$  I know the definition of limit but I feel that it's not enough to prove this theorem.


In this case :  the HTML content(Note: the id contains a .):  <input id="register.address1" name="address1" class="text" value="" type="text">   the jQuery content:  $("#register.address1").css('display','none');   I am unable to make changes to this register.address1 because it contains a .. I concluded it after replacing the . with a - gave me desired result.  But as I am not allowed to change the register.address1 because the framework in which I am working does not allow me to do so. So what is other work around for this problem?

If my html looked like this:  <td class="controlCell">     <input class="inputText" id="SearchBag.CompanyName" name="SearchBag.CompanyName" type="text" value="" /> </td>   How could I select #SearchBag.CompanyName with JQuery? I can't get it to work and I fear it's the dot that's breaking it all. The annoying thing is that renaming all my id's would be a lot of work, not to mention the loss in readability.  Note: Please let's not start talking about how tables are not made for lay-outing. I'm very aware of the  and try hard to use it as much as possible.


Could a strong enough telescope read a newspaper on a planet 1400 light years away, or is there a theoretical limit to the resolution of magnification?

Like, if you grabbed the asteroid  and hammered it out into a disc of  iron foil and curved it into a telescope mirror , could you resolve details on the surface of an exoplanet?  At what resolution?    Could you make the mirror arbitrarily bigger and continue to get better resolution?    What are the formulas for calculating this and what are the limits, if any?    If you make a big enough mirror could you see individual houses on ?  Could aliens with big telescopes have videos of  in their libraries?


I have a small code snippet has below  $duration = 0; if ($duration == 'daily') {     $duration = '+1 DAY'; }  echo $duration;   I am expecting 0 has output but end results are +1 DAY. i am not able to understand why above conditions is success?  But we i use === returning expected results.  I have checked in php 7 and php 5.5. both versions are giving the 0 as output.

What is the difference between == and ===?  How exactly does the loosely == comparison work? How exactly does the strict === comparison work?  What would be some useful examples?


I've heard of one before and I think the style of time travel fighting in it was called Temporal Flux but I'm not sure. So could anyone help me?

I am looking for a book that I read back in the 90's about a guy who's lost his memory and figures out, eventually, that he's a god and part of the universal battle between good and evil, or maybe chaos and order (no, it's definitely not Chronicles of Amber, although some of the story line is similar). My memory seems to think that he fights as an indestructible flying golden/metal lion or something similar at times. I also seem to remember that he loses his first major battle and has to go off for a long time to heal before he comes back and eventually prevails.   I was thinking it was a story by Roger Zelazny, but I don't see anything in his bibliography that fits exactly. Also, the gods are part of a pantheon — I just can't remember which.


I have been trying to install Ubuntu 14.04 alongside windows 8.1 from a bootable USB. I am new to using a Linux OS. I turned off fast boot option, and I left secure boot on (I also tried off, but then it's stuck on a blank screen rather than this). I have a Nvidia 880M if that is affecting anything.  I get stuck on this screen whether I choose "try Ubuntu without installing" or "install Ubuntu". This text is shown when I am stuck on the black screen.

I am trying to boot Ubuntu on my computer.  When I boot Ubuntu, it boots to a black screen.  How can I fix this? Table of Contents:


Is was wondering what sequence of steps does the OS take when we trigger the remove device safely option?  Are the steps OS (in)dependent?

Quite often when I'm in a rush, I automatically pull out a USB pendrive or USB cable from an external hard drive from my desktop PC or laptop, without right-clicking on the safely remove icon in the system tray and unplugging via this route. So far nothing untoward has happened every time I have "been in a rush".  What is the rationale behind right clicking on the safely remove icon and can I really lose information on USB media if this is not carried out?  Edit  Is the vunerability of losing such information greatly increased, if the usb media is still flashing at the time of pulling it out of the computer (as opposed to non-flashing)?


I'm trying to make a game where you play basketball as a catapult. Obviously an idea like this leans heavily on the unity physics engine. The cup of the catapult has a bucket on it to keep the ball from falling out. When you hit space, the arm of the catapult spins, which should throw the ball out of the bucket of the catapult. Instead, the ball passes through the cup of the catapult(when it isn't spinning, it acts normally and rolls around the bucket) and then it doesn't fall whatsoever, eve though has gravity is enabled. Here are my physics settings: The ball  The cup(and also a cup with flipped normals)  The Rim of the bucket  Here's my ball throwing code: public class BallThrower : MonoBehaviour {     private Vector3 axis;     // Start is called before the first frame update     void Start()     {         axis = transform.position;     }      // Update is called once per frame     void Update()     {         if (Input.GetKey(KeyCode.Space))         {             if (transform.rotation.z > -95.4)             {                 transform.Rotate(0f, 0f, -5f, Space.Self);              }         }     } }  What's missing here? Should I make the cup a rigidbody? Let me know if you need more info, Thanks!

I have a cube that has been scaled to be rectangular (controlled by a remote Raspberry Pi gyro/accelerometer/magnetometer) and am translating its orientation into Unity via calls to transform.localEulerAngles = new Vector3(...). This works wonderfully (the cube object modeled to be a Pi rotates perfectly), however now I'm running into issues with the actual physics.        Initially the ball will land on and roll around the Pi object, however when I start to increase the speed of my movements the ball will sometimes fall through the Pi.  The cube has a Rigidbody (no gravity, is kinematic) and Box collider (not triggered), and the sphere has a Rigidbody (has gravity, not kinematic) and Sphere collider (not triggered) attached.  I've tried varying the collision detection from discrete to continuous on both objects and have noticed similar behaviors.  The intent is to turn this into a marble maze type game, and the issue that I have is similar.  If I roll the ball into the joint between a wall and the floor (both stretched cubes), rotate it down, and then rotate it up, the ball will fall through the joint.  I have the same movement code attached to the GameArea object below.  Again, same issue with various types of collision detection applied.       My assumption is that this is a quickness of movement thing, as the cubes overlap each other (there's not a space for the ball to sneak through).  For reference, in the physics colliders section of the project preferences, all relevant layers are supposed to collide with each other.  I don't mind getting into code-based collision detection, but this seemed fairly trivial for Unity to take care of so I was wondering if I was missing something obvious.


After installing MKL using instructions from , when I do a  sudo apt update   It throws a warning:  Reading package lists... Done W: Conflicting distribution: https://apt.repos.intel.com/intelpython binary/ InRelease (expected binary/ but got )

When doing an apt-get update/upgrade I see that warning  W: Conflicting distribution: https://downloads.plex.tv/repo/deb public InRelease (expected public but got )   I was upgrading to Ubuntu Zesty 17.04 before and do not know how to fix the above. Already have seen ? but there are no suggested fixes for that.  Maybe one of you can give some hints? Thanks!


I came across this online and was wondering if someone might be able to explain this or at least give me a name of what it might be so that I can at least know what I'm googling for.   int main() {    int myarray[4] = {0, 100, 200, 300};    2[myarray] = -999;  //why does this work? what is this called?     for ( int i = 0; i < 4; i++)        cout << myarray[i] << endl; }   The output is 0, 100, -999, 300  I've ran it. I know it works but why? What is this called?

As Joel points out in , in  (aka: K & R), there is mention of this property of arrays in C: a[5] == 5[a]  Joel says that it's because of pointer arithmetic but I still don't understand. Why does a[5] == 5[a]?


I have 26 reputation points. When I go to a chat room, it says I have to have a reputation of at least 20 to talk. Why can't I post in the chat room, then?   I asked a question about a JavaScript problem, and I think it may have gotten buried. I attempted to go to the JavaScript chat room, and it appears I cannot post there either.

Following scenario:   user registers, has 1 point user visits chat, notes he cannot post because of only 1 point and needs 20 user goes back to SO, answers a question. gets enough points to chat user goes back to chat, but his profile still shows 1 point   Now my questions:   How long does it take for the profile on chat to update? Is there a way to force updating?   Update: Logging in and out did not help.


protected void Button1_Click(object sender, EventArgs e)         {             try             {                 MailMessage message = new MailMessage(EmailTo.Text, Emailfrom.Text, EmailSubject.Text, EmailBody.Text);                 SmtpClient client = new SmtpClient("smtp.gmail.com",587);                 client.EnableSsl = true;                 client.Credentials = new System.Net.NetworkCredential("imranrizvi1992@gmail.com", "sihhhhjj");                 client.Send(message);             }             catch (Exception ex)             {                 Label1.Text = ex.StackTrace;             }          }   I am sending the email via asp.net smtp but it throws some error which i dont know how to resolve this :  at System.Net.Mail.MailCommand.CheckResponse(SmtpStatusCode statusCode, String response) at System.Net.Mail.MailCommand.Send(SmtpConnection conn, Byte[] command, MailAddress from, Boolean allowUnicode) at System.Net.Mail.SmtpTransport.SendMail(MailAddress sender, MailAddressCollection recipients, String deliveryNotify, Boolean allowUnicode, SmtpFailedRecipientException& exception) at System.Net.Mail.SmtpClient.Send(MailMessage message) at ProjectManagmentSystem.WebForm1.Button1_Click(Object sender, EventArgs e) in E:\ProjectManagmentSystem\ProjectManagmentSystem\Project.aspx.cs:line 73

Instead of relying on my host to send an email, I was thinking of sending the email messages using my Gmail account. The emails are personalized emails to the bands I play on my show.   Is it possible to do it?


Recently I heard of , a trembling motion of the electrons in atoms that arises from Dirac's equation.  I know that, according to Bohr's model, light is emitted when the electron "jumps" between different energy states. With this in mind, my question is: is light emitted in this trembling motion of the electron?

I have seen a number of articles on Zitterbewegung claiming searches for it such as this one: . Others such as the so-called ZBW interpretation by Hestenes seemingly propose to explain electron spin as a consequence of ZBW.  According to Itzykson and Zuber p.62, Zitterbewegung is an artefact of considering a single-particle theory. It has been pointed out in this question's replies that it is not a physical phenomenon: .   How does the upgrade to many-particle theory solve the issue?


As the question says for example if I train my neural network (with 2 layers) model the first time it gives me a score $A \in \mathbb{R}$ and when I train the same model again it gives a different score $B \in \mathbb{B}$.  This is very strange for me and still cannot understand the reason why!

I tried an artificial neural network (ANN) model. Using same data set, it gives a different answer every time I run it in MATLAB. Does anyone why this happens and can suggested the best way to analyze the result?


I have an issue where I have a for loop, that appends some data and builds a table.  for (var p = 0; p < Tbarray.length; p++)  {     if (notfirsttime == 'false')      {         $("#Ttable").append('
Course	Places left	Time	Date
');         $("#Ttable").append('
' + Tbarray[p][0] + '	' + Tbarray[p][3] + '	' + Tbarray[p][2] + '	' + Tbarray[p][1] + '	<button  role="button" id="Signupbutton'+p+'">Sign Up</button>
');     }      notfirsttime = 'true';      } else      {        $("#Ttable").append('
' + Tbarray[p][0] + '	' + Tbarray[p][3] + '	' + Tbarray[p][2] + '	' + Tbarray[p][1] + '	<button  role="button" id="Signupbutton'+p+'">Sign Up</button>
');     }  }   now this code also adds a button at the end of the row of and I could just make a hundred or so   var buttonSignup = document.getElementById("Signupbutton0");  if (buttonSignup) {     buttonSignup.addEventListener('click', test); }   And then at least the first 100 buttons will work, but I don't know how many rows there will be. This will go up and down. I'm looking for a better way to do this. If anyone has some ideas that would be really helpful.

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 have been DM'ing for a few years, and due to my upbringing I prefer to run games that don't really allow for what I consider to be evil acts in game. For me, that means using basic common sense and not doing things a law abiding citizen wouldn't do in real life, so no murder, torture, etc.  While I haven't had to enforce this rule very often, there have been times when I've gotten into arguments over what actually constitutes 'evil', and the argument is generally that D&D is a game, and that I am trying to enforce my own value system on the game/players.  Here is the scenario that caused the problem. I created a town in a kingdowm that had increasingly oppressive and binding laws, until the populace got fed up and deposed the ruler. One of the laws that wasn't repealed, however, was the law against selling alcohol. My intention was for the party to solve this problem through using charisma checks in discussion with townspeople to vote to drop the law, thus enabling them to open a tavern as a business for passive money in the game.  The players essentially ignored this and turned into murder hobos, and ended up burning down a different village to get their alcohol. I asked them several times if they were sure, and then started a different encounter planned for later in the game early. I was trying to get them to correct their actions to reflect the house rule on evil, but that backfired and they ended up quitting on the game completely, and I have not heard anything from the group since then.  This was very disheartening for me, and I'm not really sure if I had done something wrong in how I approach the game. What can I do to help resolve, or preferably prevent, situations like this in the future?

Most RPGs teach you that casual violence is the best solution to all your in-game problems. This is so well established a part of the vast majority of RPGs that there are entire satire RPGs like Greg Costikyan's  and John Tynes'  dedicated to showcasing the issue. Even now that the '80's anti-RPG hysteria is past, you see more sober critiques of endemic violence in RPGs in places like . In most RPGs, PCs become inured to murder and other antisocial activities very quickly, and enter the depths of depravity that wouldn't be appropriate in the worst parts of the world. Armed robbery, mass murder, and genocide become routine parts of an adventurer's day, something only stick-in-the-mud characters with the most extremely stated ethics object to. , even though it is not properly applied to just any conflict, is a PC's friend and they generally escalate any conflict in that direction. The sophistication of the gamer mindset towards introspection on this issue can be demonstrated in that the most meaningful question usually debated about in-game violence is some variant on "but should we kill the noncombatant children" or "can we just murder people out of hand as long as they're from a typically evil race?" In the real world, we generally a priori regard anyone having to have this discussion as a monster already. (P.S. The "wipe out a given evil race" thing isn't the point of this question; it is only mentioned to indicate that it's only "that far" that usually causes ethical handwringing from players, when that is a really quite extreme case and we should be uncomfortable with casual violence a lot sooner. ) What I'd like to have is a more realistic in-game treatment of conflict.  People getting wounded and giving up, taking and ransoming of prisoners, not always escalating a fistfight to weapons, not always escalating weapon combat to killing, etc.  Heck, as I write this, I'm watching an episode of Adventure Time with my daughter and the protagonists snuck in and rescued a princess kidnapped by the Ice King and then exit right next to his sleeping form. I thought, "If this were D&D they'd all be carefully coordinating a coup de grace to kill him in his sleep on the grounds that he inconvenienced them."  The problem isn't limited to D&D of course, sci-fi PCs are happy to neutron bomb planets for convenience too, for example. I'm not part of the "D&D is Satanic" crowd obviously, but I frankly do have compunctions about continually playing in games where the taught behavior is uncomfortably equivalent to the worst examples of human behavior we see on the nightly news. How can I give my PCs a newfound respect for human life?


Find $\displaystyle \lim_{x\to\infty} \frac {(x!)^{\frac 1 x}}{x}$   I have no idea how to solve it, I can approximate it to be in $(0,1)$ by squeezing but getting to the solution $(\frac 1 e)$ seems like it would require a lot more. Is this an identity?    Note: no integrals nor gamma function.

I'm trying to find  $$\lim_{n\to\infty}\frac{n}{\sqrt[n]{n!}} .$$   I tried couple of methods: Stolz, Squeeze, D'Alambert  Thanks!  Edit: I can't use Stirling.


I tried to break the series into different parts by two different methods   In terms of even and odd (no specific series is obtained in even, only Geometric progression formula can be applied on odd series) In terms that contain powers of $2$ only, terms with $3$ to $1$st power, $3$ to $2$nd power,.. and so on   More specific pattern is obtained in the second method but I can't solve it further.  Help me further with the second method or any other one.  Any method given is appreciated.

I'm in trouble with this homework.  Find the sum of the series $ 1 + \frac12 + \frac13 + \frac14 + \frac16 + \frac18 + \frac19 + \frac1{12} +\cdots$, where the terms are the inverse of the positive integers whose only prime factors are 2 and 3.  Hint: write the series as a product of two geometric series.  Ok, I found some patterns in these numbers, but I can't find the two series.


I can do:  $ cd sources/ar #[TAB] here would complete word 'ar' to 'art'   I can do  $ cd */art #[enter] here would bring me to sources/art   I can do  $ cd */art #[TAB] that would expand */art to sources/art in command-line    I want to do  $ cd */a #[TAB] to complete to '*/art' or to 'sources/art'.   Is there any way to enable that in bash?

Using bash on ubuntu (debian jessie/sid) I'm not sure why I can't do tab completion of a wildcard with a builtin command.  for example, suppose my current working directory contains the following subdirectories..  % ls -l drwxr-xr-x 2 userX 4096 2016-08-31 11:46:40 0830a/ drwxr-xr-x 2 userX 4096 2016-08-31 11:46:52 0830b/ drwxr-xr-x 2 userX 4096 2016-08-31 11:47:33 0831a/ drwxr-xr-x 2 userX 4096 2016-08-31 11:47:18 0831b/ drwxr-xr-x 2 userX 4096 2016-08-31 11:50:38 z0830z/   I am able to hit [tab] after typing 'ls -l *31a' and get the completion to occur..  ls -l *31a<tab>   completes to..  ls -l 0831a   however, if I attempt the same with the builtin 'cd' command, it will not complete..  cd *31a<tab>   .. will not complete  Also, using a trailing wildcard fails as well..  cd z*<tab>   .. will not complete  Interestingly, completion without a wildcard character works OK for the builtins. For example, I am able make this completion work OK:  cd z<tab>   is completed to..  cd z0830z/   furthermore, I can use the 'cd *31a' command as-is and have it succeed (so long as it is unique). But I want the expansion to occur so I know for sure what I'm cd-ing into.  My .inputrc contains this..  $if Bash   Space: magic-space   set mark-directories on   set mark-symlinked-directories on   set completion-ignore-case off   set show-all-if-ambiguous on $endif   I don't have a ~/.bash_completion file. I do have /etc/bash_completion, which only does a source of /usr/share/bash-completion/bash_completion. That latter file is a bit long so I won't include it here.  My ultimate goal is to be able to have wildcard completion work for the cd command.


I'm trying to prove this:  Let $p$ be a prime factor of $F_n=2^{2^n}+1$, prove that order of $2$ mod p is $2^{n+1}$.  I know that $2^{2^{n+1}} \equiv 1 \mod p$. But it only means that $ord(2)_p$ its a power of $2$ and divides $2^{n+1}$.  how I can prove that there is no other power of 2, less than $2^{n+1}$?

Let $p$ be a prime divisor of the Fermat number $F_{n} = 2^{2^{n}} + 1$.  Show that ord$_{p}2 = 2^{n + 1}$  The order of the element modulo some integer is the least positive integer such that it divides the "maximum" order.  Some attempt I made:  Assume that Fermat number is prime.  By Fermat Theorem, we have:  $2^{2^{2^{n}}} \equiv 1 \bmod (2^{2^{n}} + 1)$  I want to show that ord$_{p}2 = 2^{n + 1}$ i.e. $2^{2^{n + 1}} \equiv 1 \bmod (2^{2^{n}} + 1)$.  The question I have is: How do you know that $2^{n + 1}$ is a least positive integer such that we obtain 1 mod Fermat number?  Can this be done by Modular Arithmetic, or is there a theorem that I need to use?  Well, I found the orders of an element that divide the order $F_{n} - 1$, which are basically in the set $\{2^{k} | k \in \mathbb{N}\}$, but I don't know where to go from here.  Any comments or suggestions?


I want to know from within the script if that script already running. A regular look on ps won't cut it as it get's different arguments in different order..  So the function should do:  check_already_running(){     if [ `ps -ef| grep $script_name_with_arguments | wc -l ` -gt 1 ]     then       echo "already running"       exit 1     else       echo "ok"     fi }   For example let's assume I ran ./test.sh -a 2 -c 4, so:  server:/tmp >./test.sh ok server:/tmp >./test.sh -a ok server:/tmp >./test.sh -a 2 -c 4 already running server:/tmp >./test.sh -a 2   -c 4 already running server:/tmp >./test.sh -c 4 -a 2 already running   I'm guessing the last 2 examples makes it a lot harder and longer to check, so if you can provide 2 options - one that's enough for exact command running and the other one if the user sent the same arguments but with different order/extra spacing.

Is there a script or a way in linux that when I try to execute a shell script/process, if the same is running, it will prompt that same is running and will exit otherwise it will continue.


I'm a software engineer and working as a full-time freelancer since November 2018. I have long-term clients who pay me on monthly basis milestone. It just like a work from home job as well. I applied for the UK visit visa for tourism purpose during Christmas days. Below is the timeline of this whole process  Online Application submitted and fee paid (UK standard visa 6-months) -- 26 September 2020  Biometric collection and passport submission -- 3 November 2020  Email received from UKVI Abu Dhabi (Your visa application has been concluded) -- 15 November 2020  Refusal decision email received -- 16 November 2020   I'm attaching the refusal letter I received with all reason of refusal they mentioned. The 3rd point they mentioned is not making sense because they don't know income tax ordinance of Pakistan. According to clause 133 of income tax ordinance of Pakistan, the income earned by any freelance working by selling the software development and maintenance services to foreign clients using by the freelance platform is exempt from the tax and I clearly mentioned it in my cover letter attached with my visa application. In my income tax returns copy the foreign income is also mentioned as well as the local income which I earned form my local clients. The local income for the fiscal year (2019 -2020) is 136,310. so this is the considered taxable income on the first acknowledge page of my ITR (Income tax return). And they are considering a conflict between the income I mentioned in my application, Upwork earning certificate attached and my income tax returns. How can it be justified? Ok, the other point that a person who is a full-time freelancer and who can work from anywhere can't get a visa? Please guide and help me, what was mistakes and what to do next to get the UK visa?

Many of the UK visa refusals we see here share a common pattern and the prevailing reasons refer to V 4.2 (a) and (c).    I do understand that, while the applicants may describe very different individual circumstances, there's a consistent pattern and, broadly, fall into specific categories:    Credibility (lifestyle, lack of ties, visit history, lies & omissions) Funding (insufficient funds, provenance of funds, funds parking) Sponsorship (family, friends, employer)   Question: What most commonly triggers a UK visa refusal where V 4.2 (a) and (c) are given as the grounds?  Secondarily: Given that there is a clear pattern, to what extent are these refusals predictable? Does sponsorship make a difference? Is there a set of personal circumstances, however abstract, where a refusal is all but guaranteed? For example, why do those we see here on TSE who sought entry for the PLAB or British Army appear to be refused with a common theme? Is there a uniform shortcoming or is it just discrimination?   PLAB: What is about applications for a visa, for the purpose of sitting the Professional and Linguistic Assessments Board (PLAB) exam, that seem to invite refusals. After all, the test is given so that international medical graduates can show that they qualify to practise medicine in the UK. The first part, PLAB 1, can be taken in centres outside of the UK. However, PLAB 2 can be taken only in the UK. Why can't you can't get a visa just to sit the exam, promising that you'll leave immediately after?    British Army: Since Commonwealth citizens are eligible to apply online to join, even those who don't reside in the UK, why is it so difficult to get a visa just to attend an interview to see whether you are suitable? Even with an invitation from the Army, such visa applications seem to be unsuccessful. Isn't a career in the British Army a valid reason?     Lastly:  After such a refusal, what approaches would increase the chance of a successful application?


Let $G$ be a solvable group, $f: G \rightarrow G'$ a surjective homomorphism. I need to show that $G'$ is solvable.  Let $G$ be solvable. Then there exists a sequence of subgroups $$\{e\}=H_r\triangleleft H_{r-1}\triangleleft\cdots \triangleleft H_{1}\triangleleft H_0=G$$ such that $H_{i+1}\triangleleft H_i$ for all $i=0,1,...,r-1, $ and such that $H_i/H_{i+1} $ is abelian.  We know that $f(H_i)\triangleleft f(G)$, but since $f$ is surjective, $f(H_i)\triangleleft G', \forall i=0,1,...,r-1.$ Also, $f(H_i)\subset f(H_{i-1}),\, $thus $f(H_i)\triangleleft f(H_{i-1}), \forall i=0,1,...,r-1.$ Thus we get $$\{e\}=f(H_r) \triangleleft f(H_{r-1})\triangleleft  \cdots \triangleleft f(H_1)\triangleleft f(H_0=G)=G'.$$ It remains to be shown that $f(H_i)/f(H_{i+1})$ is abelian.   Here I can not go further. I need a solution proposal or some hint. Thanks.

Let $G$ be a solvable group and $f: G \rightarrow H$ an isomorphism. My question is if $H$ is a solvable group.   Let $1=G_0 \trianglelefteq G_1 \trianglelefteq ... \trianglelefteq G_n = G$ be a normal series of $G$ whose factors are abelian groups. Clearly, $1=f(G_0) \trianglelefteq f(G_1) \trianglelefteq ... \trianglelefteq f(G_n) = H$ is a normal series of $H$ but are the quotients abelian?  Is there a weaker condition for invariance?


we know that electrons in superconductor are coupled somehow ()   creating quasi-particles called cooper pairs which are Bosons and going to ground state ( do not obey Pauli exclusion anymore)  and that happen after this?.. how can be charge was cared without any dissipation?

I read in a book "Physics - Resnik and Halliday" the explanation of Type-I Superconductors {cold ones} that:  The Electrons that make up current at super-cool temperatures move in coordinated pairs. One of the electrons in a pair may electrically distort the molecular structure of the superconducting material as it moves through, creating  nearby short-lived regions of positive charge.the other electron in the the pair may be attracted to the positive spot. According to the theory the coordination would prevent them from colliding with the molecules of the material and thus would eliminate electrical resistance  Is this the only explanation or can somebody give me a more intuitive explanation that also takes into the problem of defect scattering as in the case of resistance and also explains the Type-II superconductors {hot ones} P.S. What are "coordinated pairs"?


I am thinking of putting Ubuntu 13.04 onto some machines.  They are three years old and I can't find anywhere some hardware specs that these machines should meet. Please let me know!  Thanks in advance

I'm thinking about installing Ubuntu Desktop, but I don't know what flavor is the best for my system. What are the minimum and recommended hardware requirements? What kind of CPU? How much memory? Should I have Hardware Acceleration? What flavor should I use?  This is an attempt of a canonical answer. My answers have the "official  requirements", the recommended are a mix of official sources and opinion based (along with the answer it's told the source). You can comment or edit if you feel that the information is obsolete or incomplete. It is a good rule of thumb that any system capable of running Windows Vista, 7, 8, x86 (Intel) OS X will almost always be a lot faster with any Ubuntu flavor even if they are lower-spec than described below.


I need a backup Power Adapter for travel and have an older PA from a previous HP Laptop. I have a tip adapter that will accommodate the 4.5mm to 3.0mm plug. I am concerned that going from 2.31A rated PA to 3.33A rating may not be safe, thoughts. Thank you

I have two laptops (same manufacture), with the same type of power connector.  However, the power supplies/transformers are slightly different.    The output on the first laptop's power supply is 15.6 V at 8.0 A. The output on the second laptop's power supply is 15.6 V at 5 A.  Clearly the voltages are the same, but the currents are different. I assume the second laptop's power supply can not be used on the first, because it can't supply enough power to the laptop.   However, can the first laptop's power supply be safely used on the second laptop?


Learning more abstract algebra, really not the most enjoyable of subjects, as nothing seems all that clear cut, but here goes anyway.  I have a set $\mathbb Q = \{{p \over q} : p,q\in \mathbb Z \text{  and  } q \neq 0\}$ which is the set of rational numbers and for $x,y\in \mathbb Q$ defined the binary operation $*$ on $\mathbb Q$ by $$x*y = x + y + xy.$$  The pair $(\mathbb Q, * )$  has an identity element. Find the identity element then verify the identity properties for $(\mathbb Q,*)$.  Where do I begin?

So basically this proof centers around proving that (S,*) is a group, as it's quite easy to see that it's abelian as both addition and multiplication are commutative. My issue is finding an identity element, other than 0. Because if 0 is the identity element, then this group won't have inverses.  The set explicitly excludes -1, which I found to be its identity element, which makes going about proving that this is a group mighty difficult.


Do empty space in our universe exist or it is all filled with dark matter or some other unknown matter?

I am not a phycisist, so please forgive my ignorance. This is related to my  and . I am trying to understand what is meant by the term "Nothing" in physics or Quantum Field Theory (QFT) since it seems to me that this term is not used in the way we understand it in everyday language. So QFT seems to suggest (in a nutshell) that "things pop out of nothing". But from  I see the following quote:       "According to quantum theory, the vacuum contains neither matter nor   energy, but it does contain fluctuations, transitions between   something and nothing in which potential existence can be transformed   into real existence by the addition of energy.(Energy and matter are   equivalent, since all matter ultimately consists of packets of   energy.) Thus, the vacuum's totally empty space is actually a seething   turmoil of creation and annihilation, which to the ordinary world   appears calm because the scale of fluctuations in the vacuum is tiny   and the fluctuations tend to cancel each other out.   So what is "Nothing" in QFT? If this quote is correct, I can interpret it only as follows: The "Nothing" is not in the way used in everyday speech but is composed of "transitions" i.e. something that is "about to become" Is this correct? If yes, why is this defined as "Nothing"? Something that is "about to become" is not nothing but there is something prerequisite. In very lame terms: Einstein was born a non-physicist but became a physicist, so if this is a correct analogy, then there      there is something underlying that was non-something that became something A non-something came into something because something else (not nothing) permitted it to become. E.g. Einstein's talent (or Mozart's) would have been lost had he been born in Africa or in a country with no educational facilities. So he would not become a physicist (but the required talent would be present but not come into reality)   Could someone please help me understand this (perhaps trivial to you) concept?


Does anyone know how to change the size of the fonts on icons on Ubuntu 18.04 desktop?  How do I change the icon size of the icons that appear when the show applications button is pressed?   Thanks for any help given :)

How can I increase the icon text size in Ubuntu 18.04? I have tried using gnome-tweaks but I was only able to change font size of window titles and interface items.  Here is a screen shot of three icons from my desktop and I want to change the font size of the text below each icon.


I have a string like 大 Ⅰ II类 ABC, I want to get all roman number like Ⅰ,II by VBA Code or Regex. Is there any easy way? In fact, I want to order string by roman number. eg. I have string below:  A Ⅵ Type C II Row B Ⅰ Type  I want to order above by only roman number

Thinking about , i decided I can't even create a regular expression that will match roman numerals (let alone a context-free grammar that will generate them)  The problem is matching only valid roman numerals.  Eg, 990 is NOT "XM", it's "CMXC"  My problem in making the regex for this is that in order to allow or not allow certain characters, I need to look back. Let's take thousands and hundreds, for example.  I can allow M{0,2}C?M (to allow for 900, 1000, 1900, 2000, 2900 and 3000). However, If the match is on CM, I can't allow following characters to be C or D (because I'm already at 900).  How can I express this in a regex? If it's simply not expressible in a regex, is it expressible in a context-free grammar?


I have multiple jpg that come from a scanner. I want to combine all into one ? how ? I have seen something like  $ convert -adjoin *.jpg one.jpg   but it create multiple one.jpg images.

I would like to combine multiple images into one image using ImageMagick. To explain a little better, I want the result to look similar to this:    That is, I have a number of screenshots, and I want to turn them into one image with the original images on top of each other.  By Googling, I have come across the 'composite' command, but I don't know if, and in that case how to use it to get the result I want.


Let $$\sigma = \begin{pmatrix} 1&2&3&4&5&6\\ 4&5&2&1&6&3\end{pmatrix}\in S_6.$$ Then $\sigma = (1\text{ }4)(2\text{ }5\text{ }6\text{ }3)$ and thus $\sigma^{-1}=(4\text{ }1)(3\text{ }6\text{ }5\text{ }2)$. Then ${\rm sgn}(\sigma)={\rm sgn}(\sigma^{-1})=1\Rightarrow \sigma,\sigma^{-1}\in A_6$. I now have to find $\tau \in A_6$ such that $\tau \sigma \tau^{-1}=\sigma^{-1}$.   I know that $$\tau=\begin{pmatrix}1&2&3&4&5&6\\ 4&3&2&1&6&5\end{pmatrix}$$ solves it since $$\tau \sigma \tau^{-1}=(\tau(1)\tau(4))(\tau(2)\tau(5)\tau(6)\tau(3))=(4\text{ }1)(3\text{ }6\text{ }5\text{ }2)=\sigma^{-1},$$but $\tau \not \in A_6$ and this is where I'm stuck.  Am I going in the right direction?  Any help is appreciated. Thank you for your time.

I am studying Abstract Algebra on my own so I don't know if there are gaps in my knowledge. I didn't find any example to solve the following equation in my reference textbook. Find ${\tau\in S_7, \text{such that } \sigma'=\tau\sigma\tau^{-1} \text{ where } \sigma=(125)(3674), \sigma'=(314)(2765)}$ I tried the following. Right multiplication by ${\tau}$ and left multiplication by ${\sigma'^{-1}}$ gives ${\tau=\sigma'^{-1}\tau\sigma}$ ${\implies \tau=(341)(2765)^3\tau(125)(3674)}$ I tried the following approach. $\tau(1)=(341)(2765)^3\tau(\sigma(1))=(341)(2765^3)\tau(2)$ $\tau(2)=(341)(2765)^3\tau(\sigma(2))=(341)(2765)^3\tau(5)$ $\tau(5)=(341)(2765)^3\tau(\sigma(5))=(341)(2765)^3\tau(1)$ If I back substitute the values, I get $\tau(2)=(341)^2(2765)^6\tau(1) \therefore\tau(1)=(2765)\tau(1)$ Is this approach correct? Am I close? How do I proceed forward?   One observation I made was if $\tau(1)\in\{2,5,6,7\}, $ then the equation cannot be satisfied. Therefore, $\tau(1)\in\{3,4,1\}$. Is this correct?


I sometimes see a speaker saying: I'm going to disagree with you. I'm going to have to agree with you.   How does "going to" work in the above sentence?

They were standing on the edge of a huge chessboard, behind the black chessmen, which were all taller than they were and carved from what looked like black stone. Facing them, way across the chamber, were the white pieces. Harry, Ron and Hermione shivered slightly –– the towering white chessmen had no faces.   "Now what do we do?" Harry whispered.   "It's obvious, isn't it?" said Ron. "We've got to play our way across the room."   Behind the white pieces they could see another door.   "How?" said Hermione nervously.   "I think," said Ron, "we're going to have to be chessmen."   He walked up to a black knight and put his hand out to touch the knight's horse. At once, the stone sprang to life. The horse pawed the ground and the knight turned his helmeted head to look down at Ron.   "Do we –– er –– have to join you to get across?"   The black knight nodded.   (Harry Potter and the Sorcerer's Stone)   Is the auxiliary are going to used to soften the meaning of have to?


In the different R packages (like PWR), I have seen examples where power, confidence, and certainty are used, and I have spent time reading how these are the same/different--it's tricky when they're close to the same. Could anyone help me with how to determine the minimum sample size needed for this goal: Sample enough to be 80% confident I am within 20% of my objective. (More concretely: figure out how many survey plots I need to be 80% confident of whether I am within 20% of having 50 snails per plot.)

I am reading a field biology manual that is directing me to do a power analysis, and I find the phrasing very confusing. It says: Determine sampling requirement to be 80% confident you are within 10% of the objective. (More concretely: how many survey plots do I need to be 80% confident of whether I am within 10% of having 65 trees per hectare?) It's phrased like a power analysis, but is confidence a synonym for power, and is being with 10% an indication of the alpha? *Can anyone suggest what the statement means mathematically (e.g., B = 0.8)? *Can anyone recommend an R package for this?


I need to create a Table Of Appendices and I don't know how doing this. I don't find solution on  or on LaTeX documentation.  The table of appendices must look like a classical table of contents with chapters names but without pages numbers.  Someone can help me to do this ?  \documentclass[12pt]{report}  %%%%%% USE PACKAGE %%%%%%  \begin{document}  \tableofcontents  %%%%%% A LOT OF CHAPTERS WHICH ARE ON THE tableofcontents %%%%%%   \newpage \addcontentsline{toc}{chapter}{APPENDICES}  \vspace*{8cm} \begin{center}     \Huge\textbf{APPENDICES} \end{center}  %%%%%% TABLE OF APPENDICES HERE %%%%%%  \appendix  \chapter*{A - Document SOLR}     \begin{figure}[h!]         \centering         \includegraphics[scale=0.70]{./images/document_solr.png}     \end{figure}  \chapter*{B - Administration des rapports}     \begin{figure}[h!]         \centering         \includegraphics[scale=0.40]{./images/page_gestion_rapport.png}     \end{figure}  \chapter*{C - Extrait rapport mensuel}     \begin{figure}[h!]         \centering         \rotatebox{90}{             \includegraphics[scale=0.40]{./images/extrait_rapport.png}         }     \end{figure}  \end{document}   EDIT 1 :  I added :  \usepackage{etoolbox} \usepackage{appendix}  \usepackage{tocloft,titlesec} \newcommand{\listappendixname}{Tables des annexes} \newlistof{appendix}{apc}{\listappendixname}  \AtBeginEnvironment{appendices}{%   \clearpage   \addcontentsline{toc}{chapter}{Annexes}   \write\@auxout{%     \string\let\string\latex@tf@toc\string\tf@toc% Store the original `\tf@toc` file handle     \string\let\string\tf@toc\string\tf@apc%    }% Naughty trick   \titleformat    {\chapter}    [display]   {\huge\bfseries\filcenter}    {\Large \MakeUppercase{\@chapapp} \thechapter}    {1.5ex}{}   {} }  \AtEndEnvironment{appendices}{%   \write\@auxout{%     \string\let\string\tf@toc\string\latex@tf@toc%    }% Naughty trick, restoring the old `\tf@toc` number, to be able to write stuff to the real `.toc` again. }   And :  \newpage \addcontentsline{toc}{chapter}{Annexes}  \vspace*{8cm} \begin{center}     \Huge\textbf{Annexes} \end{center}  %%%%%% NEW LINES %%%%%%  \listofappendix  \begin{appendices}     \chapter{Proof of Theorem One}     \chapter{Proof of Theorem Two} \end{appendices}   I obtain this error : ! Improper \spacefactor.\@->\spacefactor\@m {} \begin{appendices}

I am trying to print a List of Appendices (LoA) for my thesis, separate from the Table of Contents (ToC).   I wish for my ToC to look like this, with depth up to subsections (2?):  CONTENTS  CHAPTER   I. Introduction......1    1.1 Section title...1     1.1.1 Subsection...1  Appendices ..... 2   and for an LoA on a new page, with depth 0, thus:  APPENDICES  APPENDIX A. Proof of Theorem 1...1 B. Proof of Theorem 2...1   I am trying to achieve this using the report class, in a way that allows me to type appendices using the hierarchy that I obtain from the chapter, section commands. This is as opposed to defining a custom myappendix command into which I insert my appendix content. (I realize that I only need the titles from the appendix chapters for the LoA, but I'd like for the appendix content to have such structure.)   For instance, this approach would solve my problem:   \chapter{Introduction} \section{Section title} \subsection{Subsection} % \begin{appendices} is also acceptable \appendix   % Some settings are changed now \chapter{Proof of Theorem 1} \chapter{Proof of Theorem 2} % \end{appendices} if environment is begun   whereas the following approach would not:  \chapter{Introduction} \section{Section title} \subsection{Subsection} \myappendix{Proof of Theorem 1} \myappendix{Proof of Theorem 2}   I realize several questions have been asked regarding this before, but none of them quite solved my problem. Notably,  defines a custom appendix command;  defines two custom commands to maintain some hierarchy, but I will have to do more work to handle the inclusion of another layer (subsection) into the appendix.    is the closest to what I want: it does give me a separate LoA, but it also adds appendices to ToC and I can't quite figure out how to suppress the entires in ToC. The moment I use   \addcontentsline{toc}{\setcounter{tocdepth}{-1}}   the line   \xpatchcmd{\@chapter}{\addcontentsline{toc}}{\addcontentsline{toa}}{}{}%   fails because I am not adding anything to the ToC anymore.   My approach: Since I was using titlesec and tocloft packages anyway, I tried to do the following:   Stop ToC once appendix command is issued Start a new counter for appendices using tocloft Using the <after-code> option of titlesec, add contents line after every chapter.    My MWE   \documentclass[a4paper]{report} \usepackage{lipsum} % for arbitrary text  \usepackage{tocloft,etoolbox,titlesec} \newcommand{\listappendixname}{List of Appendices} \newlistof{appendix}{apc}{\listappendixname}  \makeatletter \g@addto@macro{\appendix}{     \clearpage     \addcontentsline{toc}{chapter}{Appendices}     \addtocontents{toc}{\protect\setcounter{tocdepth}{-1}}     \titleformat      {\chapter}      [display]     {\huge\bfseries\filcenter}      {\Large \MakeUppercase{\@chapapp} \thechapter}      {1.5ex}{}     {\refstepcounter{appendix} \addcontentsline{apc}{appendix}{\protect{\@chapapp \thechapter}}} } \makeatother  \title{Title} \author{Author}  \begin{document} \maketitle \tableofcontents \clearpage \listofappendix  \chapter{Introduction} \lipsum[1] \section{Section} \lipsum[2] \subsection{Subsection} \lipsum[3]  \appendix  \chapter{Proof of Theorem One} \lipsum[4] \chapter{Proof of Theorem Two} \lipsum[5]  \end{document}   produces the following LoA:  List of Appendices  Appendix...... 5   It doesn't get the Appendix title or number, and fails after the first one.  Could you please help me obtain a separate LoA in a way that I can still use LaTeX's chapter, section, ... hierarchy? (I am okay with using different packages, the book class, or any approach other than mine.)


I've already looked at "", but that's not what I'm looking for exactly.   I'd like to have it so when I shut down my machine, it executes the "" program, securely wiping my RAM. I've looked around at some other tutorials online related to this topic, yet none of them are really definitive of what needs to be done for this to execute successfully.  The program needs to be run as root, and I'm running Debian jessie if that really matters.

For mysterious reasons I still double boot sometimes into Windows.  My problem is that I fear that information may leak because the RAM memory is accessible to Windows. (the Linux partitions are encrypted and the bootmedia is not inserted, though).  Is there a way to setup (in a recent kernel and GNU/Linux based system) a way to have the kernel wipe the memory at shutdown?  Also since LUKS plays an important role, does it wipe its memory at shutdown to avoid leakage and also "cold boot attack"?


Does the following sentence end with a nominative absolute?     The term was coined nearly 40 years ago by a prominent cardiologist, who noticed that all of his heart disease patients had common behavioral characteristics, the most obvious being that they were in a chronic rush.     Is the most obvious... the absolute phrase?

A scientist, he always thinks about what is best for the people.    Is this "a scientist" part a nominative absolute phrase? It seems like nominative absolute phrase has to have a verb or adjective after the noun like this:     The dragon slain, the knight could rest.    It is what makes me confused. I don't think the scientist sentence uses nominative absolute phrase since it only has a noun to describe "he". There is nothing more than a noun. So is it a nominative absolute phrase or not? If not, what's the name of that usage?


Am planning to travel in Syktyvkar, Russia to meet the girl I met on a dating site. What document should I need to apply for a tourist visa? I'm currently residing here in Barcelona, Spain.

I am planning to visit Moscow this winter as a solo tourist. I am a Hungarian citizen. I booked airplane tickets myself. I was informed that I will need an invitation letter, and I think I will go this way: (), but now the tourist visa application online form asks:    the options are: None, Travel company. I think I will need to select travel company because the description says:     In the case of a tourist visa select "Travel company" from the list and give the name and address of the travel company. In the case of   business visa select "Organization" from the list and enter in the   "Name of organization" name of the host organization, enter the   address of the organization and TIN in the appropriate fields. In   the case of private visa select “Individual” from the list and enter   the name, birth date and home address of the host. In the case of   transit, select "None" from the list.  Reference number: printed on   the bottom line of approval of a foreign tourist "Референс №». It is   necessary to introduce whole number with leading zeros.       Confirmation number: printed on the top line of confirmation of a   foreign tourist. The number can contain only numbers or numbers with   letters. You should only enter the numbers.   However I do not have a travel company.   What do I do?   Select "None" from the drop down so that I don't have to fill in travel company(this seems to be against the description that says select travel company for tourist visa) Select Travel company and the Invitation letter company will be my travel company and they will provide appropriate details? as in () Apply at some additional travel company, because there is no other way?  Some other option?   I didn't expect the visa application to be this complicated. I hope I get there.


I have a linux server with tomcat and MySql installed on it, with axis2 as well.  At first I started with ~400MB allocated I deployed my project and still memory allocation was the same.  But then I tried to use Log4j, which I think caused the problem. Problem is that not I have ~800MB allocated. Then I removed the service I deployed and still 800MB allocated.  What have I done wrong? How can I check what have done wrong and fix it?  Thanks Yoav

This is a  about how Unix operating systems report memory usage.   Similar Questions:                    I have production server that is running Debian 6.0.6 Squeeze  #uname -a  Linux debsrv 2.6.32-5-xen-amd64 #1 SMP Sun Sep 23 13:49:30 UTC 2012 x86_64 GNU/Linux   Every day cron executes backup script as root:  #crontab -e  0 5 * * * /root/sites_backup.sh > /dev/null 2>&1   #nano /root/sites_backup.sh  #!/bin/bash str=`date +%Y-%m-%d-%H-%M-%S` tar pzcf /home/backups/sites/mysite-$str.tar.gz /var/sites/mysite/public_html/www mysqldump -u mysite -pmypass mysite | gzip -9 > /home/backups/sites/mysite-$str.sql.gz cd /home/backups/sites/ sha512sum mysite-$str* > /home/backups/sites/mysite-$str.tar.gz.DIGESTS cd ~   Everything works perfectly, but I notice that Munin's memory graph shows increase of cache and buffers after backup.  Then I just download backup files and delete them. After deletion Munin's memory graph returns cache and buffers to the state that was before backup.  Here's Munin graph:  Externally hosted image was a dead link.


I am trying to compile with pdf open in Adobe reader. Anyone knows a workaround other than close the pdf viewer every time?

When we make a file, we write a tex file, run it, check the pdf file, fix the tex file, rerun it, and check the pdf file again.  Whenever I rerun the file without closing previous version of pdf file, it occurs an error. If I close the pdf file, it works well. But it is bothering to close the pdf file every time. How can I fix it? I am using Adobe X reader in Windows XP


I want to make my photo editing like a snapshot of my smartphone's camera, but when I check it can't.  When I edit it in Photoshop, the image details become Photoshop, so how can I set it so that the details become the camera of my smartphone?

How can I edit detailed image metadata (exif) fields?  In Windows 7 this is just a right click on the file in the folder.  I've searched and not found a way to edit detailed metadata (exif) fields in Ubuntu 14.04.  I'm not interested in running something from the command line.   With Shotwell Photo Manager I can only edit Title, Comment, Date and Time. With Shotwell Photo Viewer it is only possible to adjust Date and Time. With Gimp it is possible to edit Title, Author, Description, Keywords. I tried Phatch but it wasn't intuitive and didn't appear to have an option to edit metadata, only add or remove metadata.   What I can't figure out how to do is edit Location.  What I really want to be able to do is right click on the image file in the folder browser and directly edit the metadata like in Windows.  How can I do this?


String theory states that the oscillations of little strings are responsible for all the particles in and the evolution of the universe. The specific type of particle created by a string depends on the energy and the shape of its vibrations. However, in order for a particle to have a definite identity, the string would need to have a definite energy and a definite rate of change. Since the Heisenberg uncertainty principle forbids this, strings would constantly be a random, uncertain jumble and particles could never retain their identities.

Heisenberg famously derived his uncertainty principle by considering the disturbance that a measurement would have on a small enough system.  Of course in the mathematical formalism of Quantum Mechanics the relationship is derived from more basic principles.  How does String Theory account for it? Heuristically, and mathematically?


Is it acceptable or ok to report on students cheating?  Many times during a test or an exam, I have seen students in front of me either passing notes, or otherwise collaborating whenever the professor isn't looking.  I don't want to get into trouble, and I don't know if it's "alright" to rat on fellow classmates.  Part of me thinks they deserve being caught out, by virtue of trying to cheat their way through the course. However, I feel like I would get found out by other students if they were caught cheating.  What is the right course of action here? To be clear, I would never raise an accusation in the middle of an exam; it would only lead to me being ostracized by my peers.


Can someone explain in plain language for a layperson what are Bayesian and Monte Carlo simulations and the relationship between the two? I thought Bayesian was the same as Monte Carlo Simulation...

Maybe the concept, why it's used, and an example.


I am new to Ubuntu. I am trying to install the latest kernel (4.6), so I can get a few functions on my Surface Pro to work.  I ran these commands:  wget https://cdn.kernel.org/pub/linux/kernel/v4.x/linux-4.6.tar.xz tar zxvf linux-4.6.tar.xz cd linux-4.6   But this is what I get.  $ wget https://cdn.kernel.org/pub/linux/kernel/v4.x/linux-4.6.tar.xz HTTP request sent, awaiting response... 200 OK Length: 89461728 (85M) [application/x-xz] Saving to: ‘linux-4.6.tar.xz’  linux-4.6.tar.xz    100%[===================>]  85.32M  1.99MB/s    in 46s       2016-05-27 11:52:02 (1.84 MB/s) - ‘linux-4.6.tar.xz’ saved [89461728/89461728]  $ tar zxvf linux-4.6.tar.xz gzip: stdin: not in gzip format tar: Child returned status 1 tar: Error is not recoverable: exiting now  $ cd linux-4.6 bash: cd: linux-4.6: No such file or directory   I don't know how to get past this error with tar. What should I do?

I'm interested in compiling a new kernel under Ubuntu 12.04 x86 64 bit.  I found  which is basically a mirror for  and there are a lot of steps (git, etc.) that appear useless to me.  With earlier releases/distros, I used to create a .config file and modify a Makefile if I needed to, then just run make and it's done.  Is there is a simple way to do this under Ubuntu?


I was doing the last quest for the blades, and I had to go talk to Paratharax at the throat of the world. I decided not to kill Paratharax until I finished the all the Greybeards quests.   I decided to take a shortcut down the side of the mountain, riding Shadowmere, and we fell. Shadowmere died. I fast travelled to Whiterun, waited 10 days, and went back to where he died, but he still wasn't there.   I went back to doing quests. I know its been at least 100 days since he died, and I saw on here that you have to wait 15-20 days, so I'm wondering if it has been too long.   If he did, where would he respawn? On the top of the Throat of the world, down the side of the mountain where he died, or at the position he came to rest?

So I own Shadowmere from the Dark Brotherhood.  However, I jumped on another horse for a few seconds, before fast travelling. I did a few quests, without even thinking about Shadowmere, and now when I need her, the horse that I rode for those few seconds appears.   Anyone have any idea where I can get Shadowmere back?


I start with a vector of random numbers sampled from a normal distribution:  R<-rnorm(100, mean=0, sd=30)   I would now like to create 3 variables that are correlated with each other with a pre-specified correlation. In addition I would like to have these three variables correlated with R with a pre-specified correlation.  For example A, B, C would have correlation 0.7 with each other, and A, B, C would have correlation 0.6 with R.  I.e. I am looking for the following covariance matrix:      R   A   B   C R   1  .6  .6  .6 A  .6   1  .7  .7 B  .6  .7   1  .7 C  .6  .7  .7   1   How can this be done in R?

I’m trying to generate correlated random sequence with mean = $0$, variance = $1$, correlation coefficient = $0.8$. In the code below, I use s1 & s2 as the standard deviations, and m1 & m2 as the means.   p = 0.8  u = randn(1, n) v = randn(1, n) x = s1 * u + m1 y = s2 * (p * u + sqrt(1 - p^2) * v) + m2   This gives me the correct corrcoef() of 0.8 between x and y. My question is how can I generate a series means if I want z that is also correlated with y (with the same correlation $r=0.8$), but not with x. Is there a particular formula I need to know? I found  but couldn't understand it.


I assume that i touched some setting ,but i dont know what. I use blender 2.79 now, and yesterday i was working on some material, doing some experiments. When i liked the result, i took a screenshot of the nodes:  Now i finished the modeling of one object and i wanted to make the same material for it, but when i went to the node editor, added a new material and nothing showed. Then i saw that there was "Use nodes" box and it was unchecked. I checked it and got this:  What was even weirder is that by changing the color from the material properties panell, i changed the color of it in solid view. My question is: How did i enable that and how to go back? If any further info is needed i will put it

when i open my blender a material is applied automatically and i am unable to use the material node editor. The materials tab also appears different than the usual material tab. I am having trouble applying the usual gloss, mix, and other shaders


AnyDesk was running great for me on Ubuntu 19.04. Then I upgraded to 19.10, now it won't start. I installed from the anydesk repository and have version 5.4.0. I've uninstalled & reinstalled already.  When I run from the cli all I get is: (anydesk:18303): GdkGLExt-WARNING **: 07:23:14.100: Window system doesn't support OpenGL.  syslog contains lots of lines like this afterwards:  Oct 25 07:27:21 mrh-laptop gnome-shell[1660]: Window manager warning: Overwriting existing binding of keysym 37 with keysym 37 (keycode 10). Oct 25 07:27:21 mrh-laptop gnome-shell[1660]: Window manager warning: Overwriting existing binding of keysym 38 with keysym 38 (keycode 11). Oct 25 07:27:21 mrh-laptop gnome-shell[1660]: _clutter_stage_queue_event: assertion 'CLUTTER_IS_STAGE (stage)' failed   Any suggestions?

My system has been upgraded 18.04 > 18.10 > 19.04 > 19.10. This problem started with the upgrade to 19.10.  AnyDesk won't run, gives this error:  GdkGLExt-WARNING **: 08:49:56.379: Window system doesn't support OpenGL.   Android Studio won't run the emulator, gives these errors:  8:51 AM Emulator: Warning: QXcbIntegration: Cannot create platform OpenGL context, neither GLX nor EGL are enabled ((null):0, (null)) 8:51 AM Emulator: queryConfigs: Could not query GLX version! 8:51 AM Emulator: getGLES2ExtensionString: Could not find GLES 2.x config! 8:51 AM Emulator: Failed to obtain GLES 2.x extensions string! 8:51 AM Emulator: Could not initialize emulated framebuffer 8:51 AM Emulator: emulator: ERROR: OpenGLES emulation failed to initialize. 8:51 AM Emulator: Process finished with exit code 139 (interrupted by signal 11: SIGSEGV)   Google Earth Pro won't run. It doesn't give an error msg but in the long stack trace the problem seems to begin here:  /usr/lib/x86_64-linux-gnu/libGLX.so.0(glXCreateContext+0x33)[0x7fc3af903883]   glxinfo won't run:  $ glxinfo name of display: :0 Error: couldn't find RGB GLX visual or fbconfig   So I have concluded that my OpenGL is just horribly broken even tho this system seems to be running great otherwise.  Graphics card: Intel® HD Graphics 530 (Skylake GT2)  installed drivers:  $ dpkg -l | grep xorg-video ii  xserver-xorg-video-all                     1:7.7+19ubuntu12                     amd64        X.Org X server -- output driver metapackage ii  xserver-xorg-video-amdgpu                  19.0.1-1ubuntu1                      amd64        X.Org X server -- AMDGPU display driver ii  xserver-xorg-video-ati                     1:19.0.1-1ubuntu1                    amd64        X.Org X server -- AMD/ATI display driver wrapper ii  xserver-xorg-video-fbdev                   1:0.5.0-1ubuntu1                     amd64        X.Org X server -- fbdev display driver ii  xserver-xorg-video-intel                   2:2.99.917+git20190815-1             amd64        X.Org X server -- Intel i8xx, i9xx display driver ii  xserver-xorg-video-nouveau                 1:1.0.16-1                           amd64        X.Org X server -- Nouveau display driver ii  xserver-xorg-video-nvidia-390              390.129-0ubuntu2                     amd64        NVIDIA binary Xorg driver ii  xserver-xorg-video-qxl                     0.1.5-2build2                        amd64        X.Org X server -- QXL display driver ii  xserver-xorg-video-radeon                  1:19.0.1-1ubuntu1                    amd64        X.Org X server -- AMD/ATI Radeon display driver ii  xserver-xorg-video-vesa                    1:2.4.0-2                            amd64        X.Org X server -- VESA display driver ii  xserver-xorg-video-vmware                  1:13.3.0-2build1                     amd64        X.Org X server -- VMware display driver   Can anyone direct me how to fix/troubleshoot this?


Show that the relation $(- 1) (- 1) =  1$ is a consequence of the distributive law.   This question is the first problem from 'Number Theory for Beginners" by Andre Weil. I cannot get the point from where to begin. I tried using $1\cdot 1 = 1$ and $ 1\cdot x = x $, but couldn't get somewhere. Can you help me just with a hint? I would be willing to work up from there.

Someone recently asked me why a negative $\times$ a negative is positive, and why a negative $\times$ a positive is negative, etc.  I went ahead and gave them a proof by contradiction like so:  Assume $(-x) \cdot (-y) = -xy$  Then divide both sides by $(-x)$ and you get $(-y) = y$  Since we have a contradiction, then our first assumption must be incorrect.  I'm guessing I did something wrong here. Since the conclusion of $(-x) \cdot (-y) = (xy)$ is hard to derive from what I wrote.  Is there a better way to explain this?  Is my proof incorrect?  Also, what would be an intuitive way to explain the negation concept, if there is one?