I downloaded Ubuntu from the Microsoft Store and I have installed it. I tried downloading gedit using  $ sudo apt install gedit   I got this problem:    How do I resolve this problem?  EDIT: Attempts to resolve the problem  Attempt 1: I used sudo after suggestion and it didn't work.
I get this error whenever I try to install programs using the terminal:  home@ubuntu:~$ apt-get install myunity 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?   Also I'm unable to install updates using the terminal.
Note: I cannot specificly tell which version of which of the two conflicting packages fixed the issue, but as of 2016 mathpec and polyglossia no longer show the issue.   Basically, I have encountered the same error as  and the workaround suggested by Andrey Vihrov reenables me to compile the document. The problem now is, that any shorthand defined by the ngerman-package (most notably the non-breaking hypen "~) has now been disabled, and I see combinations of american style closing quotes followed by a non-break space where a non-breaking hyphen should be.  Is there any way possible of keeping the shorthand definition, or redefining it to something else (something like \nbhy pops up to mind)?  I am using XeLaTeX as supplied by TeXLive. chown -R root.root / So I was working and there was a directory that I was periodically changing to my user in  a root terminal so that I could open the files in text editors, but I accidentally pressed / instead of . and this was the command I put out:  chown -R emil.emil /   Then immediately panicked ^C and put in another command, as I thought I could always change back the files I needed to access:  chown -R root.root /   So now I can't do su from emil to even try to fix this, as I'm getting permission denied error. I'm on Ubuntu could someone tell me if there is a way I could fix this, without absolutely reinstalling the whole thing.  TIP  If you are trying to get root access, and are getting this permission denied error when using su try this command:  gksu gnome-terminal   It will prompt you for the root password and open a new root terminal for some reason this works and gives me root access, when su doesn't. How to proof the the derivative of $x^2$ is $2x$? What overpowered combinations would be available if I allow a bonus action to be used in place of a standard action? It has come up in game a couple of times that a player might want to cast a spell that has a casting time of 1 bonus action using their "main" action (if they have another bonus action they also want to take on that turn, such as giving bardic inspiration, or controlling a Bigby's hand, etc.)  On the face of it, it seems obvious that something (a bonus action) that is usually much faster than a full action could be done as your full action.  Although the question comes up most often with respect to spellcasting, if I house rule this, I would rule that any bonus action can be taken as a regular action instead; however, I would not allow the same type of bonus action to be taken twice (so no giving bardic inspiration to two allies on the same turn, for instance).   Are there any abusive or overpowered combinations I should be wary of if I were to allow a character to take 2 bonus actions instead of one regular action and one bonus action on a turn?   The issue of casting two bonus-action spells would not come up because the rule against casting 2 spells on your turn unless one of them is a cantrip with a casting time of 1 action would still be in effect:  PHB p. 203 (under Bonus Action casting time)     You can't cast another spell during the same turn, except for a cantrip with a casting time of 1 action.   I know it's hard to prove/justify a negative answer to a question like this, but I'd be happy to get answers that say you don't think there would be any issues if you describe how you came to that conclusion. Showing a tensor is not a simple tensor Let $(e_1,e_2)$ be the standard basis of $\mathbb{R}^2$. Why can the element $e_1\otimes e_2 + e_2\otimes e_1$ in $ \mathbb{R}^2\otimes_{\mathbb{R}} \mathbb{R}^2 $ not be written as a simple tensor $v\otimes w$ for $v,w\in \mathbb{R}^2$?  If we suppose $e_1\otimes e_2 + e_2\otimes e_1=v\otimes w$, then can we conclude that $e_1=\lambda e_2$ for some $\lambda \in \mathbb{R}$? This would give a contradiction since $e_1$ and $e_2$ are linearly independent. However, I am not sure if the argument is valid. Where do executables look for shared objects at runtime? I understand how to define include shared objects at linking/compile time. However, I still wonder how do executables look for the shared object (*.so libraries) at execution time.  For instance, my app a.out calls functions defined in the lib.so library. After compiling, I move lib.so to a new directory in my $HOME.  How can I tell a.out to go look for it there? Suppose I have a paper with the following text:     Roses are red, violets are blue, sugar is sweet, and so are you [3],[4].   As one can see, the author got the information from two other references. If I want to add this information in my thesis, do I also have to reference [3] and [4] or can I just reference this particular paper, I got the information from? Where does Minecraft for Windows 10 store its data? I have searched in %appdata%, pulling up the list of files there, but there is no file labelled .minecraft. Searching %appdata%\.minecraft returns "no results found".   I also opened Minecraft to click on the resources button and could not locate that either. Para 5, , by      If the Lord would show thee but this one   thing, -- that to use "thee" and "thou" to a particular person is   proper language, and Scripture language; and that to say "you," is   improper, and arose from pride, and nourisheth pride, and so is of the   world, and not of the Father; and thou should bow thy spirit to him in   this one thing, thou little thinkest what a work it would make within thee, and how strongly the spirit of darkness would fight against thy   subjection thereto. The Lord lead thee as he seeth good, and give thee   faithfully to follow; for else, if the Lord should lead in any thing,   and thou not follow in that thing, his Spirit would be grieved and   vexed thereby, and thy heart in danger of being hardened by the   deceitfulness of sin.   What is the Lord giving thee faithfully to follow?   The grey claims that the reader thinks little of the significance of stressing 'thee' and 'thou' over 'you'. So I'd guess that the Lord is giving 'thee' this caution? If I'm right, why is there no direct object in the bolded? I recognise grammatical differences in the 1600s, but still want to learn. Get lists of dependent picklist options in Apex I have a pair of dependent picklists.  In Apex code, how can I determine what options are valid in the dependent field for each option in the controlling field?  I've tried using getPicklistValues(), but there doesn't seem to be any way of getting dependency information.  Example  Controlling_Field__c  Fruit, Vegetable, Dairy  Dependent_Field__c  (Fruit): Apple, Banana, Pear  (Vegetable): Tomato, Egglant, Lettuce  (Dairy): Milk, Cheese, Yogurt  What I'm Looking For  (In pseudocode, something like:)  controllingOptions = dependentfield.getPicklistValues(); for (option : controllingOptions) {     dependentOptions = dependentfield.getPicklistValuesFor(option);     do_something_with_it(); } How do they compute the Gold and Elixir that can be looted? How do they compute the Gold and Elixir that can be looted from a base? Is it 100% of the remaining? or the total (including the uncollected from mine)? Badges loading broken in election statistics We have an  and I noticed the badges are not loading in the election statistics like they should be. It just hangs forever loading badge information:    Unfortunately I blew off reporting this for a couple days figuring it would resolve itself, but it doesn't seem to be a temporary problem. In GKP's Concrete Mathematics, there is a useful and interesting feature I would like to see in more books. The bibliography entries include:   a - the page numbers where the book or article is cited in the document. b - a few lines of review of the cited work.   It is a kind of mix between bibliography, index and review.  Are there stable LaTeX packages/BibTeX styles to do (a) and (b) ?  EDIT: I wrote (b) initially as "comments about the work cited". It could be understood as "gathering comments made in the book about the work and reproducing them in the bibliography".  This is not what I meant but this could be something useful for others. Upgrading my Wubi 11.04 to 11.10 I want to upgrade my current Wubi installation (Ubuntu 11.04) to Ubuntu 11.10. Is this possible to do inside Wubi? Or do I have delete Wubi from Windows, therefore deleting my current Ubuntu installation; and then install 11.10 via the Wubi installer?  Thanks How would I find the period of an oscillator with the following force equation?  $$F(x)=-cx^3$$  I've already found the potential energy equation by integrating over distance:  $$U(x)={cx^4 \over 4}.$$  Now I have to find a function for the period (in terms of $A$, the amplitude, $m$, and $c$), but I'm stuck on how to approach the problem. I can set up a differential equation:  $$m{d^2x(t) \over dt^2}=-cx^3,$$  $$d^2x(t)=-{cx^3 \over m}dt^2.$$  But I am not sure how to solve this. Wolfram Alpha gives a particularly nasty solution involving the hypergeometric function, so I don't think the solution involves differential equations. But I don't have any other leads.  How would I find the period $T$ of this oscillator? In statistical learning, implicitly or explicitly, one always assumes that the training set $\mathcal{D} = \{ \bf {X}, \bf{y} \}$ is composed of $N$ input/response tuples $({\bf{X}}_i,y_i)$ that are independently drawn from the same joint distribution $\mathbb{P}({\bf{X}},y)$ with  $$ p({\bf{X}},y) = p( y \vert {\bf{X}}) p({\bf{X}}) $$  and $p( y \vert {\bf{X}})$ the relationship we are trying to capture through a particular learning algorithm. Mathematically, this i.i.d. assumption writes:  \begin{gather} ({\bf{X}}_i,y_i) \sim \mathbb{P}({\bf{X}},y), \forall i=1,...,N \\ ({\bf{X}}_i,y_i) \text{ independent of } ({\bf{X}}_j,y_j), \forall i \ne j \in \{1,...,N\} \end{gather}  I think we can all agree that this assumption is rarely satisfied in practice, see this related  and the wise comments of @Glen_b and @Luca.  My question is therefore:      Where exactly does the i.i.d. assumption becomes critical in practice?    [Context]   I'm asking this because I can think of many situations where such a stringent assumption is not needed to train a certain model (e.g. linear regression methods), or at least one can work around the i.i.d. assumption and obtain robust results. Actually the results will usually stay the same, it is rather the inferences that one can draw that will change (e.g. heteroskedasticity and autocorrelation consistent HAC estimators in linear regression: the idea is to re-use the good old OLS regression weights but to adapt the finite-sample behaviour of the OLS estimator to account for the violation of the Gauss-Markov assumptions).   My guess is therefore that the i.i.d. assumption is required not to be able to train a particular learning algorithm, but rather to guarantee that techniques such as cross-validation can indeed be used to infer a reliable measure of the model's capability of generalising well, which is the only thing we are interested in at the end of the day in statistical learning because it shows that we can indeed learn from the data. Intuitively, I can indeed understand that using cross-validation on dependent data could be optimistically biased (as illustrated/explained in ).   For me i.i.d. has thus nothing to do with training a particular model but everything to do with that model's generalisability. This seems to agree with a paper I found by Huan Xu et al, see "Robustness and Generalizability for Markovian Samples" .   Would you agree with that?  [Example]   If this can help the discussion, consider the problem of using the LASSO algorithm to perform a smart selection amongst $P$ features given $N$ training samples $({\bf{X}}_i,y_i)$ with $\forall i=1,...,N$ $$ {\bf{X}}_i=[X_{i1},...,X_{iP}] $$ We can further assume that:   The inputs ${\bf{X}}_i$ are dependent hence leading to a violation of the i.i.d. assumption (e.g. for each feature $j=1,..,P$ we observe a $N$ point time series, hence introducing temporal auto-correlation) The conditional responses $y_i \vert {\bf{X}}_i$ are independent. We have $P \gg N$.    In what way(s) does the violation of the i.i.d. assumption can pose problem in that case assuming we plan to determine the LASSO penalisation coefficient $\lambda$ using a cross-validation approach (on the full data set) + use a nested cross-validation to get a feel for the generalisation error of this learning strategy (we can leave the discussion concerning the inherent pros/cons of the LASSO aside, except if it is useful). I'm using an API that requires me to pass a function pointer as a callback. I'm trying to use this API from my class but I'm getting compilation errors.   Here is what I did from my constructor:  m_cRedundencyManager-&gt;Init(this-&gt;RedundencyManagerCallBack);   This doesn't compile - I get the following error:      Error  8 error C3867: 'CLoggersInfra::RedundencyManagerCallBack': function call missing argument list; use '&amp;CLoggersInfra::RedundencyManagerCallBack' to create a pointer to member   I tried the suggestion to use &amp;CLoggersInfra::RedundencyManagerCallBack - didn't work for me.   Any suggestions/explanation for this??  I'm using VS2008.  Thanks!! Does anyone know how to model a depletion mode N channel MOSFET in spice?  I have looked online however the majority of resources have shown how to model a depletion type or enhancement type. I specifically want to model a FET that is fully on when there is a 0 Vgs voltage.  Resources i've looked at I am trying to create a stacked bar chart above a table, basically identical to the one below.    I have found similar posts such as:   However, my experience is very limited to simple tables and I am struggling to modify this to suit my needs.  Any ideas on how I can achieve such a graph?  Thanks! How does Ethernet know how long a frame is?