I first encountered adding an "a" before a verb in songs in phrases such as "I've been a-playing". At first I thought that songwriters add it when they need one more syllable to make a verse sound right. Then I thought that this may be some kind of a Texas dialect or slang.   But I also saw Charles Dickens using that: "and all mostly sounded as to be a-talking to theirselves, or a-passing blame on the t'others, and not a-talkin to us" and I'm confused.   Why would anybody speak like that and how formal/informal is it?

For example,   If this van's a-rockin', don't come a-knockin'  (song title)   (song title)   I have a few related questions:   What is the "a-" or "-a" called? Is there a function beyond a rhythmic one? Why is "a-" attached to a word at all -- and why attach to a word at all?


My mac was turned off during the High Sierra update and now just gives me the flashing question mark when I turn it on.  If I boot into recovery I can't select my startup disk because the OSX Base System disk image is 'booted'. It won't let me unmount it either.  I can see my start up disk but I can't boot into it.  Can anyone help with this?

I have a Mac that runs Snow Leopard and I intend to upgrade it to Mountain Lion and sell it on ebay. However, I only have one hard-drive, and I'm sure I can't use something in my OS to delete my OS and all user data.  Is there something for this that's built into the firmware that I can do on boot, or otherwise?   I have source code on my Mac for multiple corporations' proprietary software and I can't risk somebody gaining access through the use of any sort of disk recovery tool. I plan to use a 7 pass erase rather than simply deleting the directory.


I really don't understand the logic here.......  def transpose(A):     output = [['']*len(A)] * len(A[0])     for j in range(len(A[0])):         for i in range(len(A)):             output[j][i] = A[i][j]     return output   Input: [[1,2,3],[4,5,6],[7,8,9]]  Expected Output: [[1,4,7],[2,5,8],[3,6,9]]  My Output: [[3,6,9], [3,6,9], [3,6,9]]  I know I can use zip to solve this problem easily, but I just want to know why this code will return duplicated lists.   New update, I have added some print to understand the process  def transpose(A):     output = [['']*len(A)] * len(A[0])     for j in range(len(A[0])):         for i in range(len(A)):             output[j][i] = A[i][j]             print(j)             print(i)             print(output)     return output   And the outputs are:  0 0 [[1, '', ''], [1, '', ''], [1, '', '']] 0 1 [[1, 4, ''], [1, 4, ''], [1, 4, '']] 0 2 [[1, 4, 7], [1, 4, 7], [1, 4, 7]] 1 0 [[2, 4, 7], [2, 4, 7], [2, 4, 7]] 1 1 [[2, 5, 7], [2, 5, 7], [2, 5, 7]] 1 2 [[2, 5, 8], [2, 5, 8], [2, 5, 8]] 2 0 [[3, 5, 8], [3, 5, 8], [3, 5, 8]] 2 1 [[3, 6, 8], [3, 6, 8], [3, 6, 8]] 2 2 [[3, 6, 9], [3, 6, 9], [3, 6, 9]] [[3, 6, 9], [3, 6, 9], [3, 6, 9]]   So, for example, the very first step of the loop. j = 0 and i = 0. However, output[0][0],output[1][0],and output[2][0] are all changed by the loop. Why is that??????  I am so confused right now. I have written the same code in Java and it runs properly.  public class TransposeMatrix {     public static int[][] transpose(int[][] A) {         int[][] result = new int[A[0].length][A.length];         for (int j = 0; j < A[0].length; j++) {             for (int i = 0; i < A.length; i++) result[j][i] = A[i][j];         }         return result;     } }   The link of this problem is:

I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3  The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]]    Then I changed one of the innermost values: my_list[0][0] = 5  Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]]    which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?


In Drupal 7, this was done with a hook. And there also seems to be a hook available in Drupal 8/9:   Is this still the way to do it or is it being deprecated and  is the way forward? If it is Event Subscription, is there an example code snippet for adding custom code on user creation please? Thank you.

I noticed that account.set is the event invoked for a user account. I want to create an event subscriber which adds a callback invoked when a new user registers on the site. I am not sure whether account.set is the correct event. Are there other better events for this?


I found CD images for the 18.10 beta, but I'm wondering if there is a way to upgrade OTA. I have the bionic-proposed box checked, but there is still nothing.

How do I upgrade to the unreleased version of Ubuntu for testing?


I find the "duplicate answers (auto)" flag the most difficult to handle on Stack Overflow. Here's how I try to handle the situation, but I'd appreciate some further pointers and corrections if this is not correct:   First, I check if the questions are duplicates. Exact duplicate answers typically mean duplicate questions and if this is the case, I vote to close accordingly. I post a comment under the most recent answer, explaining that duplicate answers should not be posted and that the user should flag/vote-to-close as a duplicate. If I feel able to do so, I judge the answer like any answer and vote accordingly. I then mark the flag as invalid to make it go away.   Is there any further action I should be taking other than the above? Is it OK to mark the flag as invalid in this way - seems a little awkward?

The flag queue lists automatically-detected .  According to  and other questions on MSO, there is nothing wrong with such duplicate answers—except insofar as they are potentially indicative of a duplicate question.  So, having verified that the answers do not merit a flag for any other reason (and having flagged the questions as duplicates if appropriate: although if that was the purpose of this exercise, shouldn't the system have raised automatic flags on the questions instead?), how should one respond to these flags?  It seems that the only option is to flag for moderator attention, either:   because "I do not agree with the existing flags on this answer, they are incorrect and should be ignored." (invalid flag), even though I do agree that the answers are indeed duplicates; or for a custom reason.   Neither of the above really feel very appropriate.  Perhaps if the flag was instead "suspected spam" (or similar) it would be easier to flag as being invalid?


Suppose I am testing whether there is a difference between the mean of two normally distributed variables X and Y, where X ~ N(u_1, 1), Y ~ N(u_2, 1). Is it theoretically correct if I compute the p-value as P(X-Y > delta_xy) if the observed delta_xy is positive, and P(X-Y < delta_xy) if the observed delta_xy is negative? Here delta_xy is the difference between the sample mean of X and Y. In other words, can I do a one-tailed test based on the direction already been observed?  It is of note that if I compute the p-value like this, the "worst" p-value I can get is 0.5, instead of 1. How to explain this?  // Following whuber's comment as an "post hoc testing", I give an example as represented in the boxplot, in which we first plot the data and see there is a difference in the mean, most likely we will do a test of mean(OJ) > mean(VC) instead of mean(OJ) != mean(VC), is this an "post hoc testing" abuse?

My statistic professor says so, all the books that I look at state it:  is unscientific. You must derive a hypothesis from theory first, and then collect data and analyse it.  But I really don't understand what the problem is.  Suppose, I see sales figures for different car colors and form the hypothesis that from numbers of different-colored cars sold the largest group of cars on the street shoud be white. So I sit at some street one day and note all the colors of all the cars that pass me. Then I do some tests and find whatever.  Now, suppose I was bored and sat at some street one day and noted all the colors of all the cars that passed me. Since I love graphs, I plot a pretty histogram and find that white cars form the largest group. So I think that maybe most cars on the street are white and perform some tests.  How and why do the results or the interpretation of the results of the post-hoc test differ from those of the theory-driven* hypothesis test?  * What's the name for the opposite of a post-hoc test, anyway?    I would like to add that most of our knowledge about the universe (the Earth moves around the Sun) is deduced post hoc from observation.  It seems to me that in physics it is perfectly okay to assume that it is not coincidence that the sun has been rising in the East for the last thousand years.


The issue I'm facing: Running TeX4ht renders an empty document when using references with biblatex. I'm using TeXmaker 4.1 on a PepperMint 5 OS (based on Ubuntu 14.04).   The preamble of the document looks like this:  \documentclass[]{article} \usepackage{geometry} \geometry{a4paper} \usepackage[english]{babel}  \usepackage{csquotes} \usepackage{hyperref} \usepackage[backend=bibtex, hyperref=true, style=authoryear-icomp, firstinits=true, dashed=false, url=false, isbn=false, doi=false, maxcitenames=2, maxbibnames=6]{biblatex} \bibliography{literature}  \let\citep\cite %\let\cite\footcite %\let\citep\footcite  \usepackage{endnotes} \let\footnote\endnote  \usepackage{verbatim} \usepackage{setspace}  \author{Author} \title{Political Science} \begin{document} Lastly, I have a conclusion (\cite{plato_republic_2005}). \printbibliography \end{document}   This works just fine when rendering a regular pdf, but creates an empty document in TeX4ht. The file produced is empty when opened in a browser, but does contain something when opened with GEDIT.  Message from TeX4ht:     "htlatex"   "/home/dijkman/Dropbox/Studie/Challenges/TeX/presidentpaper.tex" " " "   " " " -interaction=nonstopmode Process exited normally   Content of the .html file (in GEDIT):  <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"     "http://www.w3.org/TR/html4/loose.dtd">   <html >  <head><title>Political Science</title>  <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">  <meta name="generator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)">  <meta name="originator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)">  <!-- html -->  <meta name="src" content="importantpaper.tex">  <meta name="date" content="2015-03-23 17:24:00">  <link rel="stylesheet" type="text/css" href="importantpaper.css">  </head><body  >    <div class="maketitle">   I would be very grateful if someone could help me out with this, since it would allow me to paste the results in a Word document for comments from my supervisor (a)  PS: Relatively new to LaTeX, hope I haven't overlooked something obvious or something already explained. Furthermore, I hope to have posted enough info.  Edit: The .bib file is a biblatex export from Zotero (or BibTeX, both work for the pdf). Example from the file:  @incollection{keane_john_monitory_2011,     location = {Cambridge},     title = {Monitory Democracy?},     pages = {212--235},     booktitle = {The Future of Representative Democracy},     publisher = {Cambridge University Press},     author = {Keane, John},     editor = {Alonso, Sonia and Keane, John and Merkel, Wolfgang},     date = {2011} }  @article{zurn_democracy_2011,     title = {Democracy and representation beyond the nation state},     pages = {258},     journaltitle = {The future of representative democracy},     author = {Zürn, Michael and Walter-Drop, Gregor},     date = {2011} }

How to run htlatex with biblatex bibliography included? That's the simplest example:  \documentclass{article}  \usepackage{biblatex} \addbibresource{libr.bib} \begin{document}  Text.\cite{dickens1881great}  \printbibliography \end{document}   I run in that way:  latex main biber main htlatex main   At the last stage htlatex asks about "Undefined control sequence":  \blx@begunit ...penalty \@M \hskip -\blx@unitmark                                                \relax \hskip \blx@unitmar... l.7 Text.\cite{dickens1881great}   And there's a lot of such errors in log file, but htlatex allows to skip them. Also, the html are not so good. Lack of punctuation, formatting:
C.  DickensGreat ExpectationsPenguin  English  librarypt.  1Dent1881url:     http://books.google.com/books?id=fhUXAAAAYAAJ.   Is it the best result possible or I did something wrong?


Have content type Article. Content type Article has a field, called "Need Further Review", of boolean type. This field is not required, default value FALSE. The articles has value TRUE, FALSE, NULL for this field. TRUE: select true FALSE: select false NULL: the previous articles still have no value for this field. Have a view to list articles. It uses SOLR search. A filter criteria is this field "Need Further Review", and is exposed. It has options: Any, TRUE, FALSE. When users select TRUE, it will list articles with TRUE value of this field. When users select FALSE, it usually lists articles with FALSE value of this field. Now I want to list articles with FALSE and NULL value of this field when selecting FALSE. How to use SOLR search hook_search_api_solr_query_alter to do it?

On Drupal 9 I have a content type (Article), which has a not required Boolean field, Need Further Review. Its values are TRUE, FALSE, and NULL, where the latter is used when the node doesn't have yet a value for the field. There is a view for that content type, with an exposed filter for that field. The filter options are Any, True, and False. How can I list the nodes for which the field value is FALSE or NULL?


This program is a work-in-progress tic-tac-toe game, where I've only just made the buttons; at least, theoretically. I looked up "null pointer exception" before posting this, but still don't understand how it applies here. Help?  //this line is line four public class TicTacToe extends JFrame {   public static void main(String[] args) {     new TicTacToe();   }   public TicTacToe(){     super.setTitle("Tic Tac Toe");     super.setSize(800, 800);     super.setDefaultCloseOperation(EXIT_ON_CLOSE);     buildPanel();     super.setVisible(true);   }   public void buildPanel(){     GridLayout g = new GridLayout(3,3);     JPanel p = new JPanel();     p.setLayout(g);     JButton [] buttons = new JButton[9];     //I'm adding text temporarily to help me see where each button's position     buttons[0] = new JButton("One");     p.add(buttons[0]);     buttons[1] = new JButton("Two");     p.add(buttons[1]);     buttons[2] = new JButton("Three");     p.add(buttons[2]);     buttons[3] = new JButton("Four");     p.add(buttons[3]);     buttons[4] = new JButton("Five");     p.add(buttons[4]);     buttons[5] = new JButton("Six");     p.add(buttons[5]);     buttons[6] = new JButton("Seven");     p.add(buttons[6]);     buttons[7] = new JButton("Eight");     p.add(buttons[8]);     buttons[8] = new JButton("Nine");     p.add(buttons[8]);      add(p);      ActionListener Callback = event -> {       String label = event.getActionCommand();      };     for (int i=0;i<buttons.length;i++){       String string="O";       if (i%2==0){         string = "X";       }       buttons[i].setText(string);       buttons[i].addActionListener(Callback);     }   } }   The Result:       Exception in thread "main" java.lang.NullPointerException     at java.desktop/java.awt.Container.addImpl(Container.java:1117)     at java.desktop/java.awt.Container.add(Container.java:436)     at TicTacToe.buildPanel(TicTacToe.java:37)     at TicTacToe.<init>(TicTacToe.java:13)     at TicTacToe.main(TicTacToe.java:7)

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


Let $f:[a,b] \to \mathbb{R}$ be a differentiable function such that $f'$ is Riemann-integrable. Let $A_n = \frac{b-a}{n} \cdot \sum\limits_{k=0}^{n-1} { f \left( a+k \frac{b-a}{n} \right)} \, , \forall \, n \in \mathbb{N}^* $. Prove that $ \lim\limits_{n \to \infty} n \left( A_n - \int_a^b f(x) \, \mathrm dx \right) = \frac{b-a}{2} \cdot [ f(a)-f(b) ]$.  My guess would be that we need to use that $\int_a^b f'(x) \, \mathrm dx = f(b)-f(a)$, but I don't have any other idea how to tackle this problem.

Let $f\in C^2([0,1])$. Prove that $$ \lim_{n\to+\infty}n\left( \int_0^1  f(t)\, dt -\frac1n\sum_{k=0}^{n-1}f\Big(\frac k n\Big)   \right)=\frac{f(1)-f(0)}{2}. $$   The second term is clearly the Riemann sum of the function $f$; since the function $f$ is integrable (it is continuous) $\displaystyle \frac1n\sum_{k=0}^{n-1}f\Big(\frac k n\Big)$ converges to $\displaystyle\int_0^1 f(t)\, dt$ when $n \to + \infty$.   So we have an indeterminate form, "$\infty \cdot 0$". How can we start? I thought we should use Taylor expansion ($f$ is $C^2$) but I cannot see how. Would you please help me?   Thanks in advance.


Can ubuntu be installed on a flash drive and booted from a flash drive, or does it have to be installed on a hard drive>

If you are hurrying to reply, System → Administration → StartUp Disk Creator -- no, that's not what I'm talking about.   I want to try Ubuntu 11.04's Unity without touching my existing Ubuntu install.  To do this, I need to install the nVidia drivers first (sigh).  To do this, I need changes to persist a reboot.  To do this, I need to really install Ubuntu on a USB key.  How do you do that?    What I tried   I tried to make a USB key from , then boot from it, then choose "Install Ubuntu." The installer refused to install to the installation media itself. I tried, from my installed copy of Ubuntu:  sudo kvm /dev/sdb --cdrom .cache/testdrive/iso/ubuntu_natty-desktop-i386.iso   ...but the installer didn't detect the disk properly.


Solve the following integral $$ \int_0^{\frac{\pi}{2}}{\frac{x\ln \left( 1-\sin x \right)}{\sin x}dx} \\ I\left( a \right) =\int_0^{\frac{\pi}{2}}{\frac{x\ln \left( 1-a\sin x \right)}{\sin x}}dx\quad \implies  \quad I'\left( a \right) =-\int_0^{\frac{\pi}{2}}{\frac{x}{\left( 1-a\sin x \right)}}dx$$  $$ \quad $$ $$ \int{\frac{1}{\left( 1-a\sin x \right)}dx}=\int{\frac{1}{\sin ^2\frac{x}{2}+\cos ^2\frac{x}{2}+a\sin \frac{x}{2}\cos \frac{x}{2}}dx} \\ =\int{\frac{1}{\sin ^2\frac{x}{2}+\cos ^2\frac{x}{2}+a\text{2}\sin \frac{x}{2}\cos \frac{x}{2}}dx}=2\int{\frac{d\left( \tan \frac{x}{2} \right)}{\left( a+\tan \frac{x}{2} \right) ^2+\left( \sqrt{1-a^2} \right) ^2}}$$   $$ \\ =2\frac{1}{\sqrt{1-a^2}}\arctan \frac{a+\tan \frac{x}{2}}{\sqrt{1-a^2}} \\ \int_0^{\frac{\pi}{2}}{\frac{x}{\left( 1-a\sin x \right)}}dx=\int_0^{\frac{\pi}{2}}{xd\left( 2\frac{1}{\sqrt{1-a^2}}\arctan \frac{a+\tan \frac{x}{2}}{\sqrt{1-a^2}} \right)}$$=  $$ 2\frac{1}{\sqrt{1-a^2}}\arctan \frac{a+\tan \frac{x}{2}}{\sqrt{1-a^2}}x\Bigg\vert_{0}^{\frac{\pi}{2}}-\frac{2}{\sqrt{1-a^2}}\int_0^{\frac{\pi}{2}}{\arctan \frac{a+\tan \frac{x}{2}}{\sqrt{1-a^2}}dx}$$ \

The following integral was proposed by Cornel Ioan Valean and appeared as Problem $12054$ in the American Mathematical Monthly earlier this year.  Prove $$\int_0^1 \frac{\arctan x}{x}\ln\left(\frac{1+x^2}{(1-x)^2}\right)dx=\frac{\pi^3}{16}$$  I had small tries for it, such as writting: $$I=\int_0^1 \frac{\arctan x}{x}\ln\left(\frac{1+x^2}{(1-x)^2}\right)dx\overset{ x\to \tan \frac{x}{2}}=-\frac12 {\int_0^\frac{\pi}{2}\frac{x\ln(1-\sin x)}{\sin x} dx}$$ And with Feynman's trick we obtain: $$J(t)=\int_0^\frac{\pi}{2} \frac{x\ln(1-t\sin x)}{\sin x}dx\Rightarrow J'(t)=\int_0^\frac{\pi}{2} \frac{x}{1-t\sin x}dx$$ But I don't see a way to obtain a closed from for the above integral.  Also from  we have the following relation: $$\int_0^1 \frac{\arctan x \ln(1+x^2)}{x} dx =\frac23 \int_0^1 \frac{\arctan x \ln(1+x)}{x}dx$$ Thus we can rewrite the integral as: $$I=\frac23 \int_0^1 \frac{\arctan x \ln(1+x)}{x}dx -2\int_0^1 \frac{\arctan x \ln(1-x)}{x}dx$$  Another option might be to rewrite: $$\ln\left(\frac{1+x^2}{(1-x)^2}\right)= \ln\left(\frac{1+x}{1-x}\right)+\ln\left(\frac{1+x^2}{1-x^2}\right)$$ $$\Rightarrow I= \int_0^1 \frac{\arctan x}{x}\ln\left(\frac{1+x}{1-x}\right)dx+\int_0^1 \frac{\arctan x}{x}\ln\left(\frac{1+x^2}{1-x^2}\right)dx$$ And now to use the power expansion of the log functions to obtain: $$\small I=\sum_{n=0}^\infty \frac{2}{2n+1}\int_0^1 \frac{\arctan x}{x} \, \left(x^{2n+1}+x^{4n+2}\right)dx=\sum_{n=0}^\infty \frac{2}{2n+1}\int_0^1\int_0^1 \frac{\left(x^{2n+1}+x^{4n+2}\right)}{1+y^2x^2}dydx$$  This seems like an awesome integral and I would like to learn more so I am searching for more approaches. Would any of you who also already solved it and submitted the answer to the AMM or know how to solve this integral kindly share the solution here? Edit: In the meantime I found a nice solution by Roberto Tauraso  and another impressive approach due to Yaghoub Sharifi .


There was some unanswered questions about the difference between "Windows Server Failover Clustering" and "Always On Failover Cluster Instance".   From MS document:  A Windows Server Failover Clustering (WSFC) cluster is a group of independent servers that work together to increase the availability of applications and services. SQL Server 2017 takes advantage of WSFC services and capabilities to support Always On availability groups and SQL Server Failover Cluster Instances.   So we have 3 terms   Windows Server Failover Clustering Always On availability groups SQL Server Failover Cluster Instances   Does that mean i have to combine 1 with 2 or 3? Or i can only use 1 only?  Because in my case (2 EC2 instance with SQL Server 2016 Standard), here's what i did   On first EC2, i installed Failover Clustering Manager role from Server Manager Then i created cluster and add nodes I did some other configurations including DNS, network, witness Now when one node go off (by stop EC2), the other node go online  In SQL Management, i just configured Merge Replication between 2 SQL Server insides 2 EC2   In this case, i used only WSFC? The reason why i asked is because in FCI document, it stated:  Storage Contrary to the availability group, an FCI must use shared storage between all nodes of the FCI for database and log storage. The shared storage can be in the form of WSFC cluster disks, disks on a SAN, Storage Spaces Direct (S2D), or file shares on an SMB. This way, all nodes in the FCI have the same view of instance data whenever a failover occurs. This does mean, however, that the shared storage has the potential of being the single point of failure, and FCI depends on the underlying storage solution to ensure data protection.   But i noticed that i didn't have any shared storage.  @The "Are “Always On Failover Cluster Instances” and “SQL Server Failover Clustering” the same thing?" didn't explain it.

I'm reading documentations of SQL Server. On this page at , it says:  Both Always On Availability Groups and Always On Failover Cluster Instances use WSFC as a platform technology, registering components as WSFC cluster resources.  I'm a little bit confused. In previous version of SQL Server (like SQL Server 2008) there is a technology called SQL Server Failover Clustering, is it the same thing as Always On Failover Cluster Instances? Hope someone can clarify on this. Thanks in advance.


A way some people explain (or try to explain) how gravity works is using space-time curvature: an object with high mass distorts the surrounding space-time plane like a bowling ball distorts a sheet of plastic and the surrounding objects are always trying to roll down to that other object.  However, this explanation to me seems flawed, because in order to work, it needs to be influenced by the very thing it tries to explain. The reason a bowling ball distorts a sheet is because Earth's gravity is affecting it. However, the space-time curvature which this distortion is an analogy to is trying to explain gravity. The implication of this space-time curvature is that something is pulling down on the space-time plane, but this pulling itself requires gravity from a perpendicular source, it seems to me.  I'm having difficulty wrapping my head around this. The method we use to explain gravity itself uses gravity to work, sort of like some kind of recursive loop. it's comparable to "to get fuel, we need to drive, and to drive, we need fuel", and I don't know enough about gravity to figure this out myself.  Am I understanding this analogy correctly, or are there deeper things at play?

Whenever I read about the curvature of spacetime as an explanation for gravity, I see pictures of a sheet (spacetime) with various masses indenting the sheet to form "gravity wells." Objects which are gravitationally attracted are said to roll down the curved sheet of spacetime into the gravity well. This is troubling to me, because, in order for objects on the locally slanted spacetime sheet to accelerate, gravity must be assumed. Therefore I ask; does the explanation of gravity as the curvature of spacetime assume gravity? If yes, what is the point of the theory? If No, what am I missing?


je cherche a Installer Ubuntu (n importe quel version ) mais compatible avec un CPU AMD A8-4500M APU with tm HD graphics 1.90 GHZ  Translation:  I’m looking for a Ubuntu installer (doesn't matter which version) that is compatible with a CPU AMD A8-4500M APU with tm HD graphics 1.90 GHZ

For a given hardware configuration, how do I find out if Ubuntu will run on it? What considerations should I take into account when choosing an Ubuntu version and  such as:    with a lighter desktop than the usual Gnome and Unity  with the even lighter LXDE desktop   Obviously Ubuntu does not run on some processor architectures. So how do I go about choosing the right version and derivate. How can I find out the minmal system requirements?


i have a computer with windows xp home edition. I want to install Ubuntu. I am connect to the internet on a windows 10 computer. I want to create a cd/dvd for the xp computer. how is that done?

I would like to see a full how-to guide on how to install Ubuntu.


I have some issues creating a login activity.  Even though I put the right username (123456) and password (123456789).  I made sure to put the getText() method inside onLogin but I always get the message "login failed" and so I assume I don't get any data from EditText, and so I can't see what's wrong. this login java class:        public class LoginActivity extends AppCompatActivity {      private EditText UsernameEt;     private EditText PasswordEt;     AlertDialog alertDialog;       @Override     public void onCreate(Bundle savedInstanceState) {         super.onCreate(savedInstanceState);         setContentView(R.layout.activity_login);            UsernameEt=findViewById(R.id.username);         PasswordEt=findViewById(R.id.password);         alertDialog = new AlertDialog.Builder(this).create();         alertDialog.setTitle("Login Status");       }      public void onLogin(View view) {         String username = UsernameEt.getText().toString();         String password = PasswordEt.getText().toString();         String type = "login";          //BackgroundWorker backgroundWorker = new BackgroundWorker(this);         //backgroundWorker.execute(type, username, password);          if(username=="123456" && password=="123456789"){              alertDialog.setMessage("Login success");             alertDialog.show();         } else {              alertDialog.setMessage("Login failed");             alertDialog.show();         }     }   }     and this is the login xml:        <?xml version="1.0" encoding="utf-8"?> <ScrollView xmlns:android="http://schemas.android.com/apk/res/android"     xmlns:tools="http://schemas.android.com/tools"     android:layout_width="match_parent"     android:layout_height="match_parent"     xmlns:app="http://schemas.android.com/apk/res-auto"     android:background="@drawable/bg"     android:fitsSystemWindows="true">       <LinearLayout         android:layout_width="match_parent"         android:layout_height="match_parent"         android:layout_gravity="center"         android:orientation="vertical">          <EditText             android:id="@+id/username"             android:layout_width="match_parent"             android:layout_height="wrap_content"             android:backgroundTint="#FFFFFF"             android:drawableLeft="@drawable/ic_person_black_24dp"             android:ems="10"             android:hint="IPN"             android:inputType="textPersonName"             android:textColor="#FFFFFF"             android:textColorHint="#FFFFFF" />          <EditText             android:id="@+id/password"             android:layout_width="match_parent"             android:layout_height="wrap_content"             android:backgroundTint="#FFFFFF"             android:drawableLeft="@drawable/ic_lock_black_24dp"             android:ems="10"             android:hint="Password"             android:inputType="textPassword"             android:textColor="#FFFFFF"             android:textColorHint="#FFFFFF" />          <Button             android:id="@+id/buttonLogin"             style="@style/DefaultButton"             android:layout_width="wrap_content"             android:layout_height="wrap_content"             android:layout_gravity="bottom|center"             android:layout_marginTop="16dp"             android:layout_marginEnd="0dp"             android:layout_marginRight="0dp"             android:background="@drawable/gradiant"             android:onClick="onLogin"             android:text="@string/login"             app:layout_constraintEnd_toEndOf="parent"             app:layout_constraintStart_toStartOf="parent" />     </LinearLayout>  </ScrollView>

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


Im in a book and they use this rotation matrix formula in the picture.    Where does it come from. I know that the c in the matrix is for Cos and the s is for Sin.  Is there a proof?

Can someone help me out on how to find the the matrix representation and show proof that it is a linear transformation?    It is the rodrigues roation formula  and the matrix representation should look like    where c and s are cos and sin


Quite often, a user will use a service such as JSFiddle to demonstrate their point, and some answerers use it in return for a live demonstration of their code.  I'm not just talking about JSFiddle either, there are a number of services that allow links as part of a support to the OP's question or an answer.  Can these links open in a new window/tab?    I often find myself trying things in these services and testing code through a number of revisions and when I've finally solved the OP's issue, I have to use my back button to navigate through everything I've just done, just to post it back to them.  Yes, I could open in a new tab through browser functionality, but it's my own fault that I forget to do this all the time, I'm only human.  Is this possible?

Most of the time when I follow a user's link, I just want to see their site, look it over, then return to answer their question (not leave SO completely and not come back). Could we make the links users post open in a new window please?  EDIT: I originally wanted this implemented because it's what some other sites did, but I now definitely prefer SO's way. If I want to open a new tab, I middle-click/control-click (or whatever); if not, I just click. I'm in control of what happens. Would never want to go back now.


Is there any way to recover the data off of my 1TB hard drive once it has been erased? From my mac I just selected that external drive and clicked on erase and both the partions are gone now :(  PS: I havn't copied anything on it.

I lent my hard drive to a friend and he has formatted it as he couldn't get his PC to recognise it. I have no Time Machine backUp. Is there any way of recovering this data?


Need to make so do something if its overflowing Verticaly. Lead me towards right direction.  Exmaple:    .contents {   width: 200px;   height: 100px;   border: 1px solid black; }
 CONTENT CCC
 CONTENT CCC
 CONTENT CCC
 CONTENT CCC
 CONTENT CCC
 CONTENT CCC
 CONTENT CCC
 CONTENT CCC

Can I use JavaScript to check (irrespective of scrollbars) if an HTML element has overflowed its content? For example, a long div with small, fixed size, the overflow property set to visible, and no scrollbars on the element.


We now have two overarching theories to explain just about every physical phenomenon: Einstein’s theory of gravity (general relativity) and quantum mechanics. The former is good at explaining the motion of everything from golf balls to galaxies. Quantum mechanics is equally impressive in its own domain — the realm of atoms and subatomic particles. Trouble is, the two theories describe our world in very different terms. In quantum mechanics, events unfold against a fixed backdrop of spacetime — while in general relativity, spacetime itself is flexible. What would a quantum theory of curved space-time look like? “We don’t even know what it is we’re trying to quantize.” For decades now, string theory — which pictures matter as made up of tiny vibrating strings or loops of energy — has been touted as the best bet for producing a unified theory of physics. But some physicists prefer loop quantum gravity, in which space itself is imagined to be made of tiny loops. So can all of these theories be unified? If yes, then how?

The one difficulty I see with LQG is that it requires an enormous number of degrees of freedom, e.g. these spin variables in the net.  This is in contrast to stringy holographic theory where the fields in a space are equivalent to fields on a boundary or a horizon of one dimension lower.  In this setting entropy of a black hole is the entanglement entropy of states interior and exterior to the black hole.  This reduces the amount of data, and thus entropy, required.  Are there suggestions, conjectures or maybe serious theory which attempts to describe the spin variables of LQG according to such entanglements in string-brane theory?


While it was working a while ago, scale and rotate is not working in the 3d View anymore, grab is working though. I'm allowed to scale the objects manually using the N-key but the shortcuts are not working, no matter how much I press S and R:  Did I press a key or something?

I am using Blender 2.80 beta. In Object Mode Scaling and Rotating objects stopped working.  How do I enable rotating and scaling again?  The button that is referenced in Blender 2.7x does not exist in Blender 2.80. The odd thing is if I create a new model everything works fine...it just stopped working on my original model and still isnt working.  ???


I have a door that was slightly tilted and didnt close properly. I noticed the hinge was a tad loose, and what was holding it was a short 0.5" screw. I replaced it the screws with a new 1" screw and the door was ok for a couple weeks. But now its tilting sideways again, and the screws are loose again. I assume that the screw holes are worn out and thus do not hold the screws well, and gave up. The door, and the door frame, is a regular standard US wooden door. The hinges are common as well. Not familiar with exact model, type, or naming convention. In the images you can see the hinge tilting sideways, as well as it pushing the screws out from the screwholes. I was thinking about using screw anchors. But what other methods are there to fix a loose screw hole? Attached Images    Thank you

The door to my basement broke. The bottom hinge has three screws; the top and bottom one turn endlessly. You can see the pictures .  I understand that there's a , where you can put glue and matchsticks or toothpicks into the hinge holes to get additional backing.   In my case, it looks like some pieces of the hinge backing are actually missing. There aren't holes in the wall that I can use cleanly and patch up with matchsticks.  What do I need to do to fix the hinge door -- add additional backing? What can I use, other than the obvious choice of real wood (eg. toothpicks, cardboard)?


In our application, I have created a login test for our website. If this test is successful then login is successful. Now to create tests for other parts of the website, I need to perform login first.  Is there a way so that all the other tests that I will create will run the login test first? For example: is it possible to create a custom login test attribute that I can put on all other test methods, so that they will run login first? But then I also need the return value from that login test !  If not, then I will have to just write a plain C# function that performs login operation and I will need to put that function call, as the first line of every test.

Is it possible to run specific method before each test in an assembly?  I know about TestInitialize attribute but this attribute has "class scope". If it's defined in a Test class it will be executed before each test from this class.   I want to define a method that will be executed before each test defined in a whole assembly.


i'm trying to install kde5 on ubuntu 14.04 but after update system and add some PPA, packages dont find in repository.  sudo apt-add-repository ppa:kubuntu-ppa/next sudo apt-get update sudo apt-get dist-upgrade sudo apt-get install kubuntu-plasma5-desktop  Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package kubuntu-plasma5-desktop   or this way:  sudo add-apt-repository ppa:neon/kf5 Cannot add PPA: 'No JSON object could be decoded'.   or try this way:  sudo apt-get install project-neon5-session project-neon5-utils                                The following packages have unmet dependencies:  project-neon5-session : Depends: project-neon5-plasma-framework but it is not installable                          Depends: project-neon5-kde-workspace but it is not installable                          Depends: project-neon5-kde-runtime but it is not installable E: Unable to correct problems, you have held broken packages.   how to add correct repository and resolve this problem

KDE Plasma 5 is hitting release candidate now: .  How can I install plasma 5 in Ubuntu 14.04.


I have a 16.04 server running and have set up Wake On Lan through   {ethtool - s <NIC> wol g}   and  {auto <NIC> iface <NIC> inet dhcp up ethtool -s <NIC> wol g}   in /etc/network/interfaces.  I use rtcwake -m mem to test, but cannot get the server to start up. I have used ngrep to control that the server receives the magic packet, and I have tried to install Windows on the server to confirm that the hardware supports WOL.  Others have reported that they can bypass this problem by shutting off with the power button, but that does not have any effect here.  What am I missing?

I have a PC that has a Windows 8 partition and an Ubuntu 13.04 partition.  I am trying to get wake-on-lan to work.  Everything works fine on the Windows 8 partition: I can wake-on-lan from both the sleep state and the shutdown state. However, when I shutdown Ubuntu using:  sudo shutdown -h now   I cannot wake the PC through my LAN. Is this because the network interface is getting turned off? What command can I use or how can I reconfigure Ubuntu so that wake-on-lan still works?  Also, if I do not use the -h option in the shutdown command, the PC does not actually shutdown; it just freezes up on me.  Using ethtool, I found that it says:  Supports Wake-on: pumbg Wake-on: g ... Link detected: yes   My etc/network/interfaces says this:  auto eth0 iface eth0 inet dhcp       up ethtool -s eth0 wol g   EDIT: I have found that if I shut down the PC by simply holding the power button, then wol works. If I shutdown using the command line or through the Ubunutu GUI, then it does not work. So I think the issue is not that it is not being setup properly, but that something is overriding it or shutting it off when I shut down properly. Are there are any scripts that get run at shutdown?  I have added  NETDOWN=no   to both etc/default/halt and etc/init.d/halt


I recently installed windows 7 64 bit on a SSD and now, it appears that all of my folders and most of my files are read only. I have tried to remove the read only aspect of them, or take ownership of the drives or folders but I can't seem to have a permanent solution to this issue. I imagine it might have something to do with policies, but I am not familiar enough with them.  Does anyone know how I can fix this?

I purchased a new SSD and installed Windows 7 64-bit from scratch. I found that my old C: drive, which is now the D: drive, had ownership by an unknown user. I found a way to change the ownerships of everything to my new user ID. However, a lot of files are now read-only, and I can't seem to get rid of the read-only attribute.  I have tried from Windows Explorer, I have tried attrib from an administrative cmd, I have tried cygwin chmod (cygstart -a=runas find . -exec chmod +w {} \;). I see numerous others with the same problem, but don't see any solutions.


im using laptop with windows xp OS..my D: drive is infected with virus..its not displaying the data but properties show a data of 9gb present in the drive.i tried show hidden files and folders also...i also tried . by typing it in search box but it didn't work..it worked well with windows8.but my OS is Windows XP.. please tell me a way to recover the data.

Yesterday, my laptop caught a virus which caused massive damage. Since them, I have been trying to recover important files before reformatting my computer, a task the virus has not made easy.   Restoration points predating the attack have been deleted.  Most of my folders show empty.  My Start menu is essentially empty, with the exception of Trillian and Mirror's Edge. The same goes for my Desktop, which only has programs which were installed after the attack.  Searching for files through my computer is pretty much useless, as it only rarely brings up anything. I suspect most of my files have not been deleted. While my folders show empty, uTorrent still does display them and I can open them from here. Unfortunately, when I select Open Containing Folder, the folder still shows as completely empty even if I'm currently watching a video from that very folder. Further adding evidence to the not-deleted-just-missing theory, the data recovery software I'm using (Restoration) cannot find only find an handful of the missing files.   If they were deleted, I could do a forensic recovery to get them back but since they're probably still somewhere on my computer, just out out of my reach, I can't find them.   Under those circumstances, is there a way I can recover those files?


Is it possible to configure Apache Web Server to handle up to 100,000 or more concurrent connections?   I know if this were to be possible, it's definitely going to be resource intensive. In that case, what would be the most likely hardware configuration?  If it's not possible, then what is the maximum concurrent connections that Apache can be configured to handle?  Thanks in advance.

This is a  about capacity planning for web sites. Related:      What are some recommended tools and methods of capacity planning for web sites and web-applications? Please feel free to describe different tools and techniques for different web-servers, frameworks, etc., as well as best-practices that apply to web servers in general.


I installed ubuntu inside windows 7 using VMware. I wanted to execute a c program in ubuntu.  when I tried I got like this,  b@ubuntu:~/examples$ vim a.c The program 'vim' can be found in the following packages:  * vim  * vim-gnome  * vim-tiny  * vim-gtk  * vim-nox Try: sudo apt-get install <selected-package> b@ubuntu:~/examples$ sudo apt-get install vim [sudo] password for b: Reading package lists... Done Building Dependency tree Reading state information... Done Package vim is not available, but is referred to by another Package. This may mean that the package is missing, has been obseleted, or  is only available from another source  E: Package 'vim' has no installation candidate I tried apt-get install vim  E: Could not open lock file /var/lib/dpkg/lock - open (13:Permission denied) E:unable to lock the administration directory (/var/lib/dpkg/), are you root?   when I tried to do su it asked me for a password . When I typed the root password its not accepting it and says "Authentication Failure"  I could not install the Vim package. Is there any way I can install it? Please suggest me. How do I regain my root paswword.

What does the above Error mean? What is an installation candidate?  I was trying to do  sudo apt-get install munin-memcached     and I get this message:  Reading package lists... Done Building dependency tree        Reading state information... Done Package munin-memcached is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source E: Package munin-memcached has no installation candidate   I googled for the problem and someone said to do a apt-get upgrade but it still did not solve my problem.


Is there a known algorithm which finds the longest path in an acyclic, directed graph like the one below?  For this example, the algorithm should calculcate a longest path of 28m

Given a directed acyclic graph the task ith positive edge weight is to find the maximum weighted path between 2 nodes u and v using 2 traversal meaning after the first traversal from u to v find the first path let its weight be v1 and replace the edges along the path with 0  again do the second traversal from u to v in the modified graph and find a path let its value be v2. The task is to maximize the sum of v1 and v2. The solution I thought of is to use the classic Dynamic programming algorithm to find longest weighted path for the first traversal and replace edges by 0 along the path again run same algorithm in the modified graph and the value of value from 1st and second traversal is result. But this approach is not yielding an optima solution can anyone give example where it is failing and a possible solution to the problem?


Here is my html   <input type="text" />

Apple

Peach

Bannana

Tomato

   And my jQuery code yet  var items = $("div").find("p").text();  console.log(items);   How can I highlight each character inside div p that matches value in input? Let's say that users write down in input character "a". Page should look like this, even A character in apple should be bold.   Apple  Peach  Bannana  Tomato  here is  as well

I basically need to highlight a particular word in a block of text. For example, pretend I wanted to highlight the word "dolor" in this text:
     Lorem ipsum dolor sit amet, consectetuer adipiscing elit.

     Quisque bibendum sem ut lacus. Integer dolor ullamcorper libero.     Aliquam rhoncus eros at augue. Suspendisse vitae mauris.
  How do I convert the above to something like this:
     Lorem ipsum dolor sit amet, consectetuer adipiscing elit.

     Quisque bibendum sem ut lacus. Integer dolor ullamcorper     libero. Aliquam rhoncus eros at augue. Suspendisse vitae mauris.
  Is this possible with jQuery? Edit: As  , this is quite possible without jQuery - but I was hoping there might be a special method of jQuery which would let you do selectors on the text itself. I'm already using jQuery heavily on this site, so keeping everything wrapped up in jQuery would make things perhaps a bit more tidy.


From the Maxwell's equations point of view, existence of magnetic monopole leads to unsuitability of the introduction of vector potential as $\vec B = \operatorname{rot}\vec A$. As a result, it was introducted by Dirac fiber-like theory of monopole, which is considers a model of monopole as the open end of a semi-infinite solenoid. This is physically unsatisfactory. Another approach, is the introduction of another 4-potential along with $A_{\mu},(\text{where  } \mu = 0,1,2,3)$. But such models had problems with formulating in a frame of the principle of least action. And if I'm not mistaken, this problem had been solved (see ). A two-potential models, seems to be more acceptable.   How will the quantization procedure of the electromagnetic field change in two-potential models? Does the photon acquire an additional degree of freedom?

Absence of magnetic charges is reflected in one of Maxwell's fundamental equations: $$\operatorname{div} \vec B = 0. \tag1$$ This equation allows us to introducte concept of vector potential: $$\vec B = \operatorname{rot} \vec A.$$ Using this concept, it is possible to express Maxwell's equations in a graceful symmetric form: $$\nabla^2 \vec A - \frac{1}{c^2}\frac{\partial^2 \vec A}{\partial t^2} = - \frac{\vec j}{\epsilon_0 c^2}, \tag2$$ $$ \nabla^2 \phi -\frac{1}{c^2}\frac{\partial^2 \phi}{\partial t^2} = - \frac{\rho}{\epsilon_0}. \tag3 $$  Noticing, that vector $\vec A$ and scalar $\phi$ potentials, as well as electric current density $\vec j$ and charge density $\rho$, form a 4-vector in Minkovsky space-time. Therefore, Maxwell's equations can be expressed in a covariant form, using d'Alembertian: $$\nabla_{\mu}\nabla^{\mu} A_{\nu} = \frac{j_{\nu}}{\epsilon_0}. \tag4$$  If magnetic monopols exist, Maxwell's equation $(1)$ will look as: $$\operatorname{div} \vec B = \mu_0 c \rho_{\mathrm{magnet}}.$$  As the divergence of $\vec{B}$ isn't equal to zero, it impossible to introduce concept of vector potential. Thus, the equation in the form of $(4)$ will not be possible to express.


I'm working on an Ubuntu Touch app that needs to modify iptables and do various other things that requires interaction with the command line. I found  and I understand that it must be done with a C++ plugin or a possible future extension in the SDK. Is there any such extension available now? And can someone elaborate on how I can use C++ to run a command from qml?

I want to run a system command from inside my application. It's suppose to run a command on a remote server using SSH. But that's not really the point. The point is that I don't know how to run any kind of command from the app. I asked in the mail list and they referred me to build a QML extension using C++. But I don't know C++ and it seems that I have to learn so much only to run a simple command.  In Python (as in PHP) it's easy to run a system command. Is there any other way of doing it in my Touch app, or is there someone that could help me even more? Or perhaps have a better solution to my problem?


When I import pgfplots, it affects behavior of \vfill.  The following code works as expected:  This should be at the top of the page. \vfill This should be at the bottom of the page. \eject \end   whereas with the following, both lines go at the top of the page:  \input pgfplots.tex This should be at the top of the page. \vfill This should be at the bottom of the page but isn't. \eject \end   Why is that? How can I mitigate this effect, so that the latter code work as expected?  (I use plain XeTeX)

I noticed a strange behavior when running PGF/tikZ with pdfTeX on my Debian box : a simple session without tikz:  pdftex **\relax *Hello World *\bye   do output the page number on the page footer. On the other hand, loading tikz:  pdftex **\relax *\input tikz.tex *Hello World *\bye`   does make the page number on the footer disappear. The page size does not seems to be the cause.  Does any of you have any idea of the cause behind this behaviour?


class str {     char *p;     public:        string(const char *s); }   I am confused about the difference between these two declarations.

I've recently decided that I just have to finally learn C/C++, and there is one thing I do not really understand about pointers or more precisely, their definition.  How about these examples:   int* test; int *test; int * test; int* test,test2; int *test,test2; int * test,test2;   Now, to my understanding, the first three cases are all doing the same: Test is not an int, but a pointer to one.  The second set of examples is a bit more tricky. In case 4, both test and test2 will be pointers to an int, whereas in case 5, only test is a pointer, whereas test2 is a "real" int. What about case 6? Same as case 5?


I just purchased a new lenovo ideapad 100 (100-15IBD) with a realtek wireless adapter. lspci showed me this :- 03:00.0 Network controller: Realtek Semiconductor Co., Ltd. RTL8723BE PCIe Wireless Network Adapter  Although Ethernet is working, wifi connection works for awhile but then stops to load in pages without any sign of disconnection. The signal is pretty good (near 70%).  I have Ubuntu 16.04 (with cinnamon desktop). Updated kernel to 4.6, disabled power management and ipv6, still the problem persists. It works for awhile I pause working and then when I return, after a little time want to open a new tab and it will never come, only if I disconnect/connect... The period for which it remains connected is very much random, couldn't figure out what could cause the internet stop.  Here is the wireless-info.tar.gz:   As I see I'm not alone with this problem and the others didn't got answers neither.

I have installed Ubuntu 15.04 on my laptop with RTL8723BE Wi-fi card. But it is always disconnecting from network. I have tried echo "options rtl8723be fwlps=N ips=N" | sudo tee /etc/modprobe.d/rtl8723be.conf but that didn't helped. What can I do to prevent the wifi from disconnecting? If I upgrade to kernel 4.X, will it help?  ~$ lspci -knn | grep Net -A2  09:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. RTL8723BE PCIe Wireless Network Adapter [10ec:b723]     Subsystem: Hewlett-Packard Company Device [103c:2231]     Kernel driver in use: rtl8723be   ~$ rfkill list 0: hci0: Bluetooth     Soft blocked: yes     Hard blocked: no 1: phy0: Wireless LAN     Soft blocked: no     Hard blocked: no   ~$ ifconfig && iwconfig && route -n && ping -c 1 google.com eth0      Link encap:Ethernet  HWaddr 38:63:bb:cd:4a:7e             UP BROADCAST MULTICAST  MTU:1500  Metric:1           RX packets:3 errors:0 dropped:0 overruns:0 frame:0           TX packets:53 errors:0 dropped:0 overruns:0 carrier:0           collisions:0 txqueuelen:1000            RX bytes:752 (752.0 B)  TX bytes:8445 (8.4 KB)  lo        Link encap:Local Loopback             inet addr:127.0.0.1  Mask:255.0.0.0           inet6 addr: ::1/128 Scope:Host           UP LOOPBACK RUNNING  MTU:65536  Metric:1           RX packets:3870 errors:0 dropped:0 overruns:0 frame:0           TX packets:3870 errors:0 dropped:0 overruns:0 carrier:0           collisions:0 txqueuelen:0            RX bytes:314613 (314.6 KB)  TX bytes:314613 (314.6 KB)  wlan0     Link encap:Ethernet  HWaddr c0:38:96:6d:c4:83             inet addr:192.168.1.205  Bcast:192.168.1.255  Mask:255.255.255.0           inet6 addr: fe80::c238:96ff:fe6d:c483/64 Scope:Link           UP BROADCAST RUNNING MULTICAST  MTU:1500  Metric:1           RX packets:15240 errors:0 dropped:0 overruns:0 frame:0           TX packets:14627 errors:0 dropped:0 overruns:0 carrier:0           collisions:0 txqueuelen:1000            RX bytes:14410285 (14.4 MB)  TX bytes:2192744 (2.1 MB)  eth0      no wireless extensions.  wlan0     IEEE 802.11bgn  ESSID:"DIR-615"             Mode:Managed  Frequency:2.437 GHz  Access Point: 00:90:4C:08:00:0D              Bit Rate=150 Mb/s   Tx-Power=20 dBm              Retry short limit:7   RTS thr=2347 B   Fragment thr:off           Power Management:off           Link Quality=70/70  Signal level=-22 dBm             Rx invalid nwid:0  Rx invalid crypt:0  Rx invalid frag:0           Tx excessive retries:0  Invalid misc:186   Missed beacon:0  lo        no wireless extensions.  Kernel IP routing table Destination     Gateway         Genmask         Flags Metric Ref    Use Iface 0.0.0.0         192.168.1.1     0.0.0.0         UG    400    0        0 wlan0 169.254.0.0     0.0.0.0         255.255.0.0     U     1000   0        0 wlan0 192.168.1.0     0.0.0.0         255.255.255.0   U     0      0        0 wlan0 PING google.com.Dlink (172.26.136.19) 56(84) bytes of data. 64 bytes from 19.136.26.172.in-addr.arpa (172.26.136.19): icmp_seq=1 ttl=249 time=102 ms  --- google.com.Dlink ping statistics --- 1 packets transmitted, 1 received, 0% packet loss, time 0ms rtt min/avg/max/mdev = 102.547/102.547/102.547/0.000 ms


I setup a CMake project where I have an executable statically linking against libA and libB whereas libB calls methods from libA (to be specific: libA is some 3rd party library and libB is some utility/convenience extension I added on top). While everything compiles and links fine on Windows, I get several unresolved references under gcc 8.2. After some digging I noticed that the linker errors disappear when I make sure to call into libA before the first call into libB.  So it seems as if the linker first ignores and doesn't at all link libA because it can spot I don't directly use it in my executable, then discovers the first use of libB and then either can't resolve libA's symbols at all or links them after libB in incorrect order, resulting in the linker errors. Is this correct or is there something else going on? And what's the appropriate solution? Is there any flag or setting I have to add in my CMake script or would you suggest just linking against libA from libB and then only linking against libB in the executables?  EDIT: The problem was, I linked the libraries in exactly the wrong order (and I was actually very convinced this was correct). As the reference provided by Mike Kinghan somewhere pointed out the lib depending on another one has to go before the other one in the target_link_libraries call.

Why does the order in which libraries are linked sometimes cause errors in GCC?


I have a bash script which simply activate a python virtualenv and execute a python script.  #!/bin/bash . /usr/local/bin/utils.sh . /home/fold/.bash_profile set -eu -o pipefail  script_name=main_ETL script_file="/srv/scripts/${script_name}.py" log_file="/srv/scripts/logs/${script_name}.log"  set +u source /srv/python/virtualenvs/bin/activate set -u  log "Starting..." | tee -a ${log_file} python "$script_file" log "Execution completed" | tee -a ${log_file}   I save the standard output of crontab execution in a file. Cron job get executed correctly but first line of file is always :  tput: No value for $TERM and no -T specified   How can i fix this and make that warning/error disappear?

I am trying to run a bash script I have via cron, and I am getting the following error at the beginning of the execution:  tput: No value for $TERM and no -T specified   Here is what is in my crontab:  0 8 * * 1-5 cd /var/www/inv/ && /var/www/inv/unitTest run all 2>&1| mail -r "user@example.com" -s "Daily Inventory Unit Test Results" user@example.com


I wanna know if there's any way to reverse texts in latex so that I can use it to print on tracing paper for press printing. For good understanding my question, please see the graphic have I attached with.

The following  (links to pdf) in the  has no provided source. The book  by Ash and Gross seems to use a similar style. Where can I find hints for typesetting publication standard articles/books as above in TeX. I looked around a bit but couldnt find much from else from keyword searches.  Particularly, I am looking at the chapter headings, title page design, and the mirror effect. Sorry for the title, as I dont really know what its called.


In the  the unit of the charge is the statcoulomb (statC), defined as $$ \mathrm{statC =dyn^{1/2} cm= cm^{3/2} g^{1/2} s^{−1}}$$ to be consistent with the fact that the Coulomb force is measured in $\mathrm{g\,cm\, s^{-2}}$ without defining new fundamental units (the Ampère). So, in this non-standard units system is possible to have rational powers of physical units, but do they have a physical meaning on their own? Or is just a way to make the units consistent?     is related, but they are talking about different units in fractals and phase transitions, while here we are talking about electrodynamics.

I'm more of a math guy than a physics guy so bear with me....  In fractal geometry, fractals are considered to have fractional dimension. For instance an object such as the Koch curve has a fractal dimension of around $1.2$. You can also define a concept called fractal extent (which is the experimental version of hausdorff measure). This extent is a measure of how large a fractal is. It's even been used to more accurately model the distribution of coastline bird nesting.   Even though fractals work as an interpretation of geometrical units, I don't think they would describe things such as $kg^{1/2}$ very well. In addition, I've heard about white Gaussian noise that has square root time units.   What is the physical meaning of fractional units such as the above? (Since it obviously has little geometric meaning)


Oftentimes I post a question on some Stack Exchange and what happens is that 21 people think the question is helpful and informative and 3 people think it should be closed. This is extremely unfair and I know that the contrarians do it because it costs them nothing. Therefore because Stack Exchange already has a feature which punishes the caster for downvoting answers, logically speaking it should also have a feature that punishes the caster for voting to close. Maybe -10 for each vote to close.  My question is not a duplicate of  because I the author acknowledge that inquirer as having a bad idea, because it can result in some question on a cartoon upvoted and the mods prevented from doing their jobs. The mods made the correct decision in not approving that feature. But this feature doesn't prevent mods from doing their jobs. It only makes them think... a little longer before they do their job.  As @gnat pointed out, users are only punished for downvoting answers, not questions. I thank @gnat for that correction.

I see a lot of good, well-writen and constructive questions (that are probably not only good for me) closed, by various reasons which I fail to digest, so I propose the idea that questions with n upvotes should not be closable.  This would be in my opinion very much in the spirit of "", and unless I'm wrong, it would be beneficial for the users to choose by themselves whether the site should have or not x question. The ones which are low quality never get many upvotes anyway.  The only cons I can think of are... DB space? And at a minimum there's the pro of more popular pages with more ads (for the admins), and questions people like (for the users).  I'm also counting for , in the lines of Google's "", but questions  are more like what I'm aiming at (probably that question has not many upvotes for this though).


Knowing that ESRI is retiring their legacy geocoding systems, what good alternatives for batch geocoding do you know of?

Esri's  will retire at the end of the year, what are good GIS services that can replace the North American and US Streets geocoders?  I have totally excluded Esri's replacement, the  as it is a subscription service.


We say that $p$ is minimal prime if It does not contain any other prime.  Assume that $A$ is Noetherian ring  Question: $A$ has only finitely many minimal primes.  any suggestions please

How to prove a commutative, with unit, Noetherian ring $A$ only has finitely many minimal prime ideals via the following step?   I have proved:     Step. All radical ideals of Noetherian ring $A$ can be expressed as an intersection of finitely many prime ideals.   How to continue?


Which Stack Exchange site should I use to ask about big data courses?  I want to get opinions on what free online courses I can enroll.

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


I am trying to make an home page for my website and its not sticking to one page and expands to around 120% height, when I set it to 100% height. I am trying to set my h1 and p tags in the middle of the page. When i use inspect and try to shrink the width as if I was on a mobile device the footer doesn't stay at bottom:0; as written in the css but instead it moves up as if footer position was set to bottom: 20%.   html, body{     margin: 0;     padding: 0;     width: 100%;     font-family: sans-serif;     height: 100%; }  html {   box-sizing: border-box; } *, *:before, *:after {   box-sizing: inherit; } .container {     padding: 10% 5%;     justify-content: center;     align-content: center;     text-align: center;     height: 70%;     margin-left: auto;     margin-right: auto; }   .headerNav {     background-color: rgb(0, 0, 0);     color: white;     font-weight: bold;     text-transform: uppercase;     z-index: 100;     max-width: 100%;     right: 0;     top: 0;     left: 0;     padding: 10px 0px;     font-size: 20px;     display: grid;     grid-template-columns: auto auto; }  .homePG{     text-decoration: none;     text-align: left;     padding: 10px 10px; }  .headerLogin{     text-align: right;     grid-gap: 5px; }  footer {     position: relative;     text-align: center;     background-color: black;     color: white;     padding:10px;     font-size:15px;     bottom: 0; } <!DOCTYPE html>       <link rel="stylesheet" href="style.css">     <title>Brandon's Login System</title>     <link rel="stylesheet" href="includes/header.css">     <link rel="stylesheet" href="includes/footer.css">     <link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/4.7.0/css/font-awesome.min.css">     <meta name="viewport" content="width=device-width, initial-scale=1">                             HOME
             <form class="headerForm" action="includes/login.inc.php" method="POST">                 <input type="text" name="mailuid" placeholder="Username/E-mail...">                 <input type="password" name="pwd" placeholder="Password...">                 <button type="submit" name="login-submit">Login</button>                 Sign Up             </form>

HOME PAGE

             Welcome to the home page.

              © 2020 Brandon Ng

I am working on a web application where I want the content to fill the height of the entire screen.  The page has a header, which contains a logo, and account information. This could be an arbitrary height. I want the content div to fill the rest of the page to the bottom.  I have a header div and a content div. At the moment I am using a table for the layout like so:  CSS and HTML    #page {     height: 100%; width: 100% }  #tdcontent {     height: 100%; }  #content {     overflow: auto; /* or overflow: hidden; */ }

...

...

     The entire height of the page is filled, and no scrolling is required.  For anything inside the content div, setting top: 0; will put it right underneath the header. Sometimes the content will be a real table, with its height set to 100%. Putting header inside content will not allow this to work.  Is there a way to achieve the same effect without using the table?  Update:  Elements inside the content div will have heights set to percentages as well. So something at 100% inside the div will fill it to the bottom. As will two elements at 50%.  Update 2:  For instance, if the header takes up 20% of the screen's height, a table specified at 50% inside #content would take up 40% of the screen space. So far, wrapping the entire thing in a table is the only thing that works.


This is the day where I will arise to redeem your life and fully restore it back to Me.    The dictionary says that both are interchangeable, but to what extent and is this true at all? I often hear "the day where" used to mean "the day when", is this grammatical or not?

What is the difference between "I remember the day where..." and "I remember the day when..."?    I think both are used in both written and spoken English. Can we say that "when" makes more sense when we are talking about a specific point in time?


Ok, at the end of an English class, the teacher says "Do you have any questions?"  Student A:  I have no question Student B:  Me, too / Me, either  So, the Student B should say "Me, too" or "Me, either"? I know that "Me, either" is American English: "Me, either" is American English: . EDIT (after comments): So, we can't use "Me, too" in this case? Note: my question is unique. I know the rule of using "Me, too" or "Me, either". "Me, too" for positive sentence & "Me, either" for negative sentence.  Ex: I have a question. Me, too Ex2: I don't have a question. Me, either.  So if we say "I have no question" then  which one we should use "Me, too" or "Me, either"?

What is the difference:  -I want to drink something. -Me too.  And  -I want to drink something. -Me either.


I want to delete the selected element in an array in java, for example deleting 3,5,8 in   int[]={3,2,5,6,4,8,9}

Given an array of n Objects, let's say it is an array of strings, and it has the following values:  foo[0] = "a"; foo[1] = "cc"; foo[2] = "a"; foo[3] = "dd";   What do I have to do to delete/remove all the strings/objects equal to "a" in the array?


When I click on the "open in browser" option, the question is just reloaded in a new site of the SE app.  Where can you change the settings for this option (choose the application it is opened with). Maybe I accidentally hit in the beginning open with SE-app, but I'm not even sure how it works.

I'm using the SE app on an Android phone (Galaxy S5 OS 6.0).  When I try the option to view a question in a browser, it simply opens the same question in the app. It doesn't even try opening the browser.  Is this a common issue, or am I the only one experiencing it?  Things I've tried:   clearing defaults for the SE app, clearing defaults for my browsers, clearing data for the SE app, restarting my phone   Here's the option I'm talking about:


It is said that a order $\gamma > 0$ continuous function is named Hölder when   $|f(x)-f(y)| <= C|x-y|^\gamma$  being $C$ a constant, such as $C > 0$.  A) Prove that if $f$ is a order $\gamma > 1$ continous Hölder function, then, $f$ is derivable. Show that, in fact, $f$ must be constant.

I want to show that if a function $f:[a,b]\rightarrow \mathbb R$ satisfies a Hölder condition of order $\alpha > 1 $ then it is constant.  The way I think of it is as follows:  $$|f(x) - f(y)| < K|x-y|^\alpha$$  $$\frac{|f(x) - f(y)|} {|x-y]}  < K|x-y|^{\alpha -1}$$  $$\lim_{y\rightarrow x} \frac{|f(x) - f(y)|} {|x-y]} \le \lim_{y\rightarrow x}  K|x-y|^{\alpha -1} =0 $$ As the limit is $0$, we can remove the modulus, so we get:  $$\lim_{y\rightarrow x} \frac{f(x) - f(y)} {x-y} = 0$$ So $f$ is derivable and $f'(x) = 0$ for all $x$ in $[a,b]$. Note that the reason we can add the limit $y\rightarrow x$ is because $[a,b]$ is closed in $\mathbb R$.  However, the question gives as a hint using the mean value theorem. I am not sure why one should do that. You would first have to prove that $f$ is derivable in a similar manner to what I did, and then prove that $f$ is constant. Or is there a simpler way to do it and I am missing it?  Also please inform me of any mistakes I did in the proof (if any)/ Thank you!


I guess reason can't be used to justify itself.      This is something Presuppositional Apologists love to play mischief with.  So how do we justify anything based on reason when reason itself is questioned?  I always feel anyone who questions not your reasoning but reason itself saws off the branch they are sitting on, but when you suggest this the response is "tu quoque".  I guess you have to say reason is justified empirically/inductively?  The innate function of a healthy mind?, it yields results, more than unreason?  Where can I read more about this?  I'm guessing this is a well known issue in Philosophy.

I recently read, "Reason can't defend itself without resort to reason." Is this universally true?


Ive tried examining the crime scene but nothing happens and when i talk to jorleif there is no option to get assistance. Is it because i picked the lock? I also took the strange element is that why?

I am trying to solve the "Blood on the ice"-quest and am told to examine the crime scene. But I cannot find any trigger to activate or object to collect.  What am I supposed to find/do here?


I'm trying to use rsync to transfer nearly 4GB of files onto a remote server that is supposed to be 20GB big.  On my computer, I run rsync -av --ignore-existing --inplace my_directory --compress-level=9 root@REMOTE.IP.ADDRESS:~/  The terminal prints a bunch of files being copies successfully for a while, then it prints this error.  rsync: recv_generator: mkdir "/path/to/some/directory" failed: No space left on device (28)  I ssh into my remote server. I run df -h. I see this (removed unneeded text).  Filesystem      Size  Used Avail Use% Mounted on /dev/root        20G  5.8G   13G  32% / devtmpfs        488M  4.0K  488M   1% /dev   I clearly have space on my remote server. Also, when I ssh into my remote server and run touch test, A file names test is created. But when I run touch test2 after that, I get this error: touch: cannot touch ‘test2’: No space left on device.  How do I transfer the rest of my folders and files to a remote server that claims it has no more space despite having space?  Update  Running df -i shows this.  Filesystem      Inodes   IUsed  IFree IUse% Mounted on /dev/root      1213440 1213440      0  100% /

I'm getting following error while doing tab, tab inside of shell:     -bash: cannot create temp file for here-document: No space left on device   root@alexus:~# cat /etc/issue.net Ubuntu 14.04.3 LTS root@alexus:~# uname -a Linux alexus 3.13.0-57-generic #95-Ubuntu SMP Fri Jun 19 09:28:15 UTC 2015 x86_64 x86_64 x86_64 GNU/Linux root@alexus:~# df -h Filesystem      Size  Used Avail Use% Mounted on /dev/vda1        30G   17G   11G  61% / none            4.0K     0  4.0K   0% /sys/fs/cgroup udev            487M  4.0K  487M   1% /dev tmpfs           100M  404K  100M   1% /run none            5.0M     0  5.0M   0% /run/lock none            498M  352K  497M   1% /run/shm none            100M     0  100M   0% /run/user root@alexus:~# df -i Filesystem      Inodes   IUsed  IFree IUse% Mounted on /dev/vda1      1966080 1966080      0  100% / none            127234      11 127223    1% /sys/fs/cgroup udev            124520     402 124118    1% /dev tmpfs           127234     346 126888    1% /run none            127234       1 127233    1% /run/lock none            127234      19 127215    1% /run/shm none            127234       2 127232    1% /run/user root@alexus:~#    how do I free inodes?


I am sure it's just your eyelashes creating a filtering effects, but if you look a a bright(ish) light source such as a lightbulb while squinting, if looks like you are seeing straight light rays emitting from the lightbulb, I assume you can't see an individual ray of light like this?

Simple question, I've always wanted to know the answer to this.  Why do you see a pair of lines radiating out from street lights when you squint at them? I can't think of a better way to describe what I mean, but I hope someone knows what I'm talking about.  Is it some sort of diffraction effect caused by your eyelashes acting as a grating?  Any ideas would be greatly appreciated :-)


I am interesting in the proof of that every rational number cannot have in decimal form infinite number of digits that don't repeat (or the other way around). So, then is enough to prove following statement: For any $n \in \mathbb{N}$ rational number $\frac{1}{n}$ can be represented in decimal form such that it's digits, if there are infinitely many, are repeating. If this is true, then it is true for any $\frac{m}{n} = \frac{1}{n} + \frac{1}{n} + ... + \frac{1}{n}$ ($m$ times).

I am trying to figure out how to prove that all rational numbers are either terminating decimal or repeating decimal numerals, but I am having a great difficulty in doing so. Any help will be greatly appreciated.


I need to draw a rectangle with a zigzag side as a kraft paper bag. How can I fill it properly with the color?  \documentclass{article} \usepackage{tikz} \usepackage{xcolor} \usetikzlibrary{decorations.pathmorphing} \tikzset{zigzag/.style={decorate,decoration=zigzag}} \definecolor{sandybrown}{rgb}{0.96, 0.64, 0.38} \begin{document} \begin{tikzpicture} \draw[thick,sandybrown,zigzag] (-2,0) coordinate(a) -- (2,0) coordinate(b); \coordinate (r) at (-2,-5); \coordinate (n) at (2,-5); \draw[fill=sandybrown] (a) -- (r) -- (n) -- (b); \draw[thick,sandybrown,zigzag] (-2,0) coordinate(a) -- (2,0) coordinate(b); \end{tikzpicture} \end{document}

This might be a tikz newbie question but I have some trouble solving this.  I want to draw and fill a rectangular path where path morphing should be applied only to the upper side of the shape, more specifically I want to have an upper part with random steps. The rest of the path (left, lower and right sides) should just be straight lines. The shape should be closed and filled with one color.   My problem is that I cannot figure out how to apply the morphing only to the upper side and I suppose I cannot break up the path into different subpaths since I want to fill the final shape. Is there a way to use the morphing only on a part of the full path? Another problem is that the cycle command does not really close the shape at the upper left corner.  I tried to find a solution in the tikz manual but there was nothing that really helped me.  Here is some example code:  \documentclass[tikz, border=10pt]{standalone} \usepackage{tikz}  \begin{document}  \usetikzlibrary{decorations.pathmorphing} \begin{tikzpicture}  \draw[decorate, decoration={random steps,segment length=3.0mm, amplitude=2.0mm}, thick, rounded corners=1ex, fill=brown!70] (0,0) -- (4,0) -- ++(0, -1) -- ++(-4,0) -- cycle;   \end{tikzpicture} \end{document}


Please guide. Traveling to India from USA. Am on Green Card in USA. Wanted to take a tourist stop of couple of weeks in Italy on the way. Problem is seems I will need a visa for my Italy stop. The Italian embassy do not have a interview date until July this is way past my travel dates. Kindly advise if I can get a Schengen visa from any other country for my travel to Italy. As indicated am stopping only in Italy and no other country in Europe this itinerary. Thanks for reading.

I am planning to travel to visit my friends in Amsterdam on April 2nd week ( I just got a holiday confirmed ) and also go to Munich and Barcelona for 10 days. I would be in Amsterdam for 6 days, 2 days in Barcelona and 2 days in Munich. There are no appointment dates available for either the Spanish consulate or the Netherlands consulate at San Fransisco until mid May. Can I apply the Schengan visa at the German consulate? Any other option which might enable me to go in mid April? Any ideas/suggestions are welcome. I can slightly modify my travel plans. I am an Indian citizen living in USA on a H1B visa.


I have a file 'abcd' in my current dir. Using find -regex '\.\/[a-d]\{4\}' gets me no results. While the regex works fine in emacs itself.  find, however, does find my file when I add -regextype posix-basic option to it.  Yet, the find manual specifies that find uses emacs regex by default. So why don't the quantifiers work?

I have been trying to create a find command string that will find all files that end with a number 1-99 but exclude all others.  e.g. I want to find myfile1 myfile99 but not myfile456 and not myfilebackup  The regex I'm thinking of is myfile[1-9]{1,2} but I can't get this to work with find.  find . -regex '.*myfile[0-9]{1,2}' OR  find . -iname 'myfile[0-9]{1,2}'  From what I can see it's the {1,2} part that is not working.  (by the way can you use -name -regex interchangably?)  Any help appreciated.


I'm having a small alignment problem with Biblatex. I have my citations in a separate file and am referencing them as normal. However, I want them horizontally shifted to the right to align with the rest of my text, namely, the numbers should be aligned with the green vertical line (apologies for the bad image):  Here is my code: \documentclass[11pt]{moderncv}  \moderncvstyle{classic} \moderncvcolor{red}  %%%% adjust the page margins \usepackage[scale=0.78, top=0.5in, bottom=0.5in, footskip=0.2cm]{geometry} \usepackage{eurosym} \usepackage[T1]{fontenc} \usepackage[sc,osf]{mathpazo} \usepackage[maxnames=99, sorting=none]{biblatex} \usepackage[utf8]{inputenc}  \renewcommand*{\namefont}{\fontsize{20}{20}\mdseries\upshape} \addbibresource{publications.bib}  % personal data \name{Name}{Name} \phone[mobile]{111-111-1111}  \begin{document}  \makecvtitle{\vspace{-1.0cm}}  \section{Education} \cventry{2021 -- 2022}{Master of Science in Computer Science}{XXX}{XXX}{}{GPA: 4.0/4.0} \cventry{2018 -- 2021}{Bachelor of Science in Computer Science}{XXX}{XXX}{GPA: 3.99/4.0}{Summa Cum Laude\endgraf Accepted to Accelerated Bachelor's to Master's Program\endgraf Accepted to Disciplinary Honors Program} \cventry{2017 -- 2018}{Transfer Degree}{XXX}{XXX}{GPA: 4.0/4.0}{}  \section{Experience}  \nocite{*} \printbibliography[title={Research}]  \section{Interests}   \end{document}   I feel like this is a very silly and simple problem to fix, but I just can't figure it out. Any help would be greatly appreciated!

I wanted to use the moderncv class together with biblatex. To this end, I redefined the bibliography bibenvironment  \defbibenvironment{bibliography}{}{}% {\cvline{\printfield[labelnumberwidth]{labelnumber}}% {} }   The labels were adjusted correctly, but the text of the bib entry (unsurprisingly) started below the label, took the whole line and was not adjusted at all.  My question is if there is a neat solution for this, or if one must define a new BibliographyDriver as is done  here  or even resort to some low level hackery as in this answer ? If so, what do I have to do?


I was working on a script to set up a project-specific environment.  I created a script to set up the directory stack as suggested in the first comment to .  Console output provided evidence that the stack was being created as designed, but as the script completed, the stack did not exist when I was returned to the console. I suspect that this is a design feature to allow the script writer an independent environment, and that this touches on a question of broader scope concerning how the environment is handled inside and outside of a script.  What is going on and where can I learn more?

I want to run a script to simply change the current working directory:  #!/bin/bash cd web/www/project   But, after I run it, the current pwd remains unchanged! How can I do that?


My daughter's iPad has a cracked screen and is being replaced by Apple under AppleCare Plus. I have backed up the iPad Mini to iTunes and I planned on restoring the new iPad from this backup. However I am told that the Minecraft worlds she worked so hard on to create will not be restored this way. I need to know how to save those worlds in iTunes backup so it restores to the new iPad. Clear instruction would be highly appreciated.

My daughter has built a minecraft world on our iPad. As of Christmas 2013 she has an iPad mini of her own. Is there any way to transfer her world from the old machine?   Even better...is there any way to synchronise the 2 machines?


I cannot open gnome-software. Here is the error message:  $ gnome-software (gnome-software:3824): Gs-WARNING **: failed to open plugin /usr/lib/gs-plugins-9/libgs_plugin_xdg_app_reviews.so:  /usr/lib/gs-plugins-9/libgs_plugin_xdg_app_reviews.so: cannot open shared object file: No such file or directory       I have been grappling with this for some time. I have tried reinstalling and that didn't work. The file shows in my directory in red, I search through the properties and it says that it is broken/missing. I opened it in gedit, and it opened up blank. So after all of that I deleted it figuring updating and upgrading might be the solution. It was not. Now I would like to do one of two things:   reinstall gs-plugins without breaking the rest of my system just install the missing file in gs-plugins (can't find it)   Or is there an alternative that I am not aware of? Could someone with more experience give me some guidance on how to carry out one of those two options or how I should go about solving the problem? Thank you.

Ubuntu Software instantly crashes as I try to open it. Tried to access from terminal and gives the following error:  (ubuntu-software:5523): Gs-WARNING **: failed to open plugin /usr/lib/gs-plugins-9/libgs_plugin_xdg_app_reviews.so: /usr/lib/gs-plugins-9/libgs_plugin_xdg_app_reviews.so: cannot open shared object file: No such file or directory


I've got a background in my custom template which I'd like to be able to switch off for certain slides.  Ideally I'd do this with an option to \begin{frame}.  My template is very loosely based on the approach in .  I've seen  and ; what I'm looking for is essentially the reverse of the latter, but cleanly (if I get this template right I won't be the only one using it so I wan't it to be robust).  This ends up being quite a lot of code just for an MWE.  The most relevant bit is probably first, in beaminnerthemecf.sty:  \mode<presentation>  \setbeamertemplate{background}{ \begin{tikzpicture}   \useasboundingbox[inner sep=0] (0,0) rectangle(\paperwidth,\paperheight);   \node[anchor=north,opacity=0.25] (bkg) at (current page.north) {\includegraphics[width=\paperwidth,height=\paperheight]{example-image-a}};   \fill[color=red,anchor=north west] (0,\the\paperheight) rectangle(\the\paperwidth,0.85\paperheight);   \node[anchor= south east, red,align=right] at (0.975\paperwidth,0.025\paperheight){\normalsize\insertauthor\\[0.2em]\normalsize\insertdate};     \ifnum\thepage>1\relax%     \ifx\insertframesubtitle\@empty%       {\node[anchor=north west, white,font=\Large] at (0.025\paperwidth,0.975\paperheight){\insertframetitle};}       \else{%         \node[anchor=north west, white,font=\Large] at (0.025\paperwidth,0.985\paperheight){\insertframetitle};%         \node[anchor=north west, white,font=\large] at (0.025\paperwidth,0.925\paperheight){\insertframesubtitle};%       }%      \fi    \fi   \end{tikzpicture} }  % Title page \defbeamertemplate*{title page}{cf}[1][]{%     \begin{tikzpicture}[overlay, remember picture, shift={(current page.south west)}]         \useasboundingbox (current page.south west) rectangle(\paperwidth,\paperheight);         \node[anchor=center, red,inner sep=0,align=center,text width=0.8\paperwidth] at (0.5\paperwidth,0.5\paperheight){\inserttitle};     \end{tikzpicture} } % Items \setbeamertemplate{items}[square] \setbeamertemplate{sections/subsections in toc}[square] \mode<all>   to test it we can compile dummy.tex:  \documentclass{beamer} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \title{\Large{\textbf{There Is No Largest Prime Number}}} \date[ISPN ’80]{27th International Symposium of Prime Numbers} \author[Euclid]{Euclid of Alexandria \texttt{euclid@alexandria.edu}} \usetheme{cf}  \begin{document}  \begin{frame} \titlepage \end{frame}  \begin{frame} % This is where I'd like to turn off the background image \frametitle{There Is No Largest Prime Number}  \framesubtitle{The proof uses \textit{reductio ad absurdum}.}  This is a test \begin{enumerate} \item Suppose $p$ were the largest prime number.  \item Let $q$ be the product of the first $p$ numbers.  \item Then $q+1$ is not divisible by any of them.  \item But $q + 1$ is greater than $1$, thus divisible by some prime number not in the first $p$ numbers. \end{enumerate} \end{frame}  \end{document}   Also needed are beamerouterthemecf.sty:  \mode<presentation> % Frame title \defbeamertemplate*{frametitle}{cf}[1][]{ } \mode<all>   and beamercolorthemecf.sty:  \mode<presentation> % Settings \setbeamercolor*{title page header}{fg=white} \setbeamercolor*{author}{fg=white} \setbeamercolor*{date}{fg=white} \setbeamercolor*{item}{fg=red} \setbeamercolor*{normal text}{fg=black} \mode<all>

I am working on a beamer template which tries to mimick an existing .ppt-template from my institute. My problem now is, that the beamer template should be able to have frames with different styles for the headline within a single presentation. (do not ask why this would be necessary, I do not know)  After having a look into beamerbaseframe.sty and playing a bit with frame options, I came up with the following code  \documentclass{beamer}  \usetheme{mytheme}  \begin{document}      \begin{frame}         left     \end{frame}       \begin{frame}[rightslide]         right     \end{frame}       \begin{frame}         should be left again :(     \end{frame}       \end{document}   using beamerthememytheme.sty  \setbeamertemplate{headline}{%     \rule{.5\paperwidth}{14mm} }  \define@key{beamerframe}{rightslide}[true]{%     \setbeamertemplate{headline}{\hfill\rule{.5\paperwidth}{14mm}}% }   So the question is now: how can I revert to the default headline after the slide with the option rightslide?


I am working on an eCommerce site, which wants to target the UK, US and Australia.  Due to their cultural variations in the English language, and the fact they all have their own currency, the website's Subdomains have been set up as follows:   www.example.com (Targeting US) en-gb.example.com (Targeting the UK) en-au.example.com (Targeting Australia)   I have placed the following hreflang attributes, within the <head> Tags of the above Sub domains:  <link rel="alternate" href="https://www.example.com" hreflang="en-us" /> <link rel="alternate" href="https://en-gb.example.com" hreflang="en-gb" /> <link rel="alternate" href="https://en-au.example.com" hreflang="en-au" />   After continued research, I can see that it is advisable to implement a 'catch-all' URL for the English language.  Therefore, a URL that does not target a specific region.  In my case, the URL would be:   en.example.com (Targets English speakers outside of the UK, US and Australia)   Given that en.example.com would either adopt GBP, USD or Aus Dollars, there is a risk that search engines may see this as duplicate content with one of the above Subdomains.  With this in mind, should additional modifications be integrated, such as the use of Canonical links etc?

This is a general, community wiki question regarding duplicate content.  If your question was closed as a duplicate of this question and you feel that the information provided here does not provide a sufficient answer, please open a discussion on .     What does Google consider to be duplicate content? Will the way I am presenting my content result in a duplicate content penalty? How can I avoid having my site's content treated as duplicate content?


Show that series $$\sum_{n=2}^{\infty} \frac{1}{(\log(n))^{\log(\log(n))}}$$ is divergent . What inequality can we use here. i tried various method but none of these give any result. Any hint please .

Does the following series converge:  $$\sum_{n=3}^\infty \frac {1}{(\log n)^{\log(\log(n)}}$$  I've tried all test I know... Any ideas ?


I have an answer on SO like this  1. step  Some text  2. step   Problem it looks like this        step         Some text         step      Why is it making 2 appear as 1?  Link   What am I doning wrong here?

Oftentimes, I want to include code samples in a list, for example:   Item One Item Two, for example: private bool ItemTwo() {     return this.IFeelLucky; } Item Three   The problem is that there isn't a good and intuitive way to do this using . It's doable, but you have to do some formatting black-magic to get it that way, which is just not "nice" to deal with.  Source that produces this:  1. Item One 2. Item Two, for example:

private bool ItemTwo()     {         return this.IFeelLucky;     }
 3. Item Three    I would love to just be able to do it this way:  1. Item One 2. Item Two, for example:      private bool Test()     {         return this.IFeelLucky;     }  3. Item Three  Which results in, well, this:   Item One Item Two, for example:  private bool Test() {     return this.IFeelLucky; } Item Three


I have a form that allow users to upload files, I however need to get the file extension, which I am able to get, but not sure if I'm using the most effective solution  I can get it using the following ways  $fileInfo = pathinfo($_FILES['File']['name']); echo $fileInfo['extension'];  $ext = end(explode('.',$_FILES['File']['name'])); echo $ext;   Which method is the best to use or are there even better solutions that would get the extension?

This is a question you can read everywhere on the web with various answers:  $ext = end(explode('.', $filename)); $ext = substr(strrchr($filename, '.'), 1); $ext = substr($filename, strrpos($filename, '.') + 1); $ext = preg_replace('/^.*\.([^.]+)$/D', '$1', $filename);  $exts = split("[/\\.]", $filename); $n    = count($exts)-1; $ext  = $exts[$n];   etc.  However, there is always "the best way" and it should be on Stack Overflow.


Is there a jquery/javascript code equivalent to this php one? I want to generate a unique 32 character token.  $token = md5(uniqid($customerId))

I'm trying to create globally-unique identifiers in JavaScript.  I'm not sure what routines are available on all browsers, how "random" and seeded the built-in random number generator is, etc. The GUID / UUID should be at least 32 characters and should stay in the ASCII range to avoid trouble when passing them around.


I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3  The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]]    Then I changed one of the innermost values: my_list[0][0] = 5  Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]]    which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?


Show that $P_n$ = {polynomials with real coefficients of degree $\leq$ n} is an ($n+1$)-dimensional subspace of the infinite-dimensional vector space of all real polynomials   I know that $P_n$ is referring to $a_nx^n + a_{n-1}x^{n-1}+...+a_1x+a_0$  Also, I understand why the vector space of all real polynomials is infinite-dimensional (I have proved this by contradiction)  But I need help understanding why $P_n$ is an $(n+1)$-dimensional subspace of it  I realize this question has already been asked here , but that question was marked off topic and most of the answers are giving the asker advice on how to better ask his question and thus I am asking again.

Show that $P_n = \{$Polynomials with real coefficients of degree $≤ n\}$ is an $(n+1)$-dimensional subspace of the infinite-dimensional vector space of all real polynomials.


Today, for a great oversight, did a deal with a big mistake, which I forgot to put the WHERE keyword in the UPDATE statement... I searched in the google, I found a lot of things of how to restore the database ( FROM BACKUP ), but the backup was done daily database simply disappeared :(  Now, the only information I have remaining is the log file of SQL, I found the ApexSQL log, that program make a SQL undo script, but, just for a 10th process... I have 2024 to restore, and, I don't want to pay U$ 1.5k for this program, now, I want to know, how I can restore the informations, have a FREE program to make this ?

I mistakenly deleted around 2,000,000 records from a remote SQL Server 2008 table.  The server is not granting me access to the backup files on the server side.   Is there any way to get back these records?


Tiny yet strange issue:    In the list of files/folders, notepad++ running in Wine completely ignores the last character. Other than that it works perfectly under Wine, so this is very strange to me. Also a quick google didn't yield any other people with this issue...  It started to get really annoying in a folder where all my html files have a number in the name, at the end.  Versions:   Notepad++: v5.9.3.  (downloaded from the official website, followed an irretrievable guide to install) Wine: 1.2.2.

I am looking for a step by step instruction to guide me in the ways of installing, configuring and debugging many of the issues new users have when dealing with Wine in Ubuntu.  What is the recommended way of installing Wine, some of the key issues that it has and how to solve them?  If I have a specific problem with an App in Wine, how do I go about solving it? What are the recommended steps to ensure that I can fix a problem related to an app I wish to use?


Let $\pi$ be a group and $K(\pi,1)$ be the associated Eilenberg-MacLane space (it has a contractible universal cover). I have proved the following isomorphism for the the chain complex with local coefficients in some abelian group $A$ with trivial right $\pi$-action:  $$C_*(K(\pi,1);A)\cong A\otimes_{\mathbf Z[\pi]}C_*(\widetilde{K(\pi,1)})$$  I wish to conclude that  $$H_*(K(\pi,1);A)\cong\operatorname{Tor}_*^{\mathbf Z[\pi]}(A,\mathbf Z).$$  I know that the group homology of $\pi$ comes from $\mathbf Z\otimes_{\mathbf Z[\pi]}A$ in some way and I feel like the fact that the universal cover of the space being contractible should allow me to conclude something along similar lines, but I have no good reference for this material and am still fuzzy on how $\operatorname{Tor}$ would work here. I think I basically just want to compute the homology of the chain complex $A\otimes_{\mathbf Z[\pi]}C_*(\widetilde{K(\pi,1)})$ (without using Künneth), but I am confused about how this would work and I'd really appreciate any help.

Let $\pi$ be a group and let $K(\pi, 1)$ be a connected CW complex such that $\pi_1(K(\pi, 1)) = \pi$ and $\pi_q(K(\pi, 1)) = 0$ for $q \neq 1$. Does there exist an isomorphism between $H_*(K(\pi, 1); A)$ and $\text{Tor}_*^{\mathbb{Z}[\pi]}(A, \mathbb{Z})$?


I am looking for an elegant way to run unit tests on multiple data, in this case a directory containing text files .  Consider a folder text containing several txt files, I want run this example unittest on each file ( for example by feeding a list of files from glob to my unittest )  Here is how I test a single hardcoded file .  import unittest import parser  class TestParser(unittest.TestCase):     text_path = 'text/journal.txt'      def test_get_chapters(self):         x = parser.get_chapters(self.text_path)         self.assertGreater(len(x),1))  if __name__ = "__main__":     unittest.main()    Thanks !!

I have some kind of test data and want to create a unit test for each item. My first idea was to do it like this: import unittest  l = [["foo", "a", "a",], ["bar", "a", "b"], ["lee", "b", "b"]]  class TestSequence(unittest.TestCase):     def testsample(self):         for name, a,b in l:             print "test", name             self.assertEqual(a,b)  if __name__ == '__main__':     unittest.main()  The downside of this is that it handles all data in one test. I would like to generate one test for each item on the fly. Any suggestions?