The most common occurrence of this is as a kid: perhaps you misplaced your pencil or it rolled to the floor while you were preoccupied. The first feeling is that one of your classmates must've grabbed it.  This seems to bleed into adulthood for some folks as well, a knee jerk response to irrationally attribute a problem to a nearby human they don't like.  Is there a noun or adjective to describe this? Hopefully one that is pejorative in nature, but that's definitely not requisite.

What is a single word to describe a person who is quick to blame others or the system in almost any situation, regardless of whether that is legitimate or not?


I am trying to get my code to keep repeating asking if I want to end my code while "input" is y, but whenever I press y to continue it ends. I am not sure what I am doing wrong here. Is  my logic off?  import java.util.*;  public class InputValidation {    public static void main(String []args) {       String input = "y";       while (input == "y") {          Scanner console = new Scanner(System.in);          System.out.print("Press \"y\" to continue, anything else to end ");          input = console.next();       }    } }

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?


$('#test').click(function () {   $('body').append($('<button>').prop('id', 'demo').text('Click me')) });  $('#demo').click(function () {   alert('Hello world!') }) <script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script> <button id="test">Append</button>     I've checked in Console log, no error was found. I think something may be: Element with id demo does not exist, so no message would throw when clicking on it.  Is there any way to set new element (created by jQuery syntax) detects the event (onclick)?  I don't want to use this way:  var btnClick = function () {   alert('Hello world!') };  $('#test').click(function () {   $('body').append($('<button>').prop('id', 'demo')                                 .attr('onclick', 'btnClick()').text('Click me')) });

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


What is the non-retina/retina resolution of iPhone5 in pixels. (Double or half of 640px x 1136px screen size)?  Is the retina 640px x 1136px or is that the non-retina?

I could not find a complete guide of this nor did I know who to contact about possibly making a wiki here for it (if it exists or not allowed please remove).  I cannot nor want to remember everything in regards to pixel dimensions when designing for mobile devices but I'd like to have a list of the pixel dimensions for:  Device                                  Width   Height  Apple iPad Apple iPhone 3 Apple iPhone 4 Apple iPhone 5 Apple Mini Google Nexus 7  Asus Transformer Pad Infinity TF700 Google Nexus 10 Asus Transformer Pad TF300 Samsung Galaxy Note 10.1   If someone knows a complete guide for all major tablet and mobile devices that would be great.


So i was watching this video and at 18:14 he has an example showcasing closures in the programming language "Groovy".   Can JavaScript "save" instances in the same way using closures and if so, could somebody wrap up a little codesample for me to study? I've been reading up on closures in JavaScript and essentially i know that if you have a function within a function and the outer function returns the inner function can be kept alive and that's part of what a closure is.  def makeCounter() {     def very_local_variable = 0     return { very_local_variable += 1 } }  c1 = makeCounter() c1() c1() c1()  c2 = makeCounter()  println "C1 = ${c1()}, C2 = ${c2()}"  OUTPUT and closures: C1 = 4, C2 = 1

How would you explain JavaScript closures to someone with a knowledge of the concepts they consist of (for example functions, variables and the like), but does not understand closures themselves?  I have seen  given on Wikipedia, but unfortunately it did not help.


I would like to see a Persian/Farsi language site included within the Stack Exchange world. How likely is this? Is it already being considered?

I have an idea or subject that should have a Q&A, and want to propose a new site. How can I do this?  Related:


I was trying to download Tails on a USB stick and as always, you have to download the file (in this case a .img), but then I was told that I had to use software to make it work (I was recommended to use UNeBootin). This is where I am confused. Why do I actually need it? And can I download tails without it?

Is there any software like unetbootin in Ubuntu?  I cant install or run unetbootin-494 even though I already set it to allow executing files as programs.


I have created a regular expression for email validations. var regex = "^([a-zA-Z]+([\.-_]?[a-zA-z0-9]+)*)\@([a-zA-Z0-9]+)([-][0-9a-z]+)?\.([a-z-]{2,20})(\.[a-z]{2,3})?$" To match emails: 1. update@update  2. mohit.bhagat@B-9com.com 3. mohit.Bhagat@us.thalesgroup.com 4. mohit@gmail.com.com.com  If you run this over online  1 and 4th will fail while 2, 3 will pass. But when I run this code in Javascript( Browser console ), 1st also passes the validation. I am using Angular application.

Over the years I have slowly developed a  that validates MOST email addresses correctly, assuming they don't use an IP address as the server part.  I use it in several PHP programs, and it works most of the time.  However, from time to time I get contacted by someone that is having trouble with a site that uses it, and I end up having to make some adjustment (most recently I realized that I wasn't allowing 4-character TLDs).  What is the best regular expression you have or have seen for validating emails?  I've seen several solutions that use functions that use several shorter expressions, but I'd rather have one long complex expression in a simple function instead of several short expression in a more complex function.


I'm trying to calculate  $$\lim_{x \rightarrow 0}\left(\frac{1}{\sin^2(x)} -\frac{1}{x^2}\right)$$  but I'm having the problem of getting   $$\infty - \infty$$  which I read to be indeterminate.  I cannot figure out how could I manipulate the above to get rid of the indeterminacy.

The limit is $$\lim_{x\to0}\left(\frac{1}{\sin^2x}-\frac{1}{x^2}\right)$$ which I'm aware can be rearranged to obtain the indeterminate $\dfrac{0}{0}$, but in an attempt to avoid L'Hopital's rule (just for fun) I tried using the fact that $\sin x\approx x$ near $x=0$. However, the actual limit is $\dfrac{1}{3}$, not $0$.  In this , the approximation reasoning works out.


I am reading Tu's book on Manifolds. As I understand it, given a point $p$ of a manifold $M$ we have the basis $\{\frac{\partial}{\partial x^i}|_p\}$ for $T_pM$, where $(U,x^1,...,x^m)$ is a chart around $p$. Now, if I prove that $\{ dx^i(p) \}$ is a basis for $T^\ast_p M$, then it shouldn't be too hard to show that $\{ dx^{i_1}(p)\wedge ... \wedge dx^{i_k}(p) \}$ is a basis for $ \bigwedge^k T^*_pM  $.  Now, I think that all I need to do to prove that $\{ dx^i(p) \}$ is a basis for $T^\ast_p M$ is to show that $dx^i(p)(\frac{\partial}{\partial x^j}|_p)=\delta^i_j$.   Let $f\in C^\infty(\mathbb{R})$. We have  $$ dx^i(p)(\frac{\partial}{\partial x^j}|_p)(f) =\frac{\partial}{\partial x^j}|_p(f\circ x^i) $$ and this does not seem to be $\delta^i_jf$.

The derivative of a map $F$ between manifolds $M$ and $N$ is defined by $$F_*X(f)= X(f \circ F)$$ where $X \in T_P(M)$, the tanget space at the point $P$.  We know that $$\left\{\frac{\partial}{\partial x^i}\bigg|_P\right\}_i$$ is a basis for $T_P(M)$. How to show that $$\left\{dx^i\bigg|_P\right\}_i$$ is a basis for the cotangent space $(T_P(M))^*$?  First, by $dx^i$, I guess we mean the derivative of the map $x^i$ as defined above, right? Is this map $x^i$ just picking out the ith coordinate? Secondly, to show that it is a basis, we need to show that $dx^i\left(\frac{\partial}{\partial x^j}\bigg|_P\right) = \delta^i_j.$ Where to go from here: $$\underbrace{(dx^i)_P}_{(\Phi_*)_P}\underbrace{\left(\frac{\partial}{\partial x^j}\bigg|_P\right)}_{X}f = \left(\frac{\partial}{\partial x^j}\bigg|_P\right)(f\circ x^i)?$$  I can use the chain rule but I am not sure exactly. Please help.


Find the interval of convergence for $\sum_{k=0}^{\infty}\frac{x^k}{k!}$.  I tried using the ratio test to find the radius of convergence.  \begin{align} \lim_{k\to\infty}\dfrac{\left|\frac{x^{k+1}}{(k+1)!}\right|}{\left|\frac{x^k}{k!}\right|} &= \lim_{k\to\infty}\left|\dfrac{x}{k+1}\right| =0 \end{align} Doesn't this tell us that we can choose any $x\in\mathbb{R}$ because $\lim_{k\to\infty}\left|\dfrac{x}{k+1}\right| =0$ for any $x$?

Suppose one is trying to find the radius of convergence of  $$ \exp(x)=\sum\limits_{k=0}^{\infty} \frac{x^k}{k!} $$  This "proof" was given in the lecture: $$ \begin{align} r =& \frac{1}{\limsup\limits_{n \rightarrow \infty}\sqrt [n]{|a_n|}} \\ =& \frac{1}{\limsup\limits_{n \rightarrow \infty}\sqrt [n]{\frac{1}{n!}}} \\ =&\lim\limits_{n \rightarrow \infty} \sqrt [n]{n!}\\ r=& \infty \end{align}$$  Other proofs involving the ratio test also seem to inspect the convergence of $\frac{1}{k!}$ instead of $\frac{x^k}{k!}$. Why is one allowed to substitute $\frac{1}{k!}$?


Now that Ruby 1.8.7 is , is it at all possible that the default ruby package in precise might be updated all the way up to 2.0?  I understand that backporting is generally not done with Ubuntu releases for concerns of breaking people, but in this case we're dealing with a deprecated package that might either already have security issues, or have more of them discovered in the future without any chance of them being fixed.  What's the plan? Will 12.04 march on with 1.8.7?

Has there been any news from the maintainers of Ubuntu packaging of Ruby as to whether they'll be releasing a package for Ruby 2.0? If so, have they indicated whether they'll be releasing any packages for Ruby 2.0 on 12.04?


Say I have a letter like this:  \documentclass{letter} \usepackage{hyperref} \signature{Joe Bloggs} \address{21 Bridge Street \\ Smallville \\ Dunwich DU3 4WE} \begin{document}  \begin{letter}{Director \\ Doe \& Co \\ 35 Anthony Road \\ Newport \\ Ipswich IP3 5RT} \opening{Dear Sir or Madam:}  I am writing to you on behalf of the Wikipedia project (http://www.wikipedia.org/), an endeavour to build a fully-fledged multilingual encyclopaedia in an entirely open manner, to ask for permission to use your copyrighted material.  % The \ldots command produces dots in a way that will not upset % the typesetting of the document. \ldots   That said, allow me to reiterate that your material will be used to the noble end of providing a free collection of knowledge for everyone; naturally enough, only if you agree. If that is the case, could you kindly fill in the attached form and post it back to me? We shall greatly appreciate it.  Thank you for your time and consideration.  I look forward to your reply.  \closing{Yours Faithfully,}  \ps  P.S. You can find the full text of GFDL license at \url{http://www.gnu.org/copyleft/fdl.html}.  \encl{Copyright permission form}  \end{letter} \end{document}   And say I have a list of clients like this:    How can I run a loop through my list of clients to produce letters and envelopes for each one so that each is addressed correctly?

I am looking for an example for using the  package to write a cover letter, with names and addresses on a spreadsheet. The package comes with an example, but you have to manually enter all the data.


I want points for practicing triangulation algorithms.  Just points with coordinates [X,Y] and elevation [Z] of real world terrain.  I can use Google Maps Elevation API, but there is no method how to get only significantly terrain points.

Is there any freely available pointcloud data?   I'm especially interested in dense clouds of small areas(5m to 100m radius) but anything else would be fine too.   I've found that these pages have very nice and easy to access point cloud data.


In the pie chart below, how can I move the percentage numbers out of the chart, and put them in the legend on the right, with the names? I'm using the  package.  \begin{figure}[H] \begin{tikzpicture} \centering \pie [text = legend] {25.75/Transformator , 12.59/aaaaaa,11.18/aaaaa,9.91/HV aaaaa, 9.10/aaaaaC, 7.99/aaaaa,7.47/aaa,5.74/aaaaaa4.95/aaaaa,4.19/aaaa680uf,1.06/aaaaaa}  \end{tikzpicture} \caption{pie chart.} \end{figure}

I would like to have the numbers that are inside the pie chart to be in the legend. How can I make that happen? Here is the MWE: \documentclass{article} \usepackage{pgf-pie} \usepackage{tikz} \usetikzlibrary{shadows}  \begin{document} \begin{tikzpicture} \pie[text=legend,style=drop shadow,radius=2]{51.3/Protestant, 23.9/Roman Catholic, 3.3/Other Christian, 1.7/Jewish, 0.7/Buddhist, 0.6/Muslim, 0.4/Hindu, 1.2/Other religions, 16.1/No religion } \end{tikzpicture} \end{document}  EDIT: I also have another pie chart, where the text is quite long. How can I set the width of the text so that it wraps around before the page ends? Here is what it looks like:  I forgot that PGF-PIE was not on CTAN. Here is a link to the google source:


When a champion holds the red buff he deals some damage to the enemy after he auto attacks him. What type of damage does red buff deals? Magic Damage? Attack Damage? Or none of those?

I know it is desired to get the blue buff for Ability Power (AP)-base champions and the red buff for Attack Damage (AD)-base champions and baron buff is good for everybody. I think blue buff at least increases your mana regeneration and red buff your health regeneration. So far I don't have any experience with maps (and therefore its buffs) other than Summoners Rift - I would like to know about these too.  What do the buffs affect in detail (preferring concrete numbers)?


I've drawn a ybar chart in pgfplots as below, and I want to add additional x-axis labels, as indicated by what I've drawn by hand in orange.    Question: How do I add additional x-axis labels to each bar in a ybar chart?  My current code is the following:  \documentclass[crop,margin=1mm]{standalone}  \usepackage{tikz} \usepackage{pgfplots} \pgfplotsset{compat=1.13}  \pgfplotstableread{ n  A  B  C C1 32 24 57 C2 34 35 12 C3 45 47 34 C4 10 20 30 }\mytable  \begin{document}  \begin{tikzpicture}  \begin{axis}[     ybar,     width=6in,     height=2.5in,     ymin=0,     ymax=100,     bar width=0.2cm,     ymajorgrids=true,     major grid style={dotted,black},     ylabel={y axis},     symbolic x coords={C1,C2,C3,C4},     xtick=data,     x tick label style={yshift=-0.5cm}   ]      \addplot table [x=n,y=A,draw=black,fill=blue!20] {\mytable};   \addplot table [x=n,y=B,draw=black,fill=blue!20] {\mytable};   \addplot table [x=n,y=C,draw=black,fill=blue!20] {\mytable};  \end{axis}  \end{tikzpicture}  \end{document}   Importantly, the labels A, B, and C repeat (they usually occur in a legend, when they're not repeated).  I attempted to use nodes near coords={A}, but putting it inside the axis[ .. ] puts an A above every bar, and putting it inside the table[ .. ] does nothing.  The labels are from the header (namely the line n  A  B  C) within \pgfplotstableread{ ... }.

I'm showing several data sets next to each other using multiple \addplot commands within a pgfplots axis environment. These are then further grouped into categories. The output of the graph per se is fine, however, I need each bar to be labelled separately - basically, I want the legend to be displayed directly underneath its corresponding element. I presume a picture will illustrate my problem more clearly:     I prepared an MWE:  \documentclass{minimal} \usepackage{pgfplots}  \begin{document}  \pgfplotstableread{ 0 35569 8842    134984   1 30428 4689    34077 2 32920 6207    73787    3 16462 7562    23496    4 12315 8572    16565    5 76572 19572   26030    }\dataset \begin{tikzpicture} \begin{axis}[ybar,         width=.9\textwidth,         ymin=0,         ymax=150000,                 ylabel={Y-Label},         xtick=data,         xticklabels = {             Category 1,             Category 2,             Category 3,             Category 4,             Category 5,             Category 6         },         major x tick style = {opacity=0},         minor x tick num = 1,         minor tick length=2ex,         ] \addplot[draw=black,fill=black!20] table[x index=0,y index=1] \dataset; %Data1 \addplot[draw=black,fill=black!40] table[x index=0,y index=2] \dataset; %Data2 \addplot[draw=black,fill=black!60] table[x index=0,y index=3] \dataset; %Data3 \legend{Data1,Data2,Data3} \end{axis}  \end{tikzpicture}  \end{document}


I have enough reputation that my edits are immediately applied. Sometimes I still feel that they should be peer reviewed, just because I'm not completely sure that my edit was correct. On these situations just leaving a comment isn't usually an appropriate solution, because edits are so major that just leaving comment won't get the problem solved.  Can I somehow ask my edits to get peer reviewed?  If not, could this feature be added?  Note: While that situation is fairly common in codegolf.SE, I'm not really sure if that happens on other sites.

I have now enough reputation points on Stack Overflow to edit every post directly. But sometimes (especially if this is about a field where I'm not savvy, or when I try to edit a question title without having understood the question itself) I might be not totally sure about whether my edit really is an improvement.  For now, I have these options:   Do the edit anyway, hope that someone else will catch it if it is wrong Don't do the edit, and hope that someone else will see this post and edit it in the right way Let a comment and hope that someone will see it (either after editing or instead of it). Flag the post for moderator attention (but will the moderators know it better?) Search the right chat room to find someone who knows more about the topic.   All these are not really optimal, I think.  I would like to have a check box     [_] Submit this edit for approval   which, when checked, would submit the edit into the usual edit approval queue. Then I would get at least one or two other pairs of eyes looking over my edit, and maybe even improving it.  (I don't really care about the +2 reputation for the edit - I think it should be without any reputation difference here.)  There's an  for nearly giving everyone the ability to suggest edits that the post owner can approve, but I'm simply interested in being able to insert them into the general edit queue where anyone can approve them.  Actually, I could do this right now by having a low-reputation sock puppet (or a totally anonymous edit), but I think this is not the intended use for sock puppets, is it? Also, I would like to be able to get feedback for my edit.


I have two JavaScript obj like so: const objOne = {   "firstname": "xzxz",   "lastname": "xzxzxzx" };  const objTwo  = {   "title": [     {       "name": "foo",       "table": "First"     },     {       "name": "bar",       "table": "Second"     }   ] };  and I want to combine them like below (not sure if "combine" is the appropriate word but hopefully make sense) {   "firstname": "xzxz",   "lastname": "xzxzxzx",   "title": [     {       "name": "foo",       "table": "First"     },     {       "name": "bar",       "table": "Second"     }   ] }  so far I tried the below    let result = [];      results.push(objOne);      results.push(objTwo);  but surely the result is not the one I want and it make sense as I create an array and I push into both objects. [   {     "firstname": "xzxz",     "lastname": "xzxzxzx"   },   {     "title": [       {         "name": "foo",         "table": "First"       },       {         "name": "bar",         "table": "Second"       }     ]   } ]

I need to be able to merge two (very simple) JavaScript objects at runtime.  For example I'd like to:  var obj1 = { food: 'pizza', car: 'ford' } var obj2 = { animal: 'dog' }  obj1.merge(obj2);  //obj1 now has three properties: food, car, and animal   Does anyone have a script for this or know of a built in way to do this?  I do not need recursion, and I do not need to merge functions, just methods on flat objects.


If you intend to run some analysis like an ANOVA or linear regression that assumes normality, how do you determine if a given method for checking normality is appropriate? What kinds of issues should it check for? What tolerance should the normality test have? I often have cases with >10k values, and I know that Shapiro-Wilk rarely works for such large datasets. There are other alternatives, but what criteria should be used to evaluate the other options? What I don't want to do is try a bunch and pick the one that best supports my hypothesis (that the data is normal). From my understanding, the main reason for normality testing is that deviating too far from a normal distribution can bias some analyses to inflate/deflate the alpha. Is that correct? If so, could a bootstrapped approach be a general (albeit slow) alternative to normality testing?  Scale the residuals from each condition to mean=0, sd=1. Sample ~100 values from those scaled residuals, and run a t-test on the sampled values Repeat the previous step ~10k times Calculate the proportion of repetitions with p-value < alpha. The difference between that proportion and alpha is indicative of the false positive rate due to the residuals' distribution. So if alpha is 0.05 and the proportion of p-values<alpha is 0.0506, you conclude that the distribution is unlikely to impact the false positive rate.  As much as I would like someone to just say, use [method X]. I'd rather get a general sense to make the decision myself. Edit:  suggested by @nick-cox below generally answers the question

A former colleague once argued to me as follows:      We usually apply normality tests to the results of processes that,   under the null, generate random variables that are only   asymptotically or nearly normal (with the 'asymptotically' part dependent on some quantity which we cannot make large); In the era of   cheap memory, big data, and fast processors, normality tests should   always reject the null of normal distribution for large (though not insanely large) samples. And so, perversely, normality tests should   only be used for small samples, when they presumably have lower power   and less control over type I rate.   Is this a valid argument? Is this a well-known argument? Are there well known tests for a 'fuzzier' null hypothesis than normality?


I am a new web designer creating a website for a realtor, and I using a URL provided to me with a listing of homes to display. I put the URL in as an iframe src and I am getting the results listing on the page, but I don't like the way the list looks. Is there a way to override the stylesheet for the website in the iframe so I can use my own?

I have a simple page that has some iframe sections (to display RSS links). How can I apply the same CSS format from the main page to the page displayed in the iframe?


The command  du -b /home/user/directory   shows a completely different file size than displayed by a manual "right click" on the same directory and selecting "Properties" inside common file browsers like Nautilus, PCManFM, Windows Explorer or others.    Examples for requesting the file size:   Via file browser: "Right click" ⇨ "Properties" on a directory shows an apparent (real) file size of 8.141.120 bytes. On the other hand, the used disk space has 8.155.136 bytes and is a bit higher (because of fragmenting etc.). Via du -b: Shows an inexplicable size of 8.145.216 bytes (which is neither the apparent size nor the used disk space of the previous method with file browser).   I already know that the  instead of the apparent size of the directory. With du -b one can change that default behavior to display the apparent (real) size instead. Nevertheless, in "Properties", both the real size as well as the used disk space are completely different from the mentioned output of du -b.    What is the reason for that? Which CLI-command do I have to use if I want to show the real (apparent) file or directory size which has exactly the same value like displayed in file browsers via "Right click" ⇨ "Properties"?  I ask for that because I want to create some simple bash script to compare the real sizes of content on HDD1 and HDD2 after performing a backup. This should be compared within a high possible bit accuracy. A comparison of the used disk spaces won't make sense in that case, because they are very different on both drives.

I have a directory with a few hundred files (real files, no symlinks, no subdirectories).  When I use ls -la and sum up the sizes in Excel I get 287190 bytes(?).  When I use du -b or du --apparent-size --block-size=1 I get 422358 bytes(?).  I thought those two things mean the same thing, why the difference?


I created a list in the en site called   hello's~`!@#$%^&*(){}[]:;"'<>?/\|*-+.   What I am trying to do is figure out what exactly is the encoded version of the name if I am trying to target it by name in a REST url. I have this  http://mysite/en/_api/web/lists/getbytitle('hello's~`!@#$%^&*(){}[]:;"'<>?/\|*-+.')   but this doesn't work of course. I tried url encoding it to  http://mysite/en/_api/web/lists/getbytitle('hello%27s~%60!%40%23%24%25%5E%26*()%7B%7D%5B%5D%3A%3B%22%27%3C%3E%3F%2F%5C%7C*-%2B.')   but even then, doesn't work.  Does anyone know how to do it?

In SharePoint 2013 rest url's, some of them includes a list name which is passed by a user (in the web part settings) which I then use in a web part. I then stick the list name in a rest url, but now I realize that what if the user names the list with special characters like an apostrophe or with an & sign or something. What is the best way I can encode/fix the list name before sticking it in the rest url?  Thanks


Give a function $f : X \to Y$ such that $(X,d)$ and $(Y,p)$ are metric spaces, and $f$ is continues and one-to-one function and onto $Y$ but $f^{-1}$ is not continues ?  I know that compactness of $X$ must play a role here, because if $X$ is compact then there is no such counter-example, so $X$ must be no compact, but other than this i don't have a direction for the solution, please help.

What are some examples of functions which are continuous, but whose inverse is not continuous?  nb: I changed the question after a few comments, so some of the below no longer make sense. Sorry.


In video games, flying in the level is typically like this:   W - move forward; S - move backward; A,D - move right/left without turning; Space - jump/ascend;   If I try this in Blender, it does not work (and in general makes some mysterious hard-to-undo changes when I press unknown keys).   Is there any easy mode for navigating the scene using video-game-like controls? Is there even mode video-gamish mode with gravity (towards the center of the closest big object) and clipping (not allowing point of view to become too close to some surfase)?

My problem is that I have a huge scene with meshes and (let's say) I see this scene for the first time. I do not know it, I want to look around. I can use the controls like MMB  plus look around, ⇧ Shift + RMB  (but scene is too huge for this). Then I select some objects on the hierarchy and press numpad . (but as I said: I do not know the scene and/or the object names can look like all the same as well), what will take me there. I know, I can use the fly camera mode, but that is well... kinda hard to use, for me at least. Is there a better way to move around? Like in a game: WASD + mouse look? (I do not want to move my camera, my goal is to move my editing area to a specific position / angle)


Given $a^T X^{-1} b$, where $a,b$ are $n\times 1$ vector, $X$ is $n \times n$ matrix. It is easy to see that $\frac{\partial a^{T} X b}{\partial X}=ab^{T}$, but what is $\frac{\partial a^{T} X^{-1} b}{\partial X}$? If I do this $\frac{\partial a^{T} {X^{-1}} b}{\partial X}= \frac{\partial a^T X^{-1} b }{\partial X^{-1}} * \frac{\partial X^{-1} }{\partial X}$, what is $\frac{\partial X^{-1} }{\partial X}$? Any hint?

Prove that $$\nabla_{\mathrm X} \mbox{tr} (\mathrm A \mathrm X^{-1} \mathrm B) = - \mathrm X^{-\top} \mathrm A^\top \mathrm B^\top \mathrm X^{-\top}$$   My proof is below. I am interested in other proofs.    My proof  Let   $$f (\mathrm X) := \mbox{tr} (\mathrm A \mathrm X^{-1} \mathrm B)$$  Hence,  $$\begin{array}{rl} f (\mathrm X + h \mathrm V) &= \mbox{tr} (\mathrm A (\mathrm X + h \mathrm V)^{-1} \mathrm B)\\ &= \mbox{tr} (\mathrm A (\mathrm X ( \mathrm I + h \mathrm X^{-1} \mathrm V))^{-1} \mathrm B)\\ &= \mbox{tr} (\mathrm A ( \mathrm I + h \mathrm X^{-1} \mathrm V)^{-1} \mathrm X^{-1} \mathrm B)\\ &= \mbox{tr} (\mathrm A ( \mathrm I - h \mathrm X^{-1} \mathrm V + O (h^2)) \mathrm X^{-1} \mathrm B)\\ &= \mbox{tr} (\mathrm A \mathrm X^{-1} \mathrm B) - h \, \mbox{tr} ( \mathrm A \mathrm X^{-1} \mathrm V \mathrm X^{-1} \mathrm B) + O (h^2)\\ &= f (\mathrm X) - h \, \mbox{tr} ( \mathrm X^{-1} \mathrm B \mathrm A \mathrm X^{-1} \mathrm V ) + O (h^2)\end{array}$$  Thus, the directional derivative of $f$ in the direction of $\mathrm V$ at $\mathrm X$ is  $$D_{\mathrm V} f (\mathrm X) = - \mbox{tr} ( \mathrm X^{-1} \mathrm B \mathrm A \mathrm X^{-1} \mathrm V ) = - \mbox{tr} ( (\mathrm X^{-\top} \mathrm A^\top \mathrm B^\top \mathrm X^{-\top})^\top \mathrm V ) = - \langle \mathrm X^{-\top} \mathrm A^\top \mathrm B^\top \mathrm X^{-\top}, \mathrm V \rangle$$  and, lastly,  $$\nabla_{\mathrm X} \mbox{tr} (\mathrm A \mathrm X^{-1} \mathrm B) = - \mathrm X^{-\top} \mathrm A^\top \mathrm B^\top \mathrm X^{-\top}$$


I have managed to log before, but now its different. I can type the Login normally and press enter. It asks for the password. But what I type is not displayed on the screen. I have to press enter, what moves it one line down, to start typing the password. Because of that, the password is seem as "incorrect". If I dont press enter it just wont display my password on the screen.   PS: Even trying to type it on "invisible" wont let me in.   PS2: I can log in the Graphical interface without a single digit problem.  What might be causing the problem?

When I'm about to install a program in the terminal it wants the password:  [sudo] password for xxx:   But when I start to type my password nothing happens. What should I do?


I have created a bootable USB using Ubuntu running in a VMware VM and using the instructions as provided here .  I have Windows 8 hardware that 'will' boot from the USB (Sony VAIO Duo 11). Therefore, I can run boot form the USB and Try Ubuntu without any impact on my Win 8 configuration. Secure Boot setting has no negative impact either way.  I have another newer Windows 8 Pro laptop (Toshiba P50T - Haswell Architecture, 4th Gen i7) and I cannot boot from the USB. The hardware does identity the USB and provides it as a boot option, and the Ubuntu boot menu is displayed, yet the OS fails to boot.   I am inclined to believe this might be 'related' to the known USB 3.0 issues with the Haswell based systems - . The laptop in question is less than two weeks old and undoubtedly has the bug. I have booted the laptop from a fully shut down state.  Solutions/ information from someone better informed would be appreciated.

I'm absolutely new to Linux. I would like to know how to install Ubuntu alongside the pre-installed Windows 8+ OS.  Should I do it with Wubi, or through the Live USB/DVD?  What steps do I need to take to correctly install Ubuntu?


I am an Indian national and passport holder, traveling from New Delhi to Frankfurt (via Kuwait) and back with Kuwait Airways. I see no Terminal change for the onward and return journeys. I have no plans to leave the airport due to short layovers.  Do I need a Kuwait transit visa?

I am travelling to USA via Kuwait and the layover is 18 hours.   I am Indian citizen and have valid USA Visa B1/B2 valid for the next 10 years.  Please update me I have to book a flight and need some help.


I got message to pick either "Touchwiz Easy" or "Touchwiz Home" - didn't know what to do so picked Easy. Now have lost the appearance of my Home Pages?  How can I get this back?  HELP!!!

I've accidentally enabled TouchWiz Easy Home on my Samsung Galaxy SIII Neo (Android KitKat 4.4.2). Now I'm not sure how to get rid of it and get back to TouchWiz Home. I've tried rebooting the phone but I don't see an option. How do I switch?


Upon opening TeXstudio for Mac I get en error. It seems that the system cannot find my TeX of LaTeX distribution.    Do notice i have MacTex installed and have it working with LyX.  I am a newbie and I have no clue how I resolve this issue. I hope some blessed soul can help me out!

Texstudio doesn't work for me anymore after updating to Mac OS X 10.11 El Capitan. I have the latest version of TexStudio installed (2.10.2). As pointed out by , this is due to a change in the places OS X allows files to be saved. When I started TexStudio, I received a message "PDFLatex could not be launched". In the settings, I had to change the folder of the compiler from user/texbin/ to /Library/Tex/texbin, as shown in the screenshot below:    Can anybody tell me if I have to make further changes in order to make TexStudio fully working (bibliography and the like), and if yes, which?   I hope TexStudio are very soon going to release an update (there is an issue for this on their issue queue.  Thank you for your help. This is my first post here, so please apologize any imprecisions.


Consider this example:  \documentclass{report} \usepackage{lipsum} \begin{document} \begin{tabular}{lll}   A & B & \lipsum[1][1-3] \end{tabular} \end{document}   In the output:   the last column goes out of the bounds of the page. I could constrain the last column by using\begin{tabular}{llp{3cm}}. However, it would be more convenient to make the table span textwidth automatically. How to do it?

I have the following table:  \begin{table}[htb] \begin{tikzpicture} \node (table) [inner sep=0pt] { \begin{tabular}{ l | l }   {\bf Symptom} & {\bf Metric} \\ \hline Class that has many accessor methods and accesses a lot of external data & ATFD is more than a few\\ Class that is large and complex & WMC is high\\ Class that has a lot of methods that only operate on a proper subset of the instance variable set & TCC is low\\ \end{tabular} }; \draw [rounded corners=.5em] (table.north west) rectangle (table.south east); \end{tikzpicture} \caption{God class symptoms} \label{tbl:god_class} \end{table}   Now I want to force the width of the table to be the same as the \textwidth, either by linewrapping of table text or by scaling. How can I achieve that?


I'm trying to prove\show the associative property for the $\gcd(a,b)$ function.   $$\gcd( a ,\space \gcd(b,c) ) = \gcd(\space \gcd(a,b) , c )$$  Let:  $$e = \gcd( a ,\space \gcd(b,c) )\text{ and }f = \gcd(\space \gcd(a,b) , c )$$  From here you can see that  $$ e\mid a,\gcd(b,c) \Longleftrightarrow e\mid a,b,c $$  And similarly,  \begin{align*} f|\gcd(a,b),c &\Longleftrightarrow f\mid a,b,c\\ &\Longleftrightarrow f\mid e\\ &\Longleftrightarrow e\mid f \end{align*}  If $ e\mid f$ and $f\mid e \Longrightarrow |e| = |f| $ and since $e$ and $f$ are both non-negative we have the result, $e = f$, as required.  Is this proof sound?

Prove $\gcd(a,b,c)=\gcd(\gcd(a,b),c)$ for $0\ne a,b,c\in \Bbb{Z}$. I tried solving it with sets but I sense there are some details I am missing. I would truly appreciate your reference.


I want to know what is the following integral  $\int e^{-(y-\mu)^T \Lambda(y-\mu) } dy$ I am trying to see the properties of gaussian integral but I couldn't find anything for this one. Any help guys?  I want to know how given    where Z(x) is the partition function    This is the   If the integration that you guys have given is correct there should be $|\Lambda|^{1/2}$ at the end instead of just $|\Lambda|$ in $\frac{1}{Z(x)}$. I doubt that there is a type in the paper. So I must be missing something  Can anyone explain why that guy didn't have $|\Lambda|^{1/2}$ but  $|\Lambda|$ instead???

I was reading this  where it had a gaussian distribution model.   I mean gaussian is given by  $P(y) = \frac{e^{-\frac{1}{2}(y -\mu)^T \Sigma^{-1}(y -\mu)}}{2\pi^{n/2}|\Sigma|^{1/2}}$  But is   $\frac{e^{-(y -\mu)^T \Sigma^{-1}(y -\mu)}}{2\pi^{n}|\Sigma|}$ Gaussian as well?  The paper used their model saying the gaussian had the above form. It is valid?


Several Sith, including Tyranus and Vader, were former Jedi who became Sith after a fall/conversion to the Dark Side.  Did any Sith turn to the light side for the first time and become Jedi, having never previously been a Jedi? That is, these would be people who had been Sith for all, or most of their life, taking their first steps into the Jedi Order after a fall (or, if you will, a "rise") to the Light Side.  Darth Vader/Anakin's return to the Light Side does not count because he had been a Jedi first before he became a Sith - his conversion to the light side was a reversion to his former status.

I have heard of a ton of Jedi who have turned to the Dark Side and became a Sith (Exar Kun, Darth Malak). I've even heard of a few Jedi who have turned to the Dark Side and then found their way back to the Light (Revan, Anakin, Qel-Droma). But I cannot seem to recall any Sith who turned to the Light Side. I think I might have read of one, but I cannot remember the name or story.  Are there any Sith who have turned to the Light? Hell, have there even been any Sith that have turned to the Light Side and then returned to the shadows of the Dark Side?


All of my initial programming experience has been in object-oriented languages (Java, Python). I am now learning C, and it seems that there are still things that resemble objects.   Say for example, a FILE pointer created with the standard C library. This is just a pointer to the memory location of a struct. Is this essentially the same thing as an object in OO languages?  There are existing questions asking about the difference between a struct and a class, but I'm asking about how a program uses those things. A struct is used or accessed via a pointer, while an object is a particular instance of a class. In this sense, it seems that a class is more general than a struct. Though I really only added this paragraph to prevent this questions from being marked as a duplicate, and it strays from my original question.   If a FILE pointer is, indeed, comparable to some FILE object in a different language, then where is the key difference between how that "thing" called FILE will be handled in a object-oriented language vs a non-object-oriented language. Seems like the line starts to blur.

This question was .  Now I'd like to learn the differences between a struct and a class in C++. Please discuss the technical differences as well as reasons for choosing one or the other in OO design.  I'll start with an obvious difference:   If you don't specify public: or private:, members of a struct are public by default; members of a class are private by default.   I'm sure there are other differences to be found in the obscure corners of the C++ specification.


I know that $\sum(\sqrt{n+1}-\sqrt{n})$ is divergent by doing the Telescoping Series. Now our given series is, $\sum\dfrac{\sqrt{n+1}-\sqrt{n}}{n}$. I considered doing the Ratio Test on the given series but did not go too well. It just gave me a much more complicated series to work with. I was given a hint that I could use the Comparison Test and compare it with $\dfrac{1}{(\sqrt{n})^3}$. I'm confused as to why we would be comparing it to that?

I'm currently tackling the following infinite series in order to determine if it converges or not:  $$\sum_{n=1}^\infty \frac{\sqrt{n+1}-\sqrt{n}}{n}$$  What I've done is rearranged this to make use of the comparison test, shown below:  $$= \frac{\sqrt{n+1}-\sqrt{n}}{n} * (\frac{\sqrt{n+1}+\sqrt{n}}{\sqrt{n+1}+\sqrt{n}})$$  $$= \frac{(n+1)-(n)}{n(\sqrt{n+1}+\sqrt{n})}$$  $$= \frac{1}{n(\sqrt{n+1}+\sqrt{n})}$$  $$= \frac{1}{n^{3/2}+\sqrt{n+1}} < \frac{1}{\sqrt{n+1}} < \frac{1}{\sqrt{n}} $$  However, $\frac{1}{n}$ is smaller than $\frac{1}{\sqrt{n}}$, therefore:  $$  \frac{1}{n}   < \frac{1}{\sqrt{n}}$$   This implies divergence by the comparison test due to the fact $\frac{1}{n}$ diverges, and if a smaller series diverges any larger series must as well.  Is this right? If I've made any mistakes in any part, please tell me!


I have my eye on a domain that is for sale. After some research I've determined that traffic is the biggest bargaining chip the owner has. The domain is a 6 character .com and consists of two "keywords", but they combine in a way that not too many would be interested. It sold years ago for 1200 USD and is listed at $3100 now. I'm thinking it's worth more like $500, unless it has an unusual amount of traffic (it's currently hosting a parked "buy this domain" site). How can I find and verify traffic information and Google search results for this domain?

I'd like to register a second-level domain with the .com extension and I noticed that it has already been registered and the owner put it for sale and let the possibility to make an offer in their site or by contacting them.  I saw that domains are generally sold for extremely different prices, so I'm confused.  Are there any general criteria to decide how much I should offer to purchase a domain?


Let $G$ be a finite group with order $2n$. Let's assume $G$ has $2$ distinct subgroups $G_1$ and $G_2$ both of order $n$. I want to prove that there exists another subgroup $G_3$ of order $n$ with $G_3\neq G_1$ and $G_3 \neq G_2$. Both $G_1$ and $G_2$ are normal since they have index 2. When I'm asked to prove the existence of a subgroup I immediately think of Sylow theorems, but I don't know if they are helpful here since by conjugating $G_1$ we would still obtain $G_1$. Hence $n$ cannot be prime. Any hints?

I am looking for a group $G$ such that $G$ has exactly two subgroups of index 2.   I have searched by GAP but I couldn't find it.


I've asked before and couldn't get a definitive answer,  and I tried poking around myself for very long with no success so I will try again to explain my issue as clearly as possible.  I am running the stack exchange app on my android smart phone.  I've had it for a long time and it just auto logs in on its own.    I want to be able to log in now on my pc and other devices and I have forgotten any account details like password,  or even the email I used to create the account.  All I have is my user name,  as we can all see it.    Given my situation in what way can I go about finding out my the email used or doing a reset password, or is there any advice anyone could give me on how to deal with this problem.  Thx

EDIT: I tried logging the exact same way, except from Electrical Engineering (the first community I joined), and this time it worked. I though where you tried to log in had no impact on your Stack exchange account, turns out it does. Thanks everyone who answered!  Some time ago I created this very account, using the same phone I am using now. My problem is, I have no idea how I created the account.  I apparently used neither my usual mail address nor my usual Google account. When I log out then back in with this phone, it works using a Google account but I suspect it is my friend's, who logged multiple times on other Google apps on my phone.  This account doesn't have much, and I could easily create another, but I don't like creating multiple accounts just because I lost one. Help?


Is there a way to only execute a command after another is done without a temp file? I have one longer running command and another command that formats the output and sends it to a HTTP server using curl. If i just execute commandA | commandB, commandB will start curl, connect to the server and start sending data. Because commandAtakes so long, the HTTP server will timeout. I can do what I want with commandA > /tmp/file && commandB </tmp/file && rm -f /tmp/file  Out of curiosity I want to know if there is a way to do it without the temp file. I tried mbuffer -m 20M -q -P 100 but the curl process is still started right at the beginning. Mbuffer waits just until commandAis done with actually sending the data. (The data itself is just a few hundred kb at max)

I have a bash script which enumerates through every *.php file in a directory and applies iconv to it. This gets output in STDOUT.   Since adding the -o parameter ( in my experience ) actually writes a blank file probably before the conversion takes place, how can I adjust my script so it does the conversion, then overwrites the input file?  for file in *.php do     iconv -f cp1251 -t utf8 "$file" done


If i turn headlights on in a car at v = 0.99*c, will the headlight speed be 0.01*c? I know speed of light is always the same but it really confuses me? My question is, does space contract so much at that speed that even light at just the speed of 0.01*c will appear to be 299792 km/s? It seems to me space contraction and time dilation make the slow light appear to be normal light at normal light speed. Can someone explain to me please?

The title says it all.  If I was on a bus at 60 km/h, and I started walking on the bus at a steady pace of 5 km/h, then I'd technically be moving at 65 km/h, right?  So my son posed me an interesting question today: since light travels as fast as anything can go, what if I shined light when moving in a car?  How should I answer his question?


I want to install gimp in 13.10. I follow these procedure to install gimp.  sudo add-apt-repository ppa:otto-kesselgulasch/gimp-edge sudo apt-get update sudo apt-get install gimp   But after i update the system, when i go for the last command.(sudo apt-get install gimp) It show this error  The following packages have unmet dependencies:  gimp : Depends: libgimp2.0 (>= 2.9.1.119-build~33915~145295a~saucy0~ppa) but it is not going to be installed         Depends: libgimp2.0 (<= 2.9.1.119-z) but it is not going to be installed         Depends: libgegl-0.3-0 but it is not going to be installed E: Unable to correct problems, you have held broken packages.   How can i install the gimp and resolve the error. please help me.

Occasionally, when I'm installing stuff, I get an error like the following:  Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  package1 : Depends: package2 (>= 1.8) but 1.7.5-1ubuntu1 is to be installed E: Unable to correct problems, you have held broken packages.   How can I resolve this?


I try to figure out how a logistic regression is handling data with a 0/1 dependent variable. 95% of the data are ones. The purpose of the model is to estimate the probability to be in one of the groups. Of course there are several explanatory variables included.  Fitting the model leads to unsatisfactory results, since the model will predict for almost every observation that it is in category=1. I tried some very naive weighting, which already improved the model. I simply changed the proportion and reran the fitting process with different weights. The weights changed the proportion in the dependent variable (I have no assumptions about the explanatory variables, so every observation in category=1 gets the same weight) to 50:50, 60:40, 70:30 and 80:20. Trusting some validation measures like AIC, different pseudo R2s and the classification table the model with 50:50 weighting is the best. (The calculations of these measures are mostly based on the log likelihood of the corresponding model. So they will be based on the weighted samples.)  These measures probably won't do the job and maybe are inappropriate to find an optimal weighting procedure. My literature somehow skips this point, although I don't think that very unequal groups in the dependent variable are such an uncommon situation. I heard from a colleague of mine, that I should use an ROC curve to find optimal weights.   Can anybody refer to a book ore solution for this problem?   Or can give hints how to handle it?

Okay, so I think I have a decent enough sample, taking into account the 20:1 rule of thumb: a fairly large sample (N=374) for a total of 7 candidate predictor variables.   My problem is the following: whatever set of predictor variables I use, the classifications never get better than a specificity of 100% and a sensitivity of 0%. However unsatisfactory, this could actually be the best possible result, given the set of candidate predictor variables (from which I can't deviate).   But, I couldn't help but think I could do better, so I noticed that the categories of the dependent variable were quite unevenly balanced, almost 4:1. Could a more balanced subsample improve classifications?


I am new to this field, and I face with a question that asks me to count how many Eulerian circuits start from node 0 in this graph. The answer from the book is 264 but I feel that the answer is wrong. I have tried the Fleury's algorithm to count but after several steps, I started being confused.

As the title suggests, I’m simply looking for a method to compute the number of Eulerian Paths in the complete graph $K_5$, where all paths start from the same node. Since there are 5 nodes, all Eulerian paths must be Eulerian circuits as well.  Thanks.


Is this the correct use of an apostrophe when showing a name and relationship?     When was your father, Robert's, wedding?   Thanks!

I would like to say something like     The boy, Adam's, favorite toy was a bike.   What is the proper way to say this?


$m,n$ are integers bigger than 0.   I need to prove:  $$\frac{1}{\sqrt[n]{1+m}}+\frac{1}{\sqrt[m]{1+n}} \geq 1$$   I tried to multiply both sides by the common factor and raise both sides to the power of $m*n$ but it did not work for me, and I have no other idea how to proceed.  I don't want the full solution, but just a hint.  Thank you.

Prove that for every $n,m \in \Bbb N $ $$ \frac{1}{\sqrt[n]{1+m}} + \frac{1}{\sqrt[m]{1+n}} \ge 1 $$


Part filePart = request.getPart("barcodePhtotoVen");  inputStream = filePart.getInputStream();   How to write this using outputstream to folder/file in my computer drive?

I was surprised to find today that I couldn't track down any simple way to write the contents of an InputStream to an OutputStream in Java. Obviously, the byte buffer code isn't difficult to write, but I suspect I'm just missing something which would make my life easier (and the code clearer).  So, given an InputStream in and an OutputStream out, is there a simpler way to write the following?  byte[] buffer = new byte[1024]; int len = in.read(buffer); while (len != -1) {     out.write(buffer, 0, len);     len = in.read(buffer); }


I have an Ubuntu machine that I want to have windows virtualized in with VirtualBox.  Is there a specific version of Windows 7 that I have to have so that the license will allow me to virtualize it?

I've read that Windows 7 cannot be virtualized on non-licensed PCs. Ubuntu isn't licensed with Microsoft's license, of course, which means that I cannot use it to virtualize Windows 7. I've read that there are other versions that are "OEM" or "non-OEM" or something like that and which have different terms and conditions.  What is the exact name of the version of Windows 7 that I should buy in order to be legally able to use it in VirtualBox on Ubuntu?


I am pretty confuse that how i go with the gemoetry flow for my model, I personaly follow quads but the problem is that going with quads geometry adds a  extra triangle and verts which is not optimal for game in term of optimizng  game assets. So which geometry workflow to be followed for certain scenario or ones have to stick with quads for better geometry

I've read many times that triangles should be avoided in meshes, too give one reference: "Introducing Character Animation with Blender by Tony Mullen" says that equilateral triangles work fine as long you don't deform them.  It seems to be common in game development that the models are triangulated.   What issues are introduced by using triangles? Does the same apply for n-gons?


Blender newbie here.   I've created a really simple scene consisting of a subdivided and smoothed sphere, then applied a texture and created a Sun light. Rendering in Cycles I'm experiencing a very odd looking shadow edge. Anyone encountered anything like this? From Maya I'm used to be able to increase the sample of individual lights but I can't seem to see a similar option.     I'm in 2.8 by the way.  By comparison the shadow is actually looking pretty decent in Eevee without changing anything.  Thanks for all your expertise!

I've been modeling a hermit crab and I don't know why but some areas of the mesh are really dark on some spots, like the legs and the claws.   I hope you can help me fix it.


On my own home machine, Windows 10 Pro, I have a folder off the C: root named "local". I put utility programs in there and put the folder on the path.  I finished writing a utility today and attempted to copy/paste it into the \local\ folder (using File Explorer) and got the message that I would need to provide Administrator privilege. I clicked the button with the admin 'shield' icon in that dialog, thinking it might elevate my privilege for this operation, but it failed.  So I went looking for a way to run File Explorer with admin privilege. I would rather not download a new utility program or extra shell, I do not want to edit the registry, and I do not want to put a shortcut on my desktop -- I am hoping that there is SOME way, as an admin on the machine, to run this basic utility with admin privilege when I actually need to.  I found a page that indicated I could find the exe file in \Windows\, right-click it and choose "Run as Administrator"; I found the file and did that, but got the same message when I attempted to copy the file into my \local\ folder.  Is there a way to do this? I must have been able to copy EXE files into the folder before, and don't remember having this much trouble over it.  EDIT: I found the Explorer.exe file in the C:\WINDOWS\ folder, right-clicked and selected "Run as Adminstrator", got the warning dialog about making changes to my system, and attempted the copy/paste there. It still tells me I need to provide admin privilege.  EDIT: screenshot of security settings on the folder as requested:    FURTHER EDIT: invocation and output of Dism RestoreHealth:  C:\WINDOWS\system32>Dism /Online /Cleanup-Image /RestoreHealth  Deployment Image Servicing and Management tool Version: 10.0.18362.1  Image Version: 10.0.18362.592  [==========================100.0%==========================] The restore operation completed successfully. The operation completed successfully.   EDIT: RESPONSE TO SUGGESTION OF SIMILARITY TO ANOTHER QUESTION:  Unfortunately the suggested question is not close to my own; I'm not trying to run it as a different user. I want to run it so I can copy files from one folder I created to another folder I created.  EDIT: FURTHER INFORMATION  The problem seems dependent on the extension of the file I'm attempting to copy -- if I use a CMD prompt that I run as admin, and attempt to copy the file, I get the error 'access denied'. If I rename that file to be a .txt file, it copies without problem. If I then try to rename that file to be .exe, I get 'access denied'. So I conclude that the thing I'm prevented from doing is putting an EXE file into this directory that I created. An odd thing about that is that I put a different EXE file in that directory yesterday morning, according to its timestamp.

In Windows 10, the Windows Explorer shortcut on the taskbar has a different context menu than previous versions of Windows, and is missing the "Run as..." option (while holding the shift key).   How can I open Explorer as a different user?


I'm new to photography and often face problems with subject with a bright background.      For example: A worker on a 2nd floor building with bright sky as   background and picture captured from ground level. I don't want to use   a flash.   I use Nikon D5100. Any suggestions or ideas will be appreciated :)

I took a picture once in a beautiful location with an awesome background, and a cool location to get the shot. The problem is, the location of the subject had substantially less light then the background, giving a silhouette effect. Without using an external flash, and on a low budget, what could I do to improve this picture?  Specifically, I shooting with a DSLR, outdoors. The DSLR has a small pop-up flash. The nearest good light source was maybe 5-10 feet away.   Thanks guys!    How do I avoid a dark subject when there's bright sunlight from windows?  by   I recently shot some photos at a friend's wedding. The location was lovely with lots of light — sometimes too much. The sunlight from the windows and skylights seemed to overpower the shot and the subject/people were very dark. What are some ways to avoid this without using fancy equipment? (I'm just starting out, I'm not a wedding photographer or anything!)  Here is one example I took — and this is after I've lightened it somewhat with Picasa:    I'm using a Nikon D5000 with a standard 18-55mm lens.


Following codes are part of a Red Black Tree program which has to take item as a char or int, so I decided to use a template class, however I don't know how to extend it through the complete program and the compiler sends me thousand errors:  The code has German names, so if it makes it easier to understand, I will translate some of them:  baum = tree knote = node links = left rechts = right rot = red doppel = double mittlere = middle eltern = parent einfuegen = insert rs = rb = red black   Knote.hpp  #pragma once  template <class T> class Knote { public:     Knote(T data = 0);     bool rot;     T item;     Knote *links;     Knote *rechts;     Knote *eltern; };   Knote.cpp  #include "Knote.hpp"  Knote<int>::Knote(int data) {     this->item = data;      eltern = nullptr;     links = nullptr;     rechts = nullptr;     rot = true; }   now how should I do it for the rest?  Baum.hpp  #pragma once  #include "Knote.hpp"  #include <vector>  class Baum { public:     Baum();     void einfuegen(int x);     void ausgabe_levelorder();     void ausgabe_inorder(); private:     Knote<int>* head;     void rs_einfuegen(Knote<int>* &knote, Knote<int>* &eltern, int x, bool sw);     int rot(Knote<int>* &knote);     void links_rotation(Knote<int> * &links_knote);     void rechts_rotation(Knote<int> * &links_knote);     void levelorder(Knote<int>* knote, std::vector<Knote<int>*> &knoteQueue, int niveau, std::vector<int> &niveauQueue);     void sort_levelorder(std::vector<Knote<int>*> &knoteQueue, std::vector<int> &niveauQueue);     void inorder(Knote<int>* knote); };   Baum.cpp  #include "Baum.hpp"  #include <iostream>  using namespace std;  Baum::Baum() {     ... }  // XXX void Baum::einfuegen(int x) {     ... }  // XXX int Baum::rot(Knote<int>* &knote) {     ... }  // XXX void Baum::rs_einfuegen(Knote<int> *& knote, Knote<int> *&eltern, int x, bool sw) {     ... }  // XXX void Baum::links_rotation(Knote<int>* &links_knote) {     ... }  // XXX void Baum::rechts_rotation(Knote<int>* &rechts_knote) {     ... }  // XXX void Baum::ausgabe_levelorder() {     ... }  // XXX void Baum::levelorder(Knote<int>* knote, vector<Knote<int>*> &knoteQueue, int niveau, vector<int> &niveauQueue) {     ... }  // XXX void Baum::sort_levelorder(vector<Knote<int>*> &knoteQueue, vector<int> &niveauQueue) {     ... }  // XXX void Baum::ausgabe_inorder() {     inorder(head->rechts);     cout << endl; }  // XXX void Baum::inorder(Knote<int>* knote) {     if (knote != nullptr)     {         inorder(knote->links);         cout << knote->item << " ";         inorder(knote->rechts);     } }

Quote from :     The only portable way of using templates at the moment is to implement them in header files by using inline functions.   Why is this?  (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)


I'm given the following problem:      In every group of 15 cars , there are 3 that were manufactured in the same country.   prove that in a group of 100 cars there are 15 cars that were manufactured in the same country.   does anyone have an idea of how to implement pigeonhole principle here? I'm kind of stuck because I can't assign cars to countries since I don't know how many countries are there..  Any help is appreciated . Thanks.

I was solving some combinatorics question and I came upon one I've been trying to solve for 2 days and I'm curios how to solve it.  It is known that in every set of 15 cars, at least 3 were manufactured from the same country (there can also be another 3 (or more) cars in the set which came from another country). prove that in every set of 100 cars, 15 were made manufactured in the same country.  Thanks to anyone who helps!


I finally started studying ring theory for my final and it seems like the above ring always has a principal ideal. Is this always the case? So far the examples I've looked at are: $\{(7a, 19b) \mid a, b ∈ \Bbb Z\}$ $\{(7a, 0) \mid  a ∈  \Bbb Z\}$ $\{(7a, b) \mid  a, b ∈ \Bbb Z\}$ $\{(a, 0) \mid  a ∈ \Bbb Z\}$

I need to find an example of a ring that is not a PID but every ideal is principal. I know that $\mathbb Z\times\mathbb Z$ is not an integral domain, so certainly is not a PID, but here every ideal is principal. I already proved that if R and S are ring every ideal in R x S is I x J with ideals in the original ring. But I cant follow from that that $\mathbb Z\times\mathbb Z$ has only principal ideals.      Explicitly, if $I$ is an ideal $(a)\times(b)$ which would be its generator $(c,d)$ in $\mathbb Z\times\mathbb Z$?    Thanks.


I have an AF-S Nikkor 18-140mm 1:3.5-5.6 G ED lens. I have lost the cap. Wikipedia says the lens diameter is 69mm. I cannot find a 69mm cap online. The best I can do is 67mm. Can anybody shed any light on this. Thanks. I would like to buy one soon.

I own a Nikon D3000 Camera with the AF-S 18-55mm VR Kit Lens. Last week I lost the lens cap and now I want to buy a new one.  But when I went to , I got confused with the different ranges of lens names —  LC-62, LC-78, etc.  My concern is what if I order one lens cap and it won't fit correctly on my lens?  If you guys have an D3000, can you please let me know how to find the correct lens cap names?


By mistake I have made permission changes for /etc. Now it's giving me the following error message:  bash: /etc/bash.bashrc: Permission denied   I have no name!@chandan-Inspiron-5520:~$ sudo /etc/init.d/apache2 restart   sudo: unable to stat /etc/sudoers: Permission denied   sudo: no valid sudoers sources found, quitting   sudo: unable to initialize policy plugin

I needed to edit a .config file (which I know for a fact is not creating these problems, just to clear that up) and it wouldn't let me save it, so I took ownership of /etc and all contents with the command chown -hR username /etc and that let me edit the .config file but now whenever I try to install any packages or use any sudo commands, it doesn't work  (I've checked for errors in the sudo file in sudoers.d and there was nothing wrong with that).   So how do I return it to the previous owner?


I want to display fields "field_summary" and "field_tags" of a node in html.html.twig (without using a module for that). I was already able to get "field_summary" value in html.html.twig with this code:  function universaldenker_preprocess_html(&$variables) {   $node = \Drupal::routeMatch()->getParameter('node');   $variables['node_summary'] = $node->get('field_summary')->value;   $variables['node_tags'] = $node->get('field_tags')->getString(); }   Then I just used {{ node_summary }} in html.html.twig. It works perfectly. But I couln't display values of "field_tags". If I use {{ node_tags|join(', ') }} then I get the field_tags ID's.   How can I get the values and not ID's?

Example: I want to get all tag names that are inside field_tags of node 5.  I can get the target_id with $node->field_tags->;     But the problem is, I don't know what entity the target_id value belongs to. Could be a node id, term id, user id. Without that info, I am not able to use the target_id to get the name of the tag.   How can I get all the names of an entity reference field?


Choose the correct answer Which one is correct word Is it right to say disabled or the disabled

My colleague and I were discussing a student's paper.      We agreed that according to our experiences and knowledge of English, the following sentence is grammatically correct: "The difference between the rich and the poor in our city stems from..."     But, another colleague claimed that it would be acceptable to say, "The difference between rich and poor in our city stems from..."     While searching for examples of each, we found ourselves befuddled.  Why are both versions seemingly acceptable?


This week  on the Network Time Protocol Daemon (ntpd) was demonstrated, . This could potentially wreak havoc with my HTTPS website or other time sensitive services I am running.  According to the article, to remain safe, clients and servers alike should run at least NTP version 4.2.8p4.  Running ntpd --version on my Ubuntu Server 14.04.3 LTS machine gives me ntpd 4.2.6p5 which is still vulnerable. This is even after running apt-get update, apt-get upgrade and apt-get dist-upgrade.  Apparently I can download the latest version from ntp.org myself. But I am unsure if this will conflict with my existing ntpd install done via apt-get. Also they only offer the download via HTTP and their method of ensuring authenticity is by using an MD5 hash checksum... I am looking forward to my NSA backdoored patch. I really wish people would use GPG signatures.   Does Ubuntu plan to release a security patch to upgrade ntpd to 4.2.8p4 any time soon? What will be needed to get the fix? If I read the code and assumed the 4.2.8p4 version available for download on the ntp.org website was trustworthy, how can I install that without conflicts?

Today a couple of buffer overflows in NTP were announced , . It looks like updating my system to fix these issues is in order.   How can I find out if they have been fixed in the Ubuntu repositories, such that if I were to run:   sudo apt-get update sudo apt-get upgrade   then the fix would get installed and the vulnerability closed?   Edit: The selected answer specifically addresses the question of how to identify if a given CVE has been fixed or not, "Does Ubuntu generally post timely security updates?"  is certainly related but not identical


I am using CMake (CLion) for a class project. I have tried the following solutions but they did not work: , , . I made a HeapSort class for a class project and I need to use it to sort a vector of strings (a dictionary). I create an instance of my HeapSort class in this dictionary as so: void Dictionary::heapSort() {     Heap<std::string> h;     stringDict = h.heapSort(stringDict); }  I keep getting an undefined reference to the constructor and the heapSort() function, where the class is defined as follows (heapSort() is similar): Heap.cpp #include "Heap.h" template <typename T> Heap<T>::Heap() {}  template <typename T> void Heap<T>::initializeMaxHeap(std::vector<T> v) {     heap = v;     heapSize = heap.size(); }  template <typename T> void Heap<T>::maxHeapify(int i) {     int l = left(i);     int r = right(i);     int large;     if (l <= heapSize && heap.at(l) > heap.at(i))         large = l;     else         large = i;     if (r <= heapSize && heap.at(r) > heap.at(i))         large = r;     if (large != i)     {         std::swap(heap.at(i), heap.at(large));         maxHeapify(large);     } }  template <typename T> void Heap<T>::buildMaxHeap() {     for (int i = std::floor(heap.size()/2); i > 1; i++)         maxHeapify(i); }  template <typename T> std::vector<T> Heap<T>::heapSort(std::vector<T> v) {     initializeMaxHeap(v);     buildMaxHeap();     for (int i = heap.size(); i > 2; i++)     {         std::swap(heap.at(1), heap.at(i));         heapSize--;         maxHeapify(1);     }     return heap; }  Heap.h #ifndef PROJ3_HEAP_H #define PROJ3_HEAP_H  #include <cmath> #include <vector>  #include "Dictionary.h"  template <typename T> class Heap { private:     std::vector<T> heap;     int heapSize;  public:     Heap();     int parent(int index) { return index/2; };     int left(int index) { return index * 2; };     int right(int index) { return index * 2 + 1; };     int getItem(int index) { return heap.at(index); };     void initializeMaxHeap(std::vector<T> v);     void maxHeapify(int i);     void buildMaxHeap();     std::vector<T> heapSort(std::vector<T> v);  };   #endif //PROJ3_HEAP_H  CMakeLists.txt cmake_minimum_required(VERSION 3.6) project(proj3)  set(CMAKE_CXX_STANDARD 11)  set(SOURCE_FILES main.cpp Dictionary.cpp Dictionary.h Grid.cpp Grid.h Heap.cpp Heap.h) add_executable(proj3 ${SOURCE_FILES})  Right now, I have all my files in one folder. What should I add to the CMakeLists.txt at this time? I have tried add_library/target_link_library (with different orders), adding include_directories, and I tried building each class in my directory separately the linking them to the main executable. Do I need to reorganize my directory as well? Edits: Added Heap.cpp & Heap.h


Coding:  \documentclass{ctexart}  \usepackage[style=numeric, backend=biber]{biblatex}  \addbibresource{test.bib}  \begin{document}     \cite{hubert_how_1990}      \parencite{_tex_2019}      \supercite{_xml-tex-pdf_201}      \printbibliography  \end{document}   Log File:  ! LaTeX Error: File `pdftexcmds.sty' not found.  Type X to quit or <RETURN> to proceed, or enter new name. (Default extension: sty)  Enter file name:  ! Emergency stop. <read *>   l.37 \RequirePackage{pdftexcmds}[2018/01/30]                                             ^^M *** (cannot \read from terminal in nonstop modes)   Platform: TexLive2019，Windows10 64bit  Compiler: XeLaTeX, Bibliography Tool: Biber

Yesterday I updated my distribution (tlmgr update --all) and now I cannot use TikZ with lualatex anymore.  Minimal working example:  \documentclass{article} \usepackage{tikz} \begin{document} a \end{document}   Compilation output:  > lualatex a This is LuaTeX, Version 1.10.0 (TeX Live 2019)                                                                                restricted system commands enabled.                                                                                (./a.tex                                                                                LaTeX2e <2019-10-01> patch level 3                                                                                luaotfload | main : initialization completed in 0.098 seconds                                                                                (/opt/texlive/2019/texmf-dist/tex/latex/base/article.cls                                                                                Document Class: article 2019/10/25 v1.4k Standard LaTeX document class                                                                                (/opt/texlive/2019/texmf-dist/tex/latex/base/size10.clo))                                                                                (/opt/texlive/2019/texmf-dist/tex/latex/pgf/frontendlayer/tikz.sty                                                                                (/opt/texlive/2019/texmf-dist/tex/latex/pgf/basiclayer/pgf.sty                                                                                (/opt/texlive/2019/texmf-dist/tex/latex/pgf/utilities/pgfrcs.sty              ...  (/opt/texlive/2019/texmf-dist/tex/generic/pgf/frontendlayer/tikz/tikz.code.tex (/opt/texlive/2019/texmf-dist/tex/generic/pgf/libraries/pgflibraryplothandlers. code.tex) (/opt/texlive/2019/texmf-dist/tex/generic/pgf/modules/pgfmodulematrix.code.tex)  (/opt/texlive/2019/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tikz librarytopaths.code.tex))) No file a.aux. ABD: EveryShipout initializing macros (/opt/texlive/2019/texmf-dist/tex/context/base/mkii/supp-pdf.mkii [Loading MPS to PDF converter (version 2006.09.02).] ) (/opt/texlive/2019/texmf-dist/tex/latex/epstopdf-pkg/epstopdf-base.sty[\direc tlua]:1: module 'pdftexcmds' not found:         no field package.preload['pdftexcmds']         [kpse lua searcher] file not found: 'pdftexcmds'         [kpse C searcher] file not found: 'pdftexcmds' stack traceback:         [C]: in function 'require'         [\directlua]:1: in main chunk. l.165       \directlua{require("pdftexcmds")}  ?    It seems that a Lua package is missing.  Is this a bug? Am I missing a package?


I am new to Latex. I am trying to put the references as well as cite them. I am doing the following:  1. Created a refer.bib file with following content  @String{j = {Journal}} @String{jof = {Journal of}} @String{procof = {Proceedings of}}  @misc{erec04,   author = {European Renewable Energy Council},   title = {{Renewable Energy Scenario to 2040}},   howpublished = "\url{http://www.erec.org/fileadmin/erec_docs/Documents/Publications/2040Exec_Sum.pdf}",   year = {2004},   note = "[Online; accessed 07-Mar-2013]" }   2. Then i used the following lines in my main.tex  \usepackage{cite} \bibliography{refer}   3. Then i tried to cite as following:  During smooth pursuit\cite{erec04}   But in the pdf version i just saw the following  During smooth pursuit[?]   Please suggest me how to do it properly?

I've browsed the forums and found a number of posts that have addressed this issue, but none of the solutions seem to work for me. I have the following script that I just copied from the bibtex home page to get familiar with it. Instead of the citation number I get a question mark. I compile using Latex+Bibtex+Latex+Latex+PDFLatex+ViewPDF just as has been previously suggested and the problem persists.   \documentclass[11pt]{article} \usepackage{cite}  \begin{document}  \title{My Article} \author{Nobody Jr.} \date{Today} \maketitle  Blablabla said Nobody ~\cite{Nobody06}.  \bibliography{mybib} \bibliographystyle{plain} \end{document}   My bibliography (Bib.bbl)  @misc{ Nobody06, author = "Nobody Jr", title = "My Article", year = "2006" }    Looking at previous posts one thing that is concerning is that my .bbl looks empty as shown below. Further, I don't have a .blg  \begin{thebibliography}{}  \end{thebibliography}


Edit: The output using lspci command  mobtaker@Ebtkar:~$ lspci 00:00.0 Host bridge: Intel Corporation Haswell-ULT DRAM Controller (rev 09) 00:02.0 VGA compatible controller: Intel Corporation Haswell-ULT Integrated Graphics            Controller (rev 09) 00:03.0 Audio device: Intel Corporation Haswell-ULT HD Audio Controller (rev 09) 00:14.0 USB controller: Intel Corporation Lynx Point-LP USB xHCI HC (rev 04) 00:16.0 Communication controller: Intel Corporation Lynx Point-LP HECI #0 (rev 04) 00:1b.0 Audio device: Intel Corporation Lynx Point-LP HD Audio Controller (rev 04) 00:1c.0 PCI bridge: Intel Corporation Lynx Point-LP PCI Express Root Port 1 (rev e4) 00:1c.2 PCI bridge: Intel Corporation Lynx Point-LP PCI Express Root Port 3 (rev e4) 00:1c.3 PCI bridge: Intel Corporation Lynx Point-LP PCI Express Root Port 4 (rev e4) 00:1c.5 PCI bridge: Intel Corporation Lynx Point-LP PCI Express Root Port 6 (rev e4) 00:1d.0 USB controller: Intel Corporation Lynx Point-LP USB EHCI #1 (rev 04) 00:1f.0 ISA bridge: Intel Corporation Lynx Point-LP LPC Controller (rev 04) 00:1f.2 SATA controller: Intel Corporation Lynx Point-LP SATA Controller 1 [AHCI mode] (rev 04) 00:1f.3 SMBus: Intel Corporation Lynx Point-LP SMBus Controller (rev 04) 02:00.0 Network controller: Broadcom Corporation BCM43142 802.11b/g/n (rev 01) 03:00.0 Ethernet controller: Realtek Semiconductor Co., Ltd. RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller (rev 10) 04:00.0 Unassigned class [ff00]: Realtek Semiconductor Co., Ltd. RTS5227 PCI Express Card Reader (rev 01)  installed Ubuntu 14.04 to my new machine, but the wireless does not work. I tried few tricks like rfkill command but nothing worked :( The machine does not have a wireless button. Thanks in advqce for your help

I'm having serious problems installing the Broadcom drivers for Ubuntu. It worked perfectly on my previous version, but now, it is impossible.   What are the steps to install Broadcom wireless drivers for a BCM43xx card?  I'm a user with no advance knowledge in Linux, so I would need clear explanations on how to make, compile, etc.    lspci -vnn | grep Network showed:   Broadcom Corporation BCM4322 802.11a/b/g/n Wireless LAN Controller [14e4:432b]      iwconfig showed:  lo        no wireless extensions. eth0      no wireless extensions.   NOTE: Answer below is updated every time new information is added and confirmed working.


This question has already been asked, but not exactly like this (I can't use any of the answers): I want to call a function that returns a dictionary, and if this dictionary is not None, loop on it and use its key + values on an object. NB: this object is from a class and its class can't be modified. Something like: def check_ok(s):   return {'prop_1': 'x',           'prop_2': 'y'}   def check_and_update(obj, st):     result = check_ok(st)     if result is not None:         for k, v in result.items():             obj.k = v  # doesn't work, of course  What is the solution?

Suppose I have a python object x and a string s, how do I set the attribute s on x? So:  >>> x = SomeObject() >>> attr = 'myAttr' >>> # magic goes here >>> x.myAttr 'magic'   What's the magic? The goal of this, incidentally, is to cache calls to x.__getattr__().


Has the pronoun "me" been discarded from general usage?  More and more, I hear people say something like, "He served pizza to my sister and I"  or "Between you and I, that dinner was not very good."  It seems the nominative  is out of favor.

Is it correct to say "between you and me" or "between you and I"?  I am not a native English speaker, so please bear with me.


What wire size is needed to run 100 amp service 220 feet with no more than 3% voltage drop? Running a fused disconnect off of meter on house out to detached garage.

What size of wire do I need to run from 200 amp meter panel to 100 amp sub panel in detached garage 215' away?


When I run my python script (content irrelevant for this question, just uses print a couple of times) interactively, it sends the output straight away.  When I use it in a pipe to tee or in an output redirection (./script.py > script.log) there is no output. What am I doing wrong?

Is output buffering enabled by default in Python's interpreter for sys.stdout?  If the answer is positive, what are all the ways to disable it?  Suggestions so far:   Use the -u command line switch Wrap sys.stdout in an object that flushes after every write Set PYTHONUNBUFFERED env var sys.stdout = os.fdopen(sys.stdout.fileno(), 'w', 0)   Is there any other way to set some global flag in sys/sys.stdout programmatically during execution?


When I first touched linux, I installed Zorin. It's essentially an Ubuntu fork, but the desktop is redesigned to make it look like home to a person who has been using Windows for a long time. It came with a firewall pre-installed. A few months ago I decided that some answers to questions here were pretty incompatible with Zorin (especially using the dash, as it does not exist there). The installation was also generally pretty broken.  I just noticed that Ubuntu doesn't seem to come with a firewall pre-installed. I am, unlike , pretty much a geek and I will likely have not much trouble setting it up. My question is, is it a better idea to install that firewall for this system, or leave it alone? Because it seems to not come with a firewall, but maybe there's one running in the background, where I cannot see it.  This question is also not exactly a duplicate of , that one doesn't know if they need one, I already know I need one, but I am not sure if I need to install one or if there's already one running in the background.

I am a novice at Ubuntu (12.04).  I have it on my netbook which I use mainly for surfing the net, learning python and remote desktop into my work computer.    Do I need to enable a Firewall type software?  If so, what would you suggest, and what are sensible default suggestions?


GRUB still shows Windows but it doesn't start.  I have tried using boot-repair but it gives me an error too. So I've created a .  What could be the problem, and how can I fix it?

I installed Windows on my computer, followed by an installation of Ubuntu. However, now I'm unable to boot into my Windows install.  What can I do to fix this?


Both     Bob: Who are you?      Joe: I'm Joe.   Or     Bob: Who are you?      Joe: I am Joe.   Is fine.     Bob: Are you Joe?      Joe: Maybe I am.   Seems fine, but     Bob: Are you Joe?      Joe: Maybe I'm.   Seems a bit weird. Is it correct to say it like that?

“You are” vs. “you're” — what is the difference between them?  I get confused between the two a lot. I want to understand how to use them appropriately, because I hate making mistakes.


THIS POST IS NOT A DUPLICATE ALTHOUGH IT HAS BEEN MARKED AS SUCH. NO WHERE ON THE ALLEGED DUPLICATE PAGE DOES IT MENTION EXTERNAL DRIVES OR HOW TO DIFFERENTIATE THEM INSIDE POLKIT  I did some research and found my question asked already. It is a duplicate of   the problem is, they did not answer that persons question, at all. He did not ask about encrypting a drive. His issue, as is mine, is not protecting a single flash/usb drive, it is protecting his Ubuntu system from someone inserting a usb/flash drive  He, as well as I, want Ubuntu to prompt for our password before mounting any USB drive that gets inserted. How can I do this?  I found this topic  but that is for either all drives, or for specific ones. All drives will not work for my setup, as I do not require it to mount internal drives. The individual drives setup will not work either, because in this case the UUID is unknown, so setting it up ahead of time is not possible.  I thought the original poster stated the problem well, and it was not a case of misunderstood question, the person answering just did not answer the question asked.  I went to add to that already started topic, but the guide that popped up suggested I not ask further questions if the topic is not answered. I hope I did the right thing by creating a new topic.  EDIT: More explanation was asked for. I have internal drives, that do not get mounted when the machine boots. They are dm-crypt encrypted drives that get mounted when I enter my key at the cryptsetup prompt, after the machine is booted and logged in. So requiring the password for ALL drives will not work. As I mentioned the UUID of an unknown usb/flash drive is well, unknown, so the specific drive setup in fstab will not work either. Is there a way to require it for all External drives, but not the Internal ones?  I appreciate all the suggestions, even the off-topic ones that do not answer the question I asked  EDIT again: Thinking about it, could udev be used to write some rule for this? I do not understand udev well enough yet, but it seems like that could be useful  EDIT: Anders not sure what on that page I should be looking at, but I do not see how to accomplish my goal, with info on that page. Please share your idea

I have been through this kind of feature in older versions of Ubuntu. When I'd like to mount a partition it will ask me a password. Now I want to enable that kind of feature in Ubuntu 12.04.  How can I achieve this?


I am trying to extract IPs from multiple web generated lists, and need to isolate the ones that do not end with 0.  Eg, in the list below, it has text, regular IPs and IP ranges. What I'm trying to do is to get only regular IPs and not anything that ends in a 0 or a subnet mask:  ; Spamhaus DROP List 2016/07/03 - (c) 2016 The Spamhaus Project ; http://www.spamhaus.org/drop/drop.txt ; Last-Modified: Sun,  3 Jul 2016 21:18:32 GMT ; Expires: Sun, 03 Jul 2016 23:26:45 GMT  1.0.1.0/24 223.223.176.0 129.130.100.100 1.160.118.30   If I run grep -o '[0-9]\{1,3\}\.[0-9]\{1,3\}\.[0-9]\{1,3\}\.[0-9]\{1,3\}'  it gives me:  1.0.1.0 223.223.176.0 129.130.100.100 1.160.118.30   I've tried to substitute the last part of the regex as:  grep -Eo '[0-9]\{1,3\}\.[0-9]\{1,3\}\.[0-9]\{1,3\}\.[^1-255]'   but it doesn't work.   I'm trying to minimize the use of multiple piped greps (or sed/awk) to speed up the search process.  Eg what I'm hoping to avoid is to:  grep <all IPs from list> | grep -v <all those that end in 0 or subnet>    Is it possible to use grep/sed/awk in a single line to get me those IPs? In the above example, the result should be:  129.130.100.100 1.160.118.30   Thanks

I am trying to extract IPs from a huge web generated list which contains a mix of text, IPv4 & IPv6 IPs, newlines, IP ranges etc.  Below is a snippet from the list:   ; Spamhaus DROP List 2016/07/03 - (c) 2016 The Spamhaus Project ; http://www.spamhaus.org/drop/drop.txt ; Last-Modified: Sun,  3 Jul 2016 21:18:32 GMT ; Expires: Sun, 03 Jul 2016 23:26:45 GMT  1.0.1.0/24 223.223.176.0 129.130.100.100 1.160.118.30 91.121.120.228 # 2016-07-05, ns350944.ip-91-121-120.eu, FRA, 1                         62.210.111.59 # 2016-07-05, sender9p2.offresduweb.fr, FRA, 1                             52.90.253.169 # 2016-07-05, ec2-52-90-253-169.compute-1.amazonaws.com, USA, 13                   2a01:4f8:200:2153::2 # 2016-06-27, 2a01:4f8:200:2153::2, DEU, 2                                 2601:1c1:8801:618c:9864:3f33:7569:38c4  # 2016-06-28, 2601:1c1:8801:618c:9864:3f33:7569:38c4, USA, 2 #last updated 2016.07.04 1733 UTC  1.0.1.0/24  China 1.0.2.0/23  China 1.0.8.0/21  China 1.0.32.0/19  China 1.1.0.0/24  China   For a bigger snippet, please see  This is not the full list btw, as the actual one has over 44k lines.   What I'm trying to do is to get only regular IPs (IPv4) from the list.   Here is what I ran against the above:  grep -o '[0-9]\{1,3\}\.[0-9]\{1,3\}\.[0-9]\{1,3\}\.[0-9]\{1,3\}'   and it gives me:  1.0.1.0 223.223.176.0 129.130.100.100 1.160.118.3 198.55.103.144 etc etc   Now, this is fine but I don't want anything that ends in '.0' ( eg 1.0.1.0 or 223.223.176.0) as they are IP ranges and not actual IPs. So I piped the output of the above grep to an awk statement which strips off all the IPs ending in 0.   The grep (IPs) | awk (remove those that end in 0) solution works, but I'd like to know if there is a better way to do it and minimize the use of multiple piped greps (or sed/awk).


That's my first question. Also, I'm French so I'm sorry for the mistakes I'll make.  Currently, I know how to create a deployment server (TFTP, DHCP and some ISO).  I also know some "soft" that can do local deployment (like fog) but they don't provide a true user-friendly interface (or a way to make it in html or anything else)  But I want the user booting my server to have a graphical interface where he can select which OS and which pilots.  I don't know if this is clear; I'll edit if you have a problem understanding me.  Answers to comments :      'select which OS and pilots': are you thinking of dual boot system   (Windows / Ubuntu) or of multplie linux flavors? – Marc Vanhoomissen   The client starts his computer in PXE and then selects I want to install Windows server 2008 x64 and clicks install or I want Windows 10 with the pilots for my network card and also geforce experience. I've already seen this in a company, so I know it's possible; I just don't know how.     Use syslinux to create a menu to be shown over PXE/TFTP booting from the linked post. – muru   It looks good, I'll check this out.     Possible duplicate of PXE Boot Server Installation Steps in Ubuntu Server VM – muru   No, I know how to make a PXE server (or at least, I can find out easily). The thing I'm asking is how to make a friendly-user interface with checkbox and other utilities (I think I can build it like a simple HTML form).

How can I install Ubuntu virtual machine using PXE boot server?  I need the all the configurations details and what to change in the configurations files.


My question should explain all by itself and these are my requirements:   I have few videos which I shoot myself and share them. I do not want any other restrictions on them other than that it should not be playable after a particular date or time. I would like to stick with popular codec and container format so that the viewers can view the video file in their computer or mobile (I am yet to make them and hence I think I have some control on the codecs  and containers). I do not mind playing it through an application, like wrapping a video in an executable provided, the process of making that executable is free of cost. I do not mind the viewers sharing this video with others once I can make them expire.   I have searched this site and general Google search as well. But I couldn't find one.

I am looking for the shortest comprehensive way to explain to people that are trying to use DRM as a technology to prevent users from using their data in some fashion deemed undesirable, why their solution cannot work by definition.  Ideally I'd like something that:   Covers why technically it is impossible to have people access local data, but only in such-and-such a way Imparts an understanding of why this is, to avoid follow-on "But what if" rebuttals Is intuitive enough and short enough that even a politician (j/k) could grasp it   When faced with this situation I try to be clear and concise, but I usually end up failing at least on one of these points. I'd really like to have a 'stock' answer that I can use in the future.


Does anyone know what happens to unreserved seats of Premium Tatkal. Like for a train in evening tomorrow, still 05 seats are left in 3AC against Premium Tatkal and Tatkal 3AC current status is 03 W/L while general quota waiting list is 12 W/L.  I want to ask, that after chart preparation, how will these 05 vacant seats be allotted among tatkal and waiting list/RAC?  Does anyone has any idea?

After the  of registering an account to book train tickets online using my British VISA card, I finally got into a position of being able to book a ticket, but what it appears to be telling me is that I'm only being added to a wait list, which I assume means my tickets aren't confirmed.  Can someone explain how the wait list works, and what my chances are of getting on the train successfully?    It currently says the wait list is 7 The train is the Mandor Express, from Delhi to Jodhpur on the 18th of Nov   Update: So I got the train! Although it didn't get confirmed until a few hours before it was due to leave.


Does anyone how to write this formula in Latex?

Below is an example of an asymmetrical limit (or uncertainty)  How can I typeset this in a \LaTeX equation? Such pair of numbers should be vertically stacked while being vertically center-aligned with rest of the equation. Solution $X^{+Y}_{-Z}$


List<List<String>> lists = new ArrayList();  //fileName is a list of files to iterate through and extract data from  for (int x=0; x<fileName.size(); x++) {      // CSV Reader object     CSVReader readFile = new CSVReader(new FileReader(fileName.get(x)));      String[] nextLine = readFile.readNext(); // Parses through first line with headers      /**      * Populates each array with appropriate data      */     List<String> tempList = new ArrayList();      while ((nextLine = readFile.readNext()) != null) {         tempList.add(nextLine[0]);     }      readFile.close();      lists.add(tempList);  }   My question for this is that I thought array lists were passed by reference. When I run this, I'm basically creating a list of lists, which then is populated for each file I add in. I thought that as soon as this for loop is exited, the "tempList" data would be dereferenced and be open to change in the memory. However, in my tests, the data stays in through a series of calculations without any change. What is the reason for this?  I'm passing an arraylist created in a for loop to another list of lists. Why does this temp list not get thrown into garbage collection when exiting the for loop?

I always thought Java uses pass-by-reference. However, I've seen a couple of blog posts (for example, ) that claim that it isn't (the blog post says that Java uses pass-by-value). I don't think I understand the distinction they're making. What is the explanation?


how to verify that new user was added to group?  example  by this syntax I will add the user dog to group - white_house_group   usermod -a -G white_house_group dog   after that , how to verify that user dog is really in white_house_group group?

we add the following user to the group white_house  kuku , trump , karter  usermod -a -G white_house kuku usermod -a -G white_house trump usermod -a -G white_house karter   as all know we can verify that users was added to the group by   grep white_house /etc/group   but is it possible to verify it by some command line or more elegant way ?


I've recently installed Ubuntu on my mac book pro with retina display and am able to dual boot into both Ubuntu and OS X with no issues. The current problem I'm having is that I cannot seem to find any networks whatsoever when I'm in Ubuntu, but on OS X, I'm connected to my home WiFi. Please Help! Wireless card: BCM4331 802.11a/b/g/n

I'm having serious problems installing the Broadcom drivers for Ubuntu. It worked perfectly on my previous version, but now, it is impossible.   What are the steps to install Broadcom wireless drivers for a BCM43xx card?  I'm a user with no advance knowledge in Linux, so I would need clear explanations on how to make, compile, etc.    lspci -vnn | grep Network showed:   Broadcom Corporation BCM4322 802.11a/b/g/n Wireless LAN Controller [14e4:432b]      iwconfig showed:  lo        no wireless extensions. eth0      no wireless extensions.   NOTE: Answer below is updated every time new information is added and confirmed working.


In Avengers: Infinity War Thanos wants to kill half the population of the universe, that's clear. And he wants to do that totally in random as well.  So, since he's also part of the universe population, does it mean that there is 50% chance he would die when he would finally snap his fingers after getting all the stones and his wish came true?

The title is extremely vague, because this question contains HEAVY spoilers for Avengers: Infinity War, specifically the very last scenes of the movie. I can't reasonably put the entire question in spoiler tags, so consider this your warning.  At the end of the movie, Thanos pretty much wins. He gets all the Infinity Stones, Gamora and Vision have been brutally murdered, and the rest of the cast completely beaten. Nobody could stop him. So he executes his plan.  As far as I know (unless I missed something), his plan is to eradicate exactly half of all mortals in the universe, and from his own words, in a fair lottery (random chance), without taking into account a person's wealth, social status, or anything else. Pure chance decides whether you are sacrified for the greater good or live through this greater good (according to him).  During the movie, Thanos and one of his underling (Ebony Maw) say themselves that being sacrified is an honor and should be appreciated. As you would expect, most people do not appreciate being sacrified.  At the end of the movie, Thanos uses all 6 stones to do a finger snap, deleting half the universe.  The question is: Did he exclude himself from the targets? Was there a 50% chance that Thanos himself would disappear right there?  As far as I know, this is not explicitly answered in the movie itself. I am looking for similar situations in the comics (or in the movie if I happened to miss something) where you could know, or have an educated guess, as to Thanos being the kind of person who follows through to the end, even if it means dying, or the kind of person who gets scared of death when it comes down to it, and comes off as an hypocrite.  Some people also mentioned his "deal" with Strange would make him spare Tony from the snap too. I'm also wondering about that, if there is a link between the two, but it's not the focus of the question.  The reason I'm wondering is that Thanos seems to me like a very extreme utilitarist. Even though he might be wrong about the value of his plan (Do the remaining half really become happy?), in-universe it seemed successful at least once (Gamora's home planet), so his reasoning is not bad, even if the premise might be horribly flawed. Excluding himself from the snap would make it into a straight villain, while considering himself equal to the rest would make him into a wannabe hero with very very evil methods. This makes a huge difference in the interpretation of the movie and his character.


Suppose for  $\forall  [\alpha,\beta]\subset(-\infty,+\infty), f\in\mathcal{R}[\alpha,\beta]$, and $\exists ~p>0$, and  $\int_{-\infty}^{+\infty}|f|^p\mathrm dx$ exists.Prove: $$\lim_{h\to0}\int_{-\infty}^{+\infty}|f(x+h)-f(x)|^p\mathrm dx=0$$ This question seems difficult for me to deal with, I think maybe I can use one continuous function to approach it or something like that, however, I do not know how to start. Since I haven't learn real analysis, so can you give me some primary solutions? Sincerely thanks for your help.

I am having a hard time with the following real analysis qual problem.  Any help would be awesome.  Suppose that $f \in L^p(\mathbb{R})$, where $1\leq p< + \infty$. Let $T_r(f)(t)=f(t−r)$. Show that $\lim_{r \to 0} \|T_rf−f\|_{L_p} =0$, that is $$ \lim_{r\to 0} \left( \int_{\mathbb R} |f(t-r) - f(t)|^p \mathrm d t\right)^{1/p} =0.$$