Apt-get update not working in Ubuntu 16.04 "temporary failure resolving"

First of all I am new to Linux command line. I never worked with it before. My problem is that the command apt-get update will just return:  Err:1 http://us.archive.ubuntu.com/ubuntu xenial InRelease   Temporary failure resolving 'us.archive.ubuntu.com' Err:2 http://us.archive.ubuntu.com/ubuntu xenial-security InRelease   Temporary failure resolving 'us.archive.ubuntu.com' Err:3 http://us.archive.ubuntu.com/ubuntu xenial-updates InRelease   Temporary failure resolving 'us.archive.ubuntu.com' Reading package lists... Done W: Failed to fetch http://us.archive.ubuntu.com/ubuntu/dists/xenial/InRelease  Temporary failure resolving 'us.archive.ubuntu.com' W: Failed to fetch http://us.archive.ubuntu.com/ubuntu/dists/xenial-security/InRelease  Temporary failure resolving 'us.archive.ubuntu.com' W: Failed to fetch http://us.archive.ubuntu.com/ubuntu/dists/xenial-updates/InRelease  Temporary failure resolving 'us.archive.ubuntu.com' W: Some index files failed to download. They have been ignored, or old ones used instead.   My sources.list file looks like this:  #------------------------------------------------------------------------------# #                            OFFICIAL UBUNTU REPOS                             # #------------------------------------------------------------------------------#   ###### Ubuntu Main Repos deb http://us.archive.ubuntu.com/ubuntu/ xenial main restricted universe multiverse  deb-src http://us.archive.ubuntu.com/ubuntu/ xenial main restricted universe multiverse   ###### Ubuntu Update Repos deb http://us.archive.ubuntu.com/ubuntu/ xenial-security main restricted universe multiverse  deb http://us.archive.ubuntu.com/ubuntu/ xenial-updates main restricted universe multiverse  deb-src http://us.archive.ubuntu.com/ubuntu/ xenial-security main restricted universe multiverse  deb-src http://us.archive.ubuntu.com/ubuntu/ xenial-updates main restricted universe multiverse   My ubuntu version is:    Ubuntu 16.04.2 LTS (GNU/Linux 4.4.0-66-generic x86_64)


There does not exist group $G$ such that Aut$(G)\cong \mathbb{Z}_n$ (for odd $n$)

I had this "almost bonus" question on the final in Group Theory recently: prove that there is no such group $G$ which would satisfy Aut$(G)\cong \mathbb{Z}_n$, where $n$ is an odd integer. I don't have much certainty if this proof is OK, and one's opinion would be appreciated.  Here's my attempt:     Suppose that there exists such a group $G$ that satisfies the above condition. Since $\mathbb{Z}_n$ is cyclic, Aut$(G)$ is also cyclic and $G$ is abelian, which implies that Inn$(G)\cong \{e\}$. Thus Aut$(G)=$Out$(G)$. (I don't think this fact is important here though). Now, since an automorphism sends a generator to a generator, and since each automorphism is completely determined by such mapping, |Aut($G$)| must be of factorial order. But an integer factorial is always even. However, $|\mathbb{Z}_n|$ is odd, which is a contradiction. Therefore, no such $G$ exists.   I'm afraid that my proof is not very nice, but at least a genuine attempt was made.


Since $\infty>0$, so $1/\infty >0$, thus I think $1/\infty$ should be infinitesimal, but the calculus book says  $$\lim_{x \to \infty} \frac{1}{x}= 0$$  So is $1/\infty$ zero or infinitesimal ?  P.S. I mean are $1/\infty$ and $\lim_{x \to \infty} 1/x$ the same thing here?


I work in an office as "kind of" an IT person. I have lots of hardware/software experience, but not in any enterprise capacity.  There are 140 computers total, and they want me to update all of them to Windows 7 (currently on Windows XP). They are all networked. I have created a custom ISO with all the pre-installed software they use. I want to push all of these out to install Windows 7 all at once rather than going from computer to computer.  What is the easiest/fastest/best method of achieving this? I am new to this type of work, so I could use lots of resources tips.


What does the big intersection or union sign of a set mean?

In some cases, we will have to consider the union or the intersection of several, even infinitely many sets, defined in the obvious way. For example, if for every positive integer $n$, we are given a set $S_n$, then   $$\bbox[border:1px solid red]{\bigcup_{n=1}^\infty S_n}=S_1\cup S_2\cup\cdots=\{x\mid x\in S_n\text{ for some }n\},$$   and   $$\bigcap_{n=1}^\infty S_n=S_1\cap S_2\cap\cdots=\{x\mid x\in S_n\text{ for all }n\}.$$   Two sets are said to be disjoint if their intersection is empty. More generally, several sets are said to be disjoint if no two of them have a common element. A collection of sets is said to be a partition of a set $S$ if the sets in the collection are disjoint and their union is $S$.   Normally what I know is that you can make a union or an intersection between only two sets. In this expression, there is a big union of sets. I'm asking about the meaning of this expression – what does it mean? What does the infinity sign do at the top?  Things are even more complicated with De Morgan's laws, which use the same expression:     Two particularly useful properties are given by De Morgan's laws which state that   $$\left(\bigcup_nS_n\right)^c=\bigcap_nS_n^c,\quad\quad\quad\quad\left(\bigcap_nS_n\right)^c=\bigcup_nS_n^c.$$   Anyone who can explain to me the expression or De Morgan's laws would be much appreciated.


WordPress .click or .on is not working while loaded from function.php

I had this script working before when it was just an inline script on a WordPress page. But now I load it from function.php.  This works fine for my other JavaScript scripts, but .click or .on won't work on this script...  $( "td.event-test" ).on("click",   function() {     $("p").empty();     $(".event-title").empty();     $(".event-title2").empty();     $("
EVENT #01
").appendTo(".event-title");     $("
Here is information for event!
").appendTo(".event-info");     $("
more info for event
").appendTo(".more-event-info");     $("
LINK TO EVENT SITE
").appendTo(".event-link");     $("a").attr("href", "events");   } );   It won't work, and the .click version won't work either:  $( "td.event-test" ).click(   function() {     $("p").empty();     $(".event-title").empty();     $(".event-title2").empty();     $("
EVENT #01
").appendTo(".event-title");     $("
Here is information for event!
").appendTo(".event-info");     $("
more info for event
").appendTo(".more-event-info");     $("
LINK TO EVENT SITE
").appendTo(".event-link");     $("a").attr("href", "events");   } );   It loads the script as I can see console.log printing "test" string from the first line of the JavaScript script.


Why can batteries store much more energy than capacitors even though they are much smaller?

Why are batteries significantly smaller than capacitors yet can store much more energy ?


From the limit definition of differentiability, determine where the function $f(x) = \sqrt{x}$ is differentiable?

For the function $f(x) = \sqrt{x}, \hspace{2 mm} f: [0, \infty) \rightarrow \mathbb{R}$, I wish to find all points $a$ at which $f(x)$ is differentiable, from the definition $$ f'(x) = \lim_{x \rightarrow a}\frac{f(x)-f(a)}{x-a} $$  Clearly, for our function $f(x) = \sqrt{x}$, this gives us $$ f'(x) = \lim_{x\to a}\frac{\sqrt{x} - \sqrt{a}}{x-a} $$  So the question boils down to showing for what values of $a$ this limit exists. How would this be done? Intuitively, I know that the answer is that the limit exists for all $a \in [0, \infty)$ and is given by $\frac{1}{2 \sqrt{a}}$, but I'm unsure of how to prove this from the limit definition of differentiability.


Program Won't Read all of the data from the File

So the gist of my program is that it will read some commands from a file and then perform certain operations judging by the commands. My problem is that my code isn't reading all of the lines of the txt document. Specifically, it reads the first four lines which I tested by previously inputting a print statement inside of the if statement that tests to see if the input = "P". Any help would be much appreciated.  Here is the txt document as well  P e1 10 5  P e2 19 5  P e3 11 5  P e4 18 5  R mouth 10 10 10 2  S nose 14 7 2  P p3 9 9  P p4 20 9  D  Y bad command  M p3 9 12  M p4 20 12  D    public static void main(String[] args) {            String filename = args[0];           File file = new File(filename);            Scanner input=null;            try {                 input=new Scanner(file);              }           catch(java.io.FileNotFoundException ex) {                System.out.println("ERROR: Couldn't open file: " + file);                System.exit(1);           }            AsciiDisplay asciiDisplay= new AsciiDisplay();            while(input.hasNext()) {                if(input.next().equals("P")) {                      String id=input.next();                     int x=input.nextInt();                     int y=input.nextInt();                     Coordinate coordinate=new Coordinate(x,y);                     Point point=new Point(id,coordinate);                     asciiDisplay.addShape(point);                 }                else if(input.next().equals("R")) {                     String id=input.next();                     int x=input.nextInt();                     int y=input.nextInt();                     int length=input.nextInt();                     int height=input.nextInt();                     Coordinate coordinate= new Coordinate(x,y);                     Rectangle rectangle= new Rectangle(id,coordinate,length,height);                     asciiDisplay.addShape(rectangle);                 }                 else if(input.next().equals("S")) {                      String id=input.next();                     int x=input.nextInt();                     int y=input.nextInt();                     int size=input.nextInt();                     Coordinate coordinate= new Coordinate(x,y);                      Square square = new Square(id,coordinate,size);                     asciiDisplay.addShape(square);                 }                 else if(input.next().equals("M")) {                      String id=input.next();                     int x=input.nextInt();                     int y=input.nextInt();                     Coordinate coordinate= new Coordinate(x,y);                     asciiDisplay.moveShape(id,coordinate);                 }                 else if(input.next().equals("E")) {                      asciiDisplay.deleteAll();                 }                 else if(input.next().equals("D")) {                     asciiDisplay.updateGrid();                     asciiDisplay.printGrid();                 }                else if(input.next().equals("X")) {                   System.out.println("Invalid command: X");                  }             }      } }


Can I see which gym I put my Pokemon on?

I went out last night and places several Pokemon on gyms. Now it is the morning and only one remains where I placed them, but I can't remember which gym I put this Pokemon on. Is there a way to get the game to tell me?


I am using a list of list as follows:  L = [['a', 4], ['b', 2], ['c', 13]]   I want to generate a new list for all the numbers which are in the second position in each set of the list:  L =  [4, 2, 13]   Is there any shortcut in python to get the above list?


How can I prevent pgfplots from rendering lines incorrectly when I use "no markers"?

I plot tabular data wherein none of the y-values of the data go above 1.0. In the resulting plot, however, there are a couple of peaks that go beyond 1.0, giving a false impression about those data points:   This is not visible when I plot with marks, but I need to use "no marks" because it is otherwise far too busy (80 points in a small plot).   How can I prevent this?  Update: Per Jake's request, here's a minimal example that shows the described behaviour:  \documentclass{article} \usepackage{pgfplots} \begin{document}     \begin{figure}[ht]         \begin{tikzpicture}             \begin{axis}[no markers, grid=major]                 \addplot coordinates{(0, 0.0000000000)                                      (1, 0.8823529412)                                      (2, 0.8750000000)                                       (3, 1.0000000000)                                       (4, 0.8666666667)                                      (80, 0.0000000000)}[thick];             \end{axis}         \end{tikzpicture}     \end{figure} \end{document}   The problem is less pronounced when I don't make my lines thick, but it is still there (and I want thick lines).


Date Conversion from string to java.util.Date and then to java.sql.Date

I need to convert below String to java.util.Date  String dtm = "2014-05-26T00:00:00Z"; Then i need to convert this Date to java.sql.Date format like  java.sql.Date sqlDate = (java.sql.Date) utilDate;   One more thing 1. I need to convert the below string to "2001-12-17T09:30+08:00" to java.util.Date and then i need to convert this in reversely  Please help me. i can only use Date object and should convert in this way (java.sql.Date) utilDate


nodes near coords with logarithmic axis: Wrong values

I created a horizontal bar plot to compare benchmark times. Since one of the tested components is really slow, I need a logarithmic y axis for the other values to be distinguishable. Combined with "nodes near coords" this results in the calculated values showing, instead of the original ones. Is there any way to fix this?  What it looks like:   What the values(!) should look like:   Clearly, I'm overlooking something terribly obvious. I'm just a beginner at PGFPlots, so please don't kill me. :)  MWE:  \documentclass[fontsize=12pt]{scrartcl}  \usepackage{pgfplots} \pgfplotsset{compat=1.8}  \begin{document}   \begin{tikzpicture}   \begin{axis}[      width=12.5cm,     xbar=0.1cm,     xmin=0,     y=0.6cm,     bar width=0.4cm,     xlabel={Time (ms)},     xmode=log,     major x tick style = transparent,     major y tick style = transparent,     symbolic y coords={       {SpreadsheetGear},       {Aspose.Cells},       {NPOI},       {C1.Excel},       {Spire.XLS},       {GemBox.Spreadsheet},       {SmartXLS},     },     ytick=data,     y dir = reverse,      nodes near coords,     nodes near coords align={horizontal},   ]    \addplot coordinates {       (3078.6,{Aspose.Cells})       (10059.2,{C1.Excel})       (28794.8,{GemBox.Spreadsheet})       (7437079.8,{SmartXLS})       (19975.2,{Spire.XLS})       (573.2,{SpreadsheetGear})       (10025.2,{NPOI})};   \end{axis}   \end{tikzpicture} \end{document}


I am using apacite and it replaces more than 6 authors with an ellipses in the references section. How can I get it to show all of the authors?


Existence of area-preserving diffeomorphism between two sets in $\mathbb{R}^2$

Suppose that we have open sets $A, B\subset \mathbb{R}^2$ such that $A$ and $B$ are simply connected and have smooth boundaries. Furthermore, let us assume that $m(A) = m(B) > 0$, where $m$ is the Lebesgue measure on $\mathbb{R}^2$. My question is as follows: when does there exist an area-preserving diffeomorphism between $A$ and $B$? In this context, an area-preserving diffeomorphism between $A$ and $B$ is a is a $C^{\infty}$-diffeomorphism $\phi : A\to B$ such that $m(S) = m(\phi(S))$ for all measurable $S\subseteq A$. If an area-preserving diffeomorphism doesn't always exist between sets $A$ and $B$ as above, are there any extra conditions we can impose on $A$ and $B$ such that there does exist an area-preserving diffeomorphism?  My thoughts thus far are that we always have a $C^{\infty}$-diffeomorphism between $A$ and $B$: this is a consequence of the . It's also obvious to me that if we can deform $A$ linearly to get $B$, then that deformation will be area-preserving. Furthermore, it seems that aside from this case, there's no reason why an area-preserving diffeomorphism should exist. However, I'm having a hard time proving that there necessarily isn't an area-preserving diffeomorphism between $A$ and $B$ if $B$ is not a linear deformation of $A$. Does anybody have any ideas?


C++ - Do virtual methods cause overhead in non-virtual methods calls?

Theoretically, what is the overall overhead on a class with a virtual method. Is the overhead limited to calls to the virtual methods or will other non-virtual methods suffer overhead as well?   For example, when a class has a virtual destructor but all other methods are non-virtual.  class Vehicle {      int mass;      public:     Vehicle(int mass) : mass(mass) {}     virtual ~Vehicle() {}     int getMass() { return mass; } };  class Car : public Vehicle  {     WheelSet* wheels;      Car(WheelSet* ws) : Vehicle(1500), wheels(ws) {}     ~Car() { delete wheels; }     int getWheelCount() { return wheels->count; } }  int main() {     Car* car = new Car(new WheelSet());     Vehicle* v = car;      int a = c->getWheelCount();  // calls non-virtual derived method     int b = c->getMass();  // calls non-virtual base method from derived pointer     int c = v->getMass();  // calls non-virtual base method from base pointer      delete v;  // calls virtual method (the destructor) }   Are there any overhead when calling these non-virtual methods? Or only virtual method calls have overhead (the call to the destructor in this case)?  EDIT:  The point of this question is to know whether the presence of virtual functions affect the performance of other non-virtual methods. Other questions on this forum already provided answers about the performance comparison of virtual/non-virtual/inline methods.


How to check computer's timezone through Terminal?

I am writing a bash script which at some point needs to determine a user's timezone, so how exactly can I check the timezone in Terminal? I would like to be able to get output in terms of GMT and UTC. Though if I can get the output in terms of any others then a list of those and how to get them would be nice. I am running Ubuntu GNOME 15.10 with GNOME 3.18.


I have a MacBook Pro Retina (2015). After updating to OS Mojave, Bluetooth has stopped working. I get an error message that "No Bluetooth Hardware Found".  I have already tried to do the following:   Go to the /Library/Preferences and delete the com.apple.Bluetooth.plist file Successfully resetting SMC. (pressing Shift+ctrl+alt + power button) Removing the Bluetooth icon from the menu bar    None of the above solutions has worked for me.


TL;DR If it takes 90 minutes to roast a leg of lamb at some temperature (perhaps somewhere from 350 to 450 °F?), and it takes 840 minutes to slow-roast a leg of lamb of the same exact weight at some other temperature (possibly 175 to 275 °F?), what is the temperature setting that one should use if one wants the leg of lamb to spend 420 minutes in the oven? Is it suitable to calculate the temperature using linear interpolation? The mid-length story: The purpose of the question is to avoid the tyranny of recipes, where I have to go to my tablet, computer, or book shelves to do anything. I'd like to understand the ideas (in this case, for roasting lamb or beef) well enough to be able to cook without the handholding of recipe authors. In this era of internet-sourced recipes, recipes seem to be, by and large, copied, or inspired (possibly even sometimes plain plagiarized). For example, search online for "roast leg of lamb" and you will find a hundred pundits claiming to provide a recipe. Search for "slow roast leg of lamb" and you will find more results. But these recipes are not gospel. We should be able to do anything we want, so long as it's flavorful and healthy. Is there such a thing as semi-slow, average-slow, and rather-fast-than-slow roasting, or are we stuck with just "roasting" and "slow roasting"? The long story: Cooking a whole lamb, starting by  it, will have to remain a 5- or 10-year project, when I will know that I can nail every detail right, and when I will know that a 40-or-so-large family reunion will happen, if they're ever in the same place at the same time. At this time I have the much more modest objective of properly cooking a leg of lamb, defrosted for 36 hours in the fridge  and smeared with mustard, rosemary, and garlic  My intention was to leave it in the oven overnight at 275 °F / 135 °C. Slow roasting is much more of a foolproof method, because I don't have to calculate precise minutes-per-weight numbers. If it's in the oven two hours more or an hour less, it's still perfectly alright. (Yes, yes, no need to lecture me about food safety; I do make sure that the internal thermometer reading reaches whatever the thermometer says.) Here is the problem: I really don't want the flavor, the texture, or, as mentioned above, the time sensitivity of roasting at 375 °F / 190 °C. I would like the fall-off-the-bone tenderness of 275 °F / 135 °C, but. I was much too tired (tennis for just one hour did it) to think about standing on my feet for the 5-10 minutes that it takes to prepare the roast before going to bed. I'm starting to roast early in the morning instead, for guests who will arrive 420 minutes after the roast went to the oven. If I need 90 minutes at 375 °F / 190 °C and 840 minutes (14 hours) at 275 °F / 135 °C, I am speculating that there is a precise temperature that I can use for 420 minutes, and the roast will be just perfect when the guests arrive. (Then the roast will rest outside during chatting and appetizers.) How do I determine roasting temperature as a function of time? Would, for example, linear interpolation 375 + (420-90) * (275-375) / (840-90) = 331 °F  make sense? N.B.: This might be a difficult question, in the sense that cookbooks do not discuss it. Feel free to "throw me a bone", figuratively speaking, and make a suggestion that I can try. If the roast is under-cooked, I can always use one of various remedies and apologize that I didn't get it quite right. The guests will be gracious. But if a better answer comes along later, it's fairer, and better fitting for a reference site, that I update the "correct" answer. Cooking is an art form anyway. There isn't just "right" and "wrong".


I have read "" which claims to observe diffraction patterns in objects of around 10'000 amu. What is the largest mass objects shown to have diffraction patterns and show wave-particle duality? I have heard a claims of this type have been shown for small amino acids, and possibly protein strands or even small viruses, but have struggled to find any references.


Let IG denote Inverse-Gamma distribution   .   If $X\sim IG(\alpha,1)$ and $Y\sim IG(\beta,1)$. Show that   $\frac{X}{X+Y}\sim Beta(\alpha,\beta)$   I tried with jacobian transformation taking $Z=\frac{X}{X+Y}$ and $W=Y$ then $$X=\frac{WZ}{1-Z};Y=W$$  $$\frac{\partial(z,w)}{\partial(x,y)}=\frac{1}{(1-z)^2}$$  $$f_{z,w}(z,w)=f_x(\frac{wz}{1-z})f_y(w)(1-z)^2$$ $$f_{z,w}(z,w)=\frac{1}{\Gamma{(a)}}(\frac{wz}{1-z})^{-\alpha-1}e^{-\frac{(1-z)}{wz}}\frac{1}{\Gamma{(\beta)}}w^{-\beta-1}e^{-\frac{1}{w}}(1-z)^2$$  but I'm stuck, in some place I read that $\frac{X}{X+Y}$ is a type 3 Beta distribution, but I can't show that.


How can I tell if two Minecraft mods are compatible?

If I want to use two mods together, e.g.  and  (which don't state compatibility with one another), how can I tell if they will work together (and not break Minecraft - forcing me to re-download a fresh copy)?


I am a real estate agent and have a canon 400 D with a wide angle lens EFS 10-18mm and a tripod. I know nothing about photography and the homes I photograph have all beautiful window views being a coastal town.Please help me with taking the photos as well as editing in photoshop CS 5 extended. I have no plugin programs and no external light source as well as no money to spend on expensive gear (need to sell a few houses first) I need to have camera settings for normal lighting as well. I have been through lots of tutorials but cannot get anything right.


Prove for any $\sum_{i=1}^n f_i^2 = f_n \times f_{n+1}$ using Fibonacci numbers

I want to prove the below:  $$\sum_{i=1}^n f_i^2 = f_n \times f_{n+1}$$  The example of $n = 1$ is trivial:  $$\begin{align} \sum_{i=1}^1 f_i^2 &= f_1^2 \\ &= 1^2 \\ &= 1 \times 1 \\ &= f_1 \times f_2 \end{align}$$  And working through $n=2$:  $$\begin{align} \sum_{i=1}^2 f_i^2 &= f_1^2 + f_2^2 \\ &\stackrel{?}{=} f_2 \times f_3 \end{align}$$  Using the definition of a Fibonacci number, I can work backwards from $f_2 \times f_3$:  $$\begin{align} f_2 \times f_3 &= (f_{2-1}+f_{2-2}) \times (f_{3-1}+f_{3-2}) \\ &= (f_1 + f_0) \times (f_2 + f_1) \\ &= f_1f_2 + f_1f_1 + f_0f_2 + f_0f_1 \\ &= f_1f_2 + f_1^2 \end{align}$$  Since $f_2 = 1$, $f_1f_2 = f_2f_2 = f_2^2$, thus $f_2 \times f_3 = f_1^2 + f_2^2$.  But how could I generalize this for any $n$ and not show examples for $n=3$, $n=4$, etc?


Not sure if someone else has already raised this - I've got eleven notifications that I've received a Caucus badge on English Language Learners. Perhaps one notification for each community that I'm a member of?  I am a member of the community, and did visit the election. Also, the badge hasn't been awarded more that once (so I think it's just the notification that's at fault).  Note that this seems to happen for other badges, it has been reported for: Caucus, Nice Answer, Enthusiast.


How to login on Gmail without the phone?

My phone was stolen, I'm trying to login to Gmail, but since Gmail sends a code when you log in I can't get the code. I still know my password but it still asks for the code.  I tried my recovery mail but it says:     There's no Google account with the info that you provided.   But I provided the right info. Is it still possible to retrieve my account?


What is this grammar structure, adding a noun after the verb "stand"

I have been reading The Dark Elf trilogy and one sentence got my attention, and I don't know what grammar structure is behind the sentence which justifies its grammatical correctness. The sentence is:  "Where, in ages past, there had been an empty cavern of roughly shaped stalactites and stalagmites now stands artistry."  I do understand the meaning of "stands artistry" means the cavern now looks good, but I can't search other similar usage of adding a noun after the verb "stand".


Can a returning US citizen elect not to use the automated passport kiosks?

I'm a US citizen. Every time I use the automated passport kiosks, regardless of the airport or who I'm travelling with, they always give me an X. This means I get to stand in yet another line and get all-but-waved-through when I eventually get to the officer.  In the interest of not having to stand in the first line for the kiosks, am I allowed to just go to the visitors line instead? Or will I get sent back and told to use the kiosks? Or is there some other way to opt out of their use?  When I flew from Guangzhou to LAX in June, I stood in the kiosk line a full 45 minutes, only to receive an X and get sent to the visitors line for another 35 minutes. This is what I'm trying to avoid. Clearly it doesn't matter when flying into, say, BWI where there are no kiosks (and you're going to wait 2 hours for your luggage anyway), but rather for the airports that do have the kiosks. At LAX, everyone in the US citizen line was directed to kiosks.


The logo for Netflix's  shows an upside-down & mirrored American Flag with 0 stars on it.  What does this logo represent in terms of the show?  Is it meant to be symbolism with the themes of the show, or just simple dramatic flair?


When do we need to put a comma after "so" at the beginning of a sentence?

I noticed that most of the times when the conjunction "so" is used at the beginning of a sentence, it is followed by a comma:     So, this gets published but the fact that it is inaccurate gets moderated out.   Occasionally, I find sentences with no comma after "so":     So he went to Ishmael and married Mahalath.   I am guessing that whether to put comma or not after the "so" conjunction is related to the context and emphasis rather than to the sentence structure, but I am unable to pinpoint it out.  So when do we need to put comma after "so"? (← Do I need a comma after the "so" here?)  P.S.: I know there is another usage of "so" as an adjective or an adverb, in which case no comma is necessary, for example: "So big is the caravan that it cannot fit into the garage."  P.S.: I did skim through the list of questions with [comma] tag, and found no question on this conjunction yet.


Does performing a statistical analysis for a biologist warrant authorship?

I have a question, regarding authorship in a publication.  A colleague of mine who is a biologist (from a different group) received the second revision of her/his paper and in the revision it's been asked to do Anova in order to illustrate the significant change between 4 groups.  I'm saying a colleague not a friend! and also they may come more and more in the future.   I don't want to sound like a cheeky person, but have no idea whether if I do it I should be included in the paper or I should just do it as if I'm doing it for a so called friend!  Should I be at least included in the acknowledgement, or?  I have no access to my boss to consult this with him. I would appreciate your help to make this point clear to me.  Thanks!


Asymptotic distribution of a weighted sum of chi squared variables beyond CLT?

I have a sum $$ S = \sum_{i=1}^{n} d_i X_i^2, $$ where $X_i$ are independent standard normals, and $d_i > 0$ are fixed real numbers, for example $d_i = i$. The asymptotic distribution of this sum is given by the central limit theorem as $\mathrm{N}(\sum d_i, 2\sum d_i^2)$, and according to the , this approximation has error on the order $n^{-1/2}$.  When $n$ is not large enough that I can ignore terms $O(n^{-1/2})$, is there a way to derive a more accurate asymptotic distribution in a tractable closed form, such that the error would be $O(n^{-1})$ or better? For fixed $n$, the CLT also gives a poor approximation of the tail of the distribution.  Does there exist a "universal" distribution that I could use for $S$ in the general cases (like the normal distribution in the CLT, but with extra accuracy). For example, what if $X_i^2$ are i.i.d. Beta random variables instead?


Is regression line (for a simple "Y given X" regression, no interaction etc) always unique?

Is it possible for more than one "linear regression" line to fit a given set of points? (i.e.... "least squares" is minimised equally in both cases)  I'm assuming a simple one-variable regression in which we have a single "dependent" variable for a given x-value. It may be that regression is forced "through the origin" for the purpose of the Q (if that matters), so, I know it wouldn't be a great fit.  Or is there something intrinsic about a regression line that means it is unique? I am interested in a 'proof' (could be just an intuitive proof) if it exists, that a regression line must be unique.


On the equation $f(x^2+y+f(y))=2y+f(x)^2.$

If $f:\mathbb{R}\to\mathbb{R}$ satisfies $f(x^2+y+f(y))=2y+f(x)^2,$ prove that $f(x)=x$ for all $x.$  Here's my work so far: $x=0$ gives that $f$ is surjective. Let $f(c)=0.$ Then $x=y=c$ gives $f(c^2+c)=2c,$ so $f(f(c^2+c)/2)=0.$ From $y=0,$ we have $f(x^2+f(0))=f(x)^2,$ so $f$ is non-negative for $x≥f(0).$ Let $y=-x^2$ to obtain $f(f(-x^2))=f(x)^2-2x^2;$ not sure what to do with this observation just yet.  Let $f(y)=-x^2$ to obtain $2y+f(x)^2=-x^2,$ which becomes $f(-0.5(x^2+f(x)^2))=-x^2.$ From $x=y=0,$ we have $f(f(0))=f(0)^2.$ Now we get $f(-0.5f(f(0))=0.$ Put $y=0$ to get $f(x^2+f(0))=f(x)^2.$ Now the FE becomes $f(x^2+y+f(y))=2y+f(x^2+f(0))$ and we have rid ourselves of that pesky "square of a function" term.  Some plans of attack:    Prove that $f(0)=0.$ Prove that $f$ is injective. Prove that $f$ is increasing.   Any ideas on how to accomplish any of these? Any ideas on alternative approaches? What's next? Am I close to solving the problem?


Is my proof of irreducibility of ${(x - a_1)}^2{(x - a_2)}^2 \; \cdots \; {(x - a_n)}^2 + 1$ over $\mathbb{Z}$ correct?

I have the following problem to solve      If $a_1, a_2, ... , a_n$ are disitinct integers. Show that    ${(x - a_1)}^2{(x - a_2)}^2 \; \cdots \; {(x - a_n)}^2 + 1$ is irreducible   over $\mathbb{Z}$.   This is my attempt at the proof:  We know as a consequence of the Fundamental Theorem of Algebra that any polynomial $p(x)$ can be written as $p(x) = \beta(x - \alpha_1)(x - \alpha_2)\cdots (x - \alpha_k)$ where $\alpha_i \in \mathbb{C}$ are zeros of $p(x)$.    So if $p(x) = {(x - a_1)}^2{(x - a_2)}^2 \; \cdots \; {(x - a_n)}^2 + 1$ be written as $p(x) = \beta(x - \alpha_1)(x - \alpha_2)\cdots (x - \alpha_k)$ then by the remainder theorem we need $p(\alpha_i) = 0$ for $1 \le i \le k$. So $p(\alpha_i) = {(\alpha_i - a_1)}^2{(\alpha_i - a_2)}^2 \; \cdots \; {(\alpha_i - a_n)}^2 + 1$.  Now two cases arise:    If $\alpha_i \in \mathbb{R}$ then obviously for $j$, $1 \le j \le n$ we have ${(\alpha_i - a_j)}^2 \ge 0$ so overall $p(\alpha_i) \ge 1$. Thus $p(x)$ is irreducible.  If $\alpha \in \mathbb{C} \setminus \mathbb{R}$.  I don't know how to proceed for this case. I thought that both the imaginary and real parts should be equal to $0$ but I don't know how to prove it. Can anyone help me with this part? .   Define $z_k = {(\alpha - a_k)}^2 = |z_k|e^{i \theta_k}$. Assume $\alpha$ is a complex root of $p(x)$ then $p(\alpha) = 0$, i.e,   $$ z_1z_2 \; \cdots \; z_n + 1 =0 $$  Now applying the complex conjugate operator on both sides we get   $$ \bar{z_1} \bar{z_2} \; \cdots \; \bar{z_n} + 1 = 0$$  Now equating these two equations and noting that $\bar{z_k} = |z_k|e^{-i \theta_k}$ we get   $$z_1z_2 \; \cdots \; z_n = \bar{z_1} \bar{z_2} \; \cdots \; \bar{z_n}$$ $$ \implies |z_1||z_2|...|z_n|e^{i(\theta _1 + \theta _2 + \dots + \theta_n)} = |z_1||z_2|...|z_n|e^{-i(\theta _1 + \theta _2 + \dots + \theta_n)}$$  $$ \implies e^{2i(\theta _1 + \theta _2 + \dots + \theta_n)} = 1$$ $$ \implies \theta _1 + \theta _2 + \dots + \theta_n = 0$$  Now consider $$p(\alpha) = z_1z_2 \; \cdots \; z_n + 1 = |z_1||z_2|...|z_n|e^{i(\theta _1 + \theta _2 + \dots + \theta_n)} = |z_1||z_2|...|z_n|e^{i(0)} = |z_1||z_2|...|z_n|$$  But $|z_1||z_2|...|z_n| > 0$ so overall we get $p(\alpha) > 1$ and this contradicts our assumption and our proof is complete.   I am new to solving these types of problems, so I would like to know whether my proof is correct.   P.S I had seen a  to this. But in that, the solution uses Gauss's lemma which I haven't studied yet and presumably in my book this problem is meant to be solved without using Gauss's lemma.


How to save a copy of a multiplayer world in the new 0.7+ menus?

How do you save a joined game after the 0.7.1 update? The menus have all changed since 0.6.x and I can't find the option to save a copy of a joined world anymore. (My friend has got a diamond house on survival and I want to save it but it doesn't let me!)


Significant correlation but in regression analysis Beta is insignificant. How come?

I have 3 IV's and they are significantly correlated with DV, but when I run regression one of the IV's Beta value turns out to be insignificant. What might be the reason of this?


A homophone is a word that is pronounced the same as another word but differs in meaning. Is there a name for two words with the same spelling but with different meanings? For example: Polish (someone from Poland) and polish (rubbing something to make it shiny).


I'm trying to figure out how LVM snapshots work so I can implement it on my fileserver but I'm having difficulty finding anything on google that explains how it works, instead of how to use it for a base backup system.  From what I've read I think it works something like this:   You have an LVM with a primary partition and lots and lots of unallocated freespace not in the partition Then you take a snapshot and mount it on a new Logical Volume. Snapshots are supposed to have changes so this first snapshot would be a whole copy, correct? Then, the next day you take another snapshot (this one's partition size doesn't have to be so big) and mount it. Somehow the LVM keeps track of the snapshots, and doesn't store unchanged bits on the primary volume. Then you decide that you have enough snapshots and get rid of the first one. I have no idea how this works or how that would affect the next snapshot.   Can someone correct me where I'm wrong. At best, I'm guessing, I can't find anything on google.    vgdiplay   obu1:/home/jail/home/qps/backup/D# vgdisplay   --- Volume group ---   VG Name               fileserverLVM   System ID   Format                lvm2   Metadata Areas        1   Metadata Sequence No  3   VG Access             read/write   VG Status             resizable   MAX LV                0   Cur LV                2   Open LV               2   Max PV                0   Cur PV                1   Act PV                1   VG Size               931.51 GB   PE Size               4.00 MB   Total PE              238467   Alloc PE / Size       238336 / 931.00 GB   Free  PE / Size       131 / 524.00 MB   VG UUID               qSGaG1-SQYO-D2bm-ohDf-d4eG-oGCY-4jOegU


I'm running a bash file to obtain data on what system processes are running (i.e netstat, syslog, arp etc). All's going well except for the history. I'm trying to save the history to a text file with  cp ~/. bash_history $path/filename.txt      Unfortunately this doesn't give me the complete history. If manually input the command   history > /media/root/usb/filename    I get a completely different result. My aim is to automate the whole process under the one bash file, is there a way of doing this. Also i'd ideally like the date and time with the history.


Total angular momentum operator on $|m\rangle$ and $|m-1\rangle$ results in different eigenvalue

In the lectures by Prof. Leonard Susskind, he mentioned that the total angular momentum squared operator can be represented by  $$ L^2 = L_z^2 + L_z + L_- L_+ $$  ($L_+, L_-$ being ladder operators). He then used it to show the $L^2$ of $|m\rangle$ is $m(m+1)$  ($m$ stands for magnetic quantum number). Finally, he proposed that if $L_-$ commutes with $L^2$ (which is true) then all $(2L+1)$ states will have same $L^2$. However if I apply $L^2 = L_z^2 + L_z + L_- L_+$ to $|m-1\rangle$ directly, it will give me $m^2-m+1 != m(m+1)$  I would like to know where is the flaw in my calculation.


I'm currently running an early AOSP build of android 6 on nexus 10. What are the aosp options for android 7? I'm not talking about a custom ROM like cyanogenmod. I mean one as close to AOSP as possible.


Ellipse fun (given an arc length, calculate theta)

I can see the general solution.. but I was wondering if the wizards here could help me along. :) Given an ellipse with a known major and minor axis.  Take a known r(T) such as, the major or minor axis, and a known arc length A. I'd like to determine any r(t) given any r(T) and A. Numerical approximation is 100% ok, as this is for an applied problem.


My \mathcal{U} turns out to be curvy? (different than default)

My preamble : \documentclass[12pt,a4paper]{report} \usepackage[lmargin=3.81cm,tmargin=2.54cm,rmargin=2.54cm,bmargin=2.52cm]{geometry} \linespread{1.5} \usepackage{amssymb} \usepackage{ dsfont } \usepackage{textcomp} \usepackage{wrapfig} \usepackage{array} \usepackage{indentfirst} \usepackage{colortbl} \usepackage{float} \usepackage{changepage} \usepackage{longtable} \usepackage{mathptmx} \usepackage{color} \usepackage{graphicx} \usepackage{lettrine} \usepackage{hyperref}  \usepackage[nottoc,notlof,notlot]{tocbibind} % add to TOC \usepackage{caption}  When I add the command :  $\mathcal{U}$  I get  instead of  Can anyone tell me why is that happening ? and how to get the second U instead of my current one.


Can no longer access NAS on clean install of 20.04

I did a clean install of 20.04. In files I can see my NAS but can't access it as it does not give the password dialog box. There are other posts saying to modify the smb.conf file to make this work but I don't seem to have this file with a fresh install. Is there a way to fix this or is this version of Ubuntu basically useless to anyone with an older but perfectly functional NAS?


I am aware that this question is quite similar to another posed on this site, but I specifically need to understand whether you declare you are using the Sneak Attack on a given attack or whether it just happens on its own.  As a related matter, let's say my rogue is dual-wielding and chooses Sneak Attack on the first attack (main hand). If the main hand misses, has he "wasted" his one Sneak Attack attempt or does that then roll over to the off-hand attack?  If the latter, is the implication that the Sneak Attack damage just "happens" whenever you get your first successful hit (which would then have implications for rounds with multiple main attacks)?  Thanks all!


I am working in edit mode in Blender 2.8.  There is a volume through which I constructed 2 planes. Now I want to remove the excess parts. To do so, I think I need to split the faces where they intersect.  See the image: I want to remove all parts marked with a red cross.  To do this, I think I just need to figure out how to create the edges with the green dotted lines, but I can't figure out how to do this.  Maybe another way to explain this: if you look at both the horizontal and vertical line in the front, these do not intersect. Although they are in the same plane, there is no vertex where they cross and I can't find any button to perform this action.      Solutions I tried:  Rip apart the faces. In the screenshot I'm trying to adjust one of the faces, but this doesn't really merge the top edge with the horizontal face, which is what I'm looking for. Or maybe I'm not using the tool correctly.


This location could not be displayed on Ubuntu 16.10

I've formatted my computer, I saved my files in this disk, after install Ubuntu I can't access the disk.    when I try to access this disk, it says  This location could not be displayed you do not have the permission to view the content     How to open the disk?


In the picture below, Citigroup's stock split 1 to 10. My guess is this means that everyone who had 1 share now has 10 shares? This can't be right though, because the value of the stock after the split should be 1/10th of the value prior to the split. Somebody help me out here.


Could someone explain references in Java via pointers and references?

Lots of people have asked if Java is "pass-by-reference" or "pass-by-value", yet I feel I haven't gotten a good explanation of how Java actually stores references and how it dereferences them when called.  Would anyone be able to explain what happens when you have something like, say,  public class Foo {     public static void main(String a[]){         Object a = new Object();         Object b = a;         Object c = b;         bar(c);     }     public static void bar(Object obj) {         obj = new Object();         System.out.println(obj);     } }   in terms of pointers?   How is the JVM actually referencing and dereferencing objects and references?  I'm guessing it's semantically equivalent to the semi-pseudo C++ code:  int main() {     Object *a = new Object;     Object *b = a;     Object *c = b;     bar(c);     return 0; } void bar(Object *tempObj) {     tempObj = new Object;      //changes address of a copy of the ptr arg     cout << std::to_string(*tempObj) << endl; }   (I know there is no Object class in C++ and that to_string isn't defined for every class like it is in Java, but for the sake of example I think it helps illustrate the concept.)  Am I correct? Bottom line: what's going on under the hood? I'd like a more explicit answer.


Get last element of $@ / argv / arguments array without eval

If I do:  set a b c   How do I access the last element of $@, namely c?  I've initially thought to subscript the $@ array:  "${@[$#-1]}"   But:  bash: ${@[$#-1]}: bad substitution   I eventually came up with:  eval echo "\$$#"   Is there a way to get the last element of $@ without eval?  Is the only way to first copy it to another array and access ${copy[-1]}?


Why do some actors in credits appear as - Character (As Actor)

I was just browsing IMDb and always wondered why in some movies an actor/actress will appear in the credits as the character but right beside in parenthesis "As Name"? Check out Dane DeHaan's profile as an example:    There are two in his profile, one for Lincoln - Second White Soldier (as Dane Dehaan) and one for At Risk - Cal Tradd (as Dane Dehaan)  Can anybody provide a reason for this? Or is this an IMDb only tweak?


How do I find this?   I know that I should use perhaps:   $gcd(a,b) = gcd(a,a-b) $  But then I get:   $gcd(15570555,4697976) $   Which seems still too large for me to do anything further.


For a parent, how do we best control the content of the ENTIRE household's Internet in a centralized manner?  This settings of parent controls for individual network-based devices is maddening and often incomplete in terms of time-limit and content-limit.


How can I have a div go from collapsed to expanded (and vice versa), but do so from right to left?  Most everything I see out there is always left to right.


What is the difference between Restricted Maximum Likelihood (REML) and Maximum Likelihood (ML)?

I am a first year graduate student in biostatistics, and I have somewhat of an idea of the difference between REML and ML. However, I want a more in-depth understanding of each estimation method, especially when it comes to Likelihood ratio tests.   I know that you cannot use REML for likelihood ratio tests, and it has something to do with using the residuals of the means. If you take the residuals of the means, the models are no longer nested (nested models are needed for LRT). However, I really want a more thorough explanation as to why we cannot use REML for LRT's.  I will appreciate it if someone can explain this to me.


Kitchen Installation new build: How long after heat goes on?

In Short  Our kitchen suppliers have told us that the kitchen should only go in 6-8 weeks after the heat has been turned on in our new build. Their concern is how dry the house is, I assume the issue they're talking about (in technical terms) is relative humidity? Would I be right in saying as long as we are achieving a reading of 50% or less humidity-wise, there should be no issue?  The reason I ask is we're working off a deadline which will only allow us 5 1/2 weeks of lead time with the heating on otherwise the whole thing gets pushed back 1-2 months.  TL;DR - A bit more background below  House Area: 250m2 Construction Type: Concrete Block  Our floors have been poured 4 weeks ago:   Upstairs: 50mm liquid screed Downstairs: 100mm sand and cement   The plastering was completed 5 weeks ago (gypsum all around and skim on ceilings)  I have been opening all the windows during the day and removing all condensation with a window vacuum before I close them up again at night.  For the past week the house has been receiving heat at night via 2 x 2.5kw heaters running for 8 hours.  The heating is to be provided by a heat pump (air to water) and distributed via underfloor heating, we also have a heat recovery system which should take some moisture out.  Recommendations  We've be told not to install dehumidifiers as it will crack the plaster, so is there anything else we should be trying or anything that we are doing and should stop?  Another suggestion was to isolate the heat to the kitchen by taping up openings to other rooms? My thinking was the moisture would be drawn from other rooms once these temp barriers were removed?


Does there exist a short form of I am not?  I'm not or I amn't or I am not?


Batch file to create a folder in every removable device

i Need a batch file to create a folder "test" in every removable device than i plug in my computer (pendrives and etc)  i am trying something like this  set "extDrive=" for /f %%D in ('wmic volume get driveLetter^ where drivertype=2 ) do set extDrive=%%D mkdir "%extDrive%\test"   Someone can tell me why this is not working ??


The Higgs field a new Luminiferous aether?

As of this writing it has been made clear to me that classical physics' Luminiferous aether was a terriblly poor discriptor of space. With the advent of Special Relativity and General Relativity, that aether ceased to be applicable. Today I began reading on the Higgs boson, and the Higgs field. How are those theories different from or similar to the seemingly irrational Luminiferous aether?  P.S. I am a first year student at Bakersfield Community College. If this question seems naive, you now have an explanation.  (EDIT) To me the similarity rests upon their fundamental influences regarding static positions in space. I currently only accept models in which static spacial positions are impossible. Contrastingly relative positions seem quite reasonable. In my humble opinion my naivatisms inhibit me from absorbing and understanding the Higgs boson. If they actually are similar, public protest would probably be more apparant. However, I have put forth my best effort to pose an direct question here.  P.S. The questions Where does space go when it falls? and What happens to time lost when matter accelerates? come much earlier in my studies, and they seem relevant.


Rank of free submodules of a free module over a commutative ring.

Free modules over a commutative ring $R$ with $1$ have well-defined rank.      I have been wondering if there is a ring $R$ such that there are free modules $M'\subset M$ with $\operatorname{rank}(M')>\operatorname{rank}(M)$ for a while, but can't come up with examples or a proof of the contrary in general.    All I know is that this never happens if $R$ is a domain, since you can consider $M'$ and $M$ as vector spaces over the fraction field of $R$.


How can I compare two times in JavaScript in a way that will survive an NTP time update?

We have a JavaScript function that gets the start and end times of two events:  var startTime = new Date().getTime(); // A long running task occurs var endTime = new Date().getTime();   The trouble we have found is that getTime() appears to be dependent on the system clock. Unfortunately, we have had a few instances where the user's clock has changed between these two calls, apparently through a Windows NTP time update (i.e. Windows goes out to a time server to get an accurate time, then changes the system clock to the correct time). So we wind up with something like this:  startTime = 12:00:00 // 30 second task is kicked off // NTP time update detects that the system is one minute ahead and corrects the clock endTime = 11:59:30 // It ended before it began   Is there any way that I can compare two times in such a way that will survive an NTP time update? Our JavaScript app would not be able to query any servers outside of our corporate firewall, so calling an NTP server ourselves is out of the question.


Can't retract close vote when revisiting post on mobile site, and other inconsistencies

Summary of issues:   Can't retract close vote on mobile after a page refresh Voting to close on mobile shows close 1 and then when page refreshes it shows close (1) Retracting vote on mobile doesn't refresh tally -- continues to show close 1 instead of just close, until you refresh   I voted to close a question on my desktop. Later on my phone I decided to retract this vote, but I couldn't. I saw close (1) but it was grayed out. Switching to "full site" allowed me to retract my vote.  In trying to reproduce, I went to a post on phone and voted to close a question. The text changed to close 1. I could retract my vote at this time, and doing so, the text stayed the same as close 1 which seems to contradict .  Refreshing page showed correct close text grayed out.  Another attempt on phone, I voted to close a question. The text changed to close 1. I refreshed the page and could no longer retract my vote as the text said close (1) and was grayed out.  Visiting question with existing close votes showed close 2. I also voted to close and then it said close 3. Refreshing page showed closed (3) grayed out.


Excel: how to count number of distinct values in a range with condition?

I read and tested quite a lot, but I still not able to come up with a solution for my problem.  The close solution I found is the second one proposed in article below:   I'm essentially after finding out how many values are unique in Column A while Column B correspond to a certain value.  Let's imagine the following spreadsheet  COL A      COL B abc        TRUE abc        TRUE bef        TRUE bef        FALSE hgf        TRUE swd        FALSE rth        FALSE kjh        TRUE   I'd like to come up with a formula to calculate (not showing) the # of unique values in A which contains TRUE in COL B. So given the example above, I should get 4.  Now, I was expecting the formula below to be in some way helpful  =SUMPRODUCT((A2:A100<>"")/COUNTIF(A2:A100,A2:A100))   once amended with a COUNTIFS, but it clearly doesn't work, and I don't understand why. Also I don't really understand the reason of the initial bit: A2:A100<>""


I am showing content from product content type of commerce module using view but view is showing some repeated content.how to solve this problem.


Why didn't Star Trek TOS have better medical equipment for Vulcans?

In  when Ambassador Sarek became critically ill, why didn't they send him home or send for a Vulcan medical expert? Since they were hosting many prominent political figures from many races, it seems strange that they did not have much medical support for a race so common as Vulcans (who are part of the Federation).


In Lyx how do I fix the border shift for binding?

WIth regards to piping answers into Lyx GUI, I am continuing the my question from . The layout of chapters starting on the odd pages appears to be correct, however the shift left or right I believe to compensate for the binding of the pages appears to be shifting TOWARDS the binding, should it be shifting away from the binding? how can I fix this.  Observe the binding side has a smaller margin...    Expand the loerem ipsoms to but here is what i have in my .lyx file.  #LyX 2.0 created this file. For more info see http://www.lyx.org/ \lyxformat 413 \begin_document \begin_header \textclass report \options openright,twoside \use_default_options true \maintain_unincluded_children false \language british \language_package default \inputencoding auto \fontencoding global \font_roman default \font_sans default \font_typewriter default \font_default_family default \use_non_tex_fonts false \font_sc false \font_osf false \font_sf_scale 100 \font_tt_scale 100  \graphics default \default_output_format pdf2 \output_sync 0 \bibtex_command default \index_command default \paperfontsize default \spacing single \use_hyperref true \pdf_keywords "Software Diversity, Monoculture,Security, Randomising,Randomizing, Java, Data Structures, ANTRL4, ANTLR" \pdf_bookmarks true \pdf_bookmarksnumbered false \pdf_bookmarksopen false \pdf_bookmarksopenlevel 1 \pdf_breaklinks false \pdf_pdfborder false \pdf_colorlinks false \pdf_backref false \pdf_pdfusetitle true \papersize default \use_geometry false \use_amsmath 1 \use_esint 1 \use_mhchem 1 \use_mathdots 1 \cite_engine basic \use_bibtopic false \use_indices false \paperorientation portrait \suppress_date false \use_refstyle 1 \index Index \shortcut idx \color #008000 \end_index \secnumdepth 2 \tocdepth 2 \paragraph_separation indent \paragraph_indentation default \quotes_language english \papercolumns 1 \papersides 2 \paperpagestyle default \tracking_changes false \output_changes false \html_math_output 0 \html_css_as_file 0 \html_be_strict false \end_header  \begin_body  \begin_layout Title Front Title Page \end_layout  \begin_layout Author Author \end_layout  \begin_layout Date Date \end_layout  \begin_layout Chapter* Abstract \end_layout  \begin_layout Standard My Abstract \end_layout  \begin_layout Chapter* Acknowledgements \end_layout  \begin_layout Standard my ack \end_layout  \begin_layout Chapter the first chapter \end_layout  \begin_layout Section lorem ipsom lorem  \end_layout  \begin_layout Standard ipsom lorem ipsom…… \end_layout    \begin_layout Standard \begin_inset CommandInset bibtex LatexCommand bibtex btprint "btPrintAll" bibfiles "/myPath/here" options "bibtotoc,plain"  \end_inset   \end_layout  \end_body \end_document


Removing selected duplicates in a python list

Suppose i have the following list: my_list = ["sam","sam", "is", "a", "is", "sam" , "good", "person", "person"]  Now my requirement is to write a function that selectively removes duplicates. I want to use this function in a for loop. suppose i want to remove "sam" duplicates Which means after 1st iteration my desired result is as follows: my_list  = ["sam", "is", "a", "is", "good", "person", "person"]  only duplicates of "sam" are removed. similarly, after the second iteration, i want to remove is "person", so my list will look like:  my_list  = ["sam", "is", "a", "is", "good", "person"]  Please suggest a way i can do this? Thanks & Regards


This is part of df -h  Filesystem      Size  Used Avail Use% Mounted on /dev/md1        222G  5.5G  205G   3% /   222 - 5.5 = 205?  I also observe this in another physical machine  /dev/sda1       108G  3.9G   99G   4% / /dev/sdb1       688G   29G  625G   5% /storage   688 - 29 = 625  Ubuntu sucks at math lol  Jokes aside, why is this?


I want to upload an .eps figure in my latex, i read this  thread    Although i got confused, is TexMaker able to convert .eps fully or is there a package which i should use?  \documentclass[authoryear,preprint,review,12pt]{elsarticle} \usepackage{graphicx} \usepackage{float} \usepackage{amssymb} \usepackage{amsthm} \usepackage{mathtools} \usepackage{adjustbox}   \usepackage{lineno}  \begin{document}  \begin{flushleft} \begin{figure}[H]\label{East Scotland} %\includegraphics[scale=0.35]{figures/2.jpg} \includegraphics[width=1.3\textwidth,keepaspectratio]{figures/boundaries_1h.eps} \caption{Mesh and coordinates for North Sea, depth is in meters(m) } \end{figure} \end{flushleft}   \end{document}   thank you


mysqli_set_charset() Serbian letters won't appear in mysql database

when I insert data into mysql database Serbian letter like č looks like Ä and ć looks like Ä‡. In header I have:  <meta charset="utf-8"> <meta http-equiv="X-UA-Compatible" content="IE=edge">   and encoding is set to utf8_unicode_ci so I don't know where is the problem...  When I put   mysqli_set_charset($connection, "utf8");   before insert, then in mysql is looking good, but in my app ć is appear as symbol ?  Where am I wrong?


Where did the idea of vampire invitation first originate?

Its been a long time since I read Bram Stoker's Dracula, and I do not remember any instance of Jonathan Harker inviting Count Dracula to his home. I just watched the Let Me In movie and I also remember from the movie The Lost Boys that a Vampire needs the invitation of the host to enter the hosts house.This brings me to the questions:    Where in writing or a movie does this idea first originate? Was it from Bram Stoker's Dracula?


Is initiative order affected by a player volunteering to begin combat?

In the campaign I run, it is frequently the case that one player will make an attack against an unsurprised enemy to start combat. For example:     DM: "At the end of the long hall, you see a large door, flanked by two   hobgoblins. They are alerted to your presence but do not move."      Ranger: "I shoot at the one on the left with my longbow."   In these situations, no one is surprised, and a party member has specifically stated that they will perform the action that brings us into combat and cues initiative order. But does this affect initiative order?  If everyone just rolls for initiative, then there is a very good chance that someone, maybe even an enemy, will have a higher initiative than the inciting adventurer. But that doesn't make a whole lot of sense when the combat wouldn't happen at all (not yet, anyway) if that adventurer didn't make an attack. And then the player who is playing the ranger feels like his cool idea was ignored when he rolls a crappy initiative.  I realize that those who roll a higher initiative than the inciting adventurer could take a non-combat option, such as Dodge, Help, or Dash, but I don't think the party would be a big fan of reducing the party's attack quantity for the first round..  I was thinking about making a house rule that gives such a player a +5 bonus on their initiative roll or that allows players to choose their initiative as long as it isn't higher than what they rolled or something like that, but is there already a mechanic in place for this kind of situation?


What happens to radians in this calculation?

I rewrite N as kg m s^-2 and try to get Pmax, which is in Watts to kg m^2 s^-3 but when I do so I am left with an rad^2.


Recently I've come across 'tetration' in my studies of math, and I've become intrigued how they can be evaluated when the "tetration number" is not whole. For those who do not know, tetrations are the next in sequence of iteration functions. (The first three being addition, multiplication, and exponentiation, while the proceeding iteration function is pentation)   As an example, 2 with a tetration number of 2 is equal to $$2^2$$ 3 with a tetration number of 3 is equal to $$3^{3^3}$$ and so forth.  My question is simply, or maybe not so simply, what is the value of a number "raised" to a fractional tetration number. What would the value of 3 with a tetration number of 4/3 be?  Thanks for anyone's insight


My c++ code   #include <iostream> using namespace std ;  struct Node {     int data ;     struct Node *next; };  int main(){     struct Node *head = NULL;     struct Node *second = NULL;     cout << sizeof(struct Node); }   output to terminal  16   How is the size 16 ? Size of int is 4bytes.  How come it's multiplied by 4 ? Please can anyone give detailed calculation ? Thanks !


How do I tokenise a string in C++ into substrings

I have:  string content;   which is inputed by the user.   For example:  content = "I am new to this site".   I want to loop through this string and for each word in the sentence I want to run a function which processes the word.   something like this:  for(int i = 0; i < stringSize; i++){ //remove a word from the string process(word); }   Any help would be much appreciated. Thank you


I would like to prompt users for a single passphrase to establish trust with separate, normally (but not always) complementary systems from one password input.  I'm essentially looking for a box where one password enters and two leave, where maximum of entropy is maintained and the ability of an attacker using either output password to derive the other is minimized.  There are some constraints:   The algorithm must be public knowledge. No other secret keys can be involved. Output passwords must be deterministic for any given input password.   A simple answer seems to be:   $\rm pass1 = HMAC(password, \text{ "Magic One"})$ $\rm pass2 = HMAC(password, \text{ "Magic Two"})$   With this method, it should be as difficult for someone who knows $\rm pass1$ to derive $\rm pass2$ as it would be for them to guess $\rm password$.  Are there better existing algorithms?  The only reference I have been able to find is Steve Bellovin's  using the same basic method.  Specifically, is it practically possible to increase the difficulty of someone with knowledge of $\rm pass1$ to derive $\rm pass2$ to be more than the difficulty of guessing $\rm password$ itself, even if it requires spending portions of available $\rm password$ entropy?  For example, let's assume that $\rm pass2$ is exposed in an environment where it is being attacked "offline", while $\rm pass1$ is less vulnerable.  In this case, $\rm pass1$ is effectively also exposed to the "offline" risk as much as $\rm pass2$.


How can ASTER elevation data be converted to a CAD model?

I am trying to convert ASTER elevation data to a 3D CAD model using only opensource software.  I have tried using different file formats but I have been unsuccessful.  I use QGIS for my GIS work and would like to open the model using something like Sketchup or Meshlab.


Set Alt+Tab to switch all Windows, instead of Grouped Windows

In Ubuntu, if I am running multiple windows of the same application and I want to chose one of them using Alt+tab, I can't instantaneously do it.  The default behavior is to press Alt+tab, then wait on the grouped application icon, and finally the grouped windows will appear from which I can choose (a window).   Instead of grouping windows, can I change the default behavior to show all opened windows of the same application using Alt+tab?


A friend would like to use Ubuntu 14-4 or 15-10, but the OS on his laptop in Windows 10. When I put the ISO from one or the other in his dvd-drive, it starts up, but after a short while Windows overrides it. I want to install Ubuntu without Windows. I can not find any solution for this problem, also because I'm not used to Windows. I did take the hard-drive out of the laptop and connected it with my pc with a usb-tool. It appeared, that the drive can not be opened with anything, so I can not delete the files on it. Please tell me how to proceed.


cp - cannot create regular file : permission denied

I want copy to /lib/udev but gives error  cp -f /tmp/ok_pcscd_hotplug.sh /lib/udev  cp:cannot create regular file /lib/udev/ok_pcscd_hotplug : Permission denied   I am root , but I can't understand . what can I do ?


myOpenID ending...what login should I use?

I got an email this morning that myOpenID is ending Feb 2014.  How anyone else received this?  Is it real?  If so, what login do I use for stackexchange/stackoverflow?  Is there a way to migrate/transfer into another login so I don't use all of my reputation points?


Antimatter traveling back in time and gravity

I've been reading on the construct of considering antimatter as matter traveling backward in time, which seems like an useful tool.  There seems to be some discussion around this concept, if antimatter is "really" traveling back in time, but from what I can tell it becomes mostly semantic/philosophical.  To avoid that, for purposes of this question, I would like to dispose of the concepts of "moving" and "time."  So, instead of considering an electron to be a particle moving in space, lets consider it a string existing in four dimensions of spacetime.  i.e. matter/anti-matter annihilation/creation are just places this string changes orientation ala Feynman's explanation of bombardiers viewing switchbacks in a road.  With that preface, then, my question is about the interaction of antimatter and gravity.  The effect of gravity on antimatter appears to still be an unknown?  If we model gravity as a curvature in spacetime which affects the path of the string.  Then wouldn't that argue that matter and antimatter portions of the electron/positron string would be affected the same?  And, as we evaluate each 3D slice of spacetime, that electrons and positrons would both appear to "move" in the same direction due to gravity?  Am I thinking about things the wrong way or missing an argument?


Tune up utilities drive defrag ate my disk space

Today I used Tune up drive defrag and after using it my free disk space decreased by 9 GB. Why did this happen. What can I do to recover the disk space? Thank you. I just found out that this is using my disk space.


How long can a can of food be kept in fridge before opening?

I put a can of unopened pork n beans in fridge to get cold for next day and they were pushed to the back and fogoten. How long will they be ok to eat,?


Can someone explain how water from a garden hose can propagate in a sine/cosine wave?

A  posted on Youtube.  How does this phenomenon work? I know he is using frequency to propagate water in a sine/cosine wave, but how does it exactly work this way? Why do we see it as if its paused, or in slow motion, or even in reverse?  Can someone please explain this? I am intrigued by the video and want to know it's physics.


Leak in wall behind push/pull bathtub faucet

Have a push/pull faucet for our upstairs bathtub/shower, and it recently started leaking behind the shower wall and onto the ceiling below.   It appears to only leak when the faucet isn't pushed completely closed. Any idea how I can fix this? See images below.


I understand that an  is the boundary of trapped codimension-2 surfaces in the spacetime (surfaces from which both ingoing and outgoing light rays must be converging). Meanwhile, an  is the boundary of the past of future null infinity (boundary of points from which a light ray can escape to infinity).  I have a few questions about this:   I've read that apparent horizons are always inside or coincident with event horizons. If it's inside then doesn't that allow for points from which null rays can travel outwards i.e. points inside the event horizon that are causally connected to infinity? Apparent horizons are observer dependent. Why? Shouldn't all observers agree on light converging or diverging? If apparent horizons are observer dependent, why are they at all useful in GR which is famously diffeomorphism invariant (observer independent)? Both definitions seem to me to be a boundary between points that can and points that can't send light to infinity. Can someone explain the difference between them please? I know there are several posts on this but I'm afraid it has not helped clear it up in my head. Does solving $g^{rr}(r)=0$ locate the apparent horizon? Wouldn't we need to find this by solving e.g. the Raychauduri equation or something?


The infinite intersection of finite sets

Is the infinite intersection of finite sets a finite set? Could you give me some examples or counterexamples?


Why didn't Dumbledore enchant a portrait of himself to aid the trio in their hunt for Horcruxes?  Surely, if he foresaw Ron leaving and coming back, reason for why he left him the Deluminator via his last will and testament, and that Harry and Hermione would have to compensate for the decreased magical capacity/capability provided by Ron while he was absent, then he would have thought of a way to help them (via a portrait). He could have also taught the Fidelius Charm to them, seeing as how that prevented the Death Eaters from entering 12 Grimmauld Place even though they were aided by the Taboo Jinx/Curse, but Hermione's protective enchantments (Protego Totalum, Salvio Hexia, Repello Muggletum, Muffliato, Cave Inimicum, Disillusionment Charm, etc...) collapsed entirely against the Taboo Jinx/Curse. There might be other times during the Horcrux hunt where he would have been helpful, but these are the only ones I could think of right now.   The quote proving that Dumbledore knew that Ron would leave and comeback is here, in page 391, British Edition, of Harry Potter and the Deathly Hallows:     And still his scar prickled, and he knew that Voldemort was getting there too. Harry understood, and yet did not understand. His instinct was telling him one thing, his brain quite another. The Dumbledore in Harry’s head smiled, surveying Harry over the tips of his fingers, pressed together as if in prayer.   You gave Ron the Deluminator. You understood him ... you gave him a way back ...   And you understood Wormtail too ... you knew there was a bit of regret there, somewhere ...   And if you knew them ... what did you know about me, Dumbledore?   Am I meant to know, but not to seek? Did you know how hard I’d find that? Is that why you made it this difficult? So I’d have time to work that out?


I have a site collection http://SPL-GT/sites/CP and would like to change it to a shorter version of http://SPL-Sharepoint. How this can be done?


How to return the device on MacBook Air on Bluetooth?

I accidentally tap on forgot the device on MacBook Air and delete Beats solo3 from the Bluetooth device list? Any ideas how to return the device? Can you guys help me please, I try everything...


There are many documentaries, forums, blogs and more dedicated to . I have been frantically searching for an answer to my question however none of my sources have clarity to the matter of hand. I would really love a clear explanation to: What exactly is Dark Matter? Please help me to have a clear understanding.


Adobe Acrobat: How to batch to combine multiple pdf files?

I have 3 folders:  Folder 1  Folder 2 Folder 3   In each folder I have 5 pdf files:      Folder 1         file1.pdf        file2.pdf     Folder 2        file1.pdf        file2.pdf     Folder 3        file1.pdf        file2.pdf   I want that in each folder to have a combined file of those two files:      Folder 1         binder.pdf     Folder 2        binder.pdf     Folder 3        binder.pdf   Any idea? Don't tell to do it manually. This case is just to explain you my problem. Think that I have hundreds of folders. :) Maybe I can use another tool instead of Adobe Acrobat?!


References do not resolve even after repeated compilation

If my references do not resolve after repeated compilation, and , what else should I consider?


Getting null point exceptions when using methods in other activites - android

So I am trying to access a method in another activity, basically to check if there's new data in the chat and if there is, it shows a toast. But I'm getting an error whenever I try to use this, or Activity.this in any function. If I try to use context, it works but rest all functions start giving null.  Here's what I did  DoTheTask.class   Chat c = new Chat(); c.Mymethod("true",id);   Chat.class  public void Mymethod(String fd, String id)     {         if(fd.equals("true")){             Toast.makeText(this,"Chat is open", Toast.LENGTH_LONG).show();         }     }   Here the "this" inside toast is giving NPE, I passed context with the method but I want to use this because I have many other functions required which work only with this or activity.this and not context (they give errors)


mySql or sql c# deployment origanaly acsess small database

Using c# I have a small database that I have created I used access now I wish to port it to SQL or SQL server. In deployment which is easiest. With access you have to bundle the assess driver, do you have to bundle anything when using mysql or sql?


Why does this happen? Everything else printable with uname is shown. I am not looking into fixing this. Even the manual page of uname says that it's a common output.  I just want to know why.


Recently, my Firefox home page became stuck on trustedweb.com (probably as a result of something my son had installed). No matter what I set the home page to, it always goes to that trustedweb.com site. Short of resetting everything, how do I get rid of that stubborn start page?  This is not like the other question that others think that this duplicates. Something has hijacked my browser and is showing its own start page regardless of what I set the start page to (about:blank, superuser.com google.com or whatever). In addition, I get a banner ad at the top of the page of nearly every site that I go to.


Injecting a CSS stylesheet using Javascript

I've written a simple CSS stylesheet that is meant to alter a page's background colour however, I'm having trouble calling it via Javascript through my HTML file. I know how to alter the background of an HTML file using Javascript, but the problem is that I don't know how to call on a stylesheet to alter the HTML file. Here's my code:  HTML
Altering style of first paragraph via Javascript.

Altering style of second paragraph via Javascript.
        Stylesheet  body {   background-color: green; }


What's the difference between 'sign up' and 'sign in' with Facebook?

In Airbnb, I see that the user can 'sign up' with Facebook or 'sign in' with Facebook. What is the difference between sign up and sign in? Do these options actually perform different actions?


What specific mainline kernel does Ubuntu 17.10 ship with?

and where can i look in the future to determine what mainline kernel Ubuntu is applying patches to and shipping?


When should the "Not an Answer" flag be used?

A few hours ago, I flagged  as not an answer. Additionally, I left a comment, basically saying that this answer has nothing to do with the question.  My flag got declined with the following reason:     flags should not be used to indicate technical inaccuracies, or an altogether wrong answer.   However, when flagging as not an answer, the following description is displayed (emphasis mine):     This was posted as an answer, but it does not answer the question. It should possibly be an edit, a comment, another question, or deleted altogether.   <rant> Basically, I am a bit wary about this declined flag right now, because it matches the description on what should be flagged as an answer and with my current flag weight, this declined flag destroyed about two days worth of flagging. That just took all the fun out of it for me, especially, because I am a responsible flagger, and open the questions to really read them and the answer if I am unsure - even if the answer already has several flags. </rant>  So, what am I asking... Well: Was it correct to decline my flag? If so, please fix the description of that flag option. If it was not correct, how can we prevent such "false flag declines" in the future?  Especially in the context of high flag weights where one declined flag really hurts.  UPDATE:    And another one!!   I didn't even flag as not an answer, but as "Other". My comment was: "Although this is the accepted answer it doesn't help. See comments for more info, basically: Contains not much more than a dead link." It is common sense to flag answers that contain only links, even more so, if the link is dead. As this was an old accepted answer, downvoting didn't help, because I still couldn't delete it. And my flag didn't even ask for deletion, but for "Mod attention", whatever that might be.  You just lost an active flagger, because every dismissed flag costs the equivalent of 50 to 100 "helpful" flags at my current flag weight. All because of some arbitrary decision from some anonymous mod? That just sucks and shows how little the honest flagging effort is honored.


What algorithm for a tic-tac-toe game can I use to determine the "best move" for the AI?

In a tic-tac-toe implementation I guess that the challenging part is to determine the best move to be played by the machine.  What are the algorithms that can pursued? I'm looking into implementations from simple to complex. How would I go about tackling this part of the problem?


I'm using LyX and a custom class from  which is based on the  class.  I'm at another school and my advisor wants me to include titles of the readers on the signature page as well as a date line for each signator.  I've looked through some documentation on the thesis class and poked around in the .cls file in use but didn't come across anything obvious to change.  Perhaps this section would help though?  \newcommand*{\th@degreeyear}{\number\the\year} \newcommand*{\th@signature}[1]{ \begin{center}     \normalsize     \vspace*{16mm}  % works well?     \vrule width 80mm height 0.2mm\\     #1 \end{center} } \newcommand*{\th@dateline}{ \vspace*{9mm} \begin{flushright}     Date~{\vrule width 35mm height 0.2mm} \end{flushright}   How do I include this?


Switch windows of an application across desktops

Is there a way (which does not cost a buck) to switch between windows across desktops with Option Tab? Not between apps, but between windows.  Meaning: if I have a Chrome window on desktop 1 and another on desktop 2, just by Option Tab'ing, I could switch across both.


How do i partion my hardisk in Ubuntu and im having having a single partion, only one drive, the main problem is i could not parrtition my home drive by staying in home drive itself and i could not enter into BIOS (i have tried all possible ways) please help?Edit


How to install exe versions of linux utilities on windows?

I am aware that we can get .exe versions of many linux utilities. I happen to have wget.exe, curl.exe and busybox.exe. But how can I install them so that instead of typing   C:\Users\Rahul>cd downloads  C:\Users\Rahul\Downloads>wget   I can straight away type  C:\Users\Rahul>wget


Deploying a static site on AWS EC2/nginx: what am I doing wrong?

I set up a micro instance (Ubuntu, 32 bit) and assigned an elastic IP (23.23.245.104)  Public DNS: ec2-23-23-245-104.compute-1.amazonaws.com  I successfully ssh'ed to the machine and installed nginx.  Then I edited the server_name attribute in nginx's config file (/etc/nginx/sites-available/default)  server_name ec2-23-23-245-104.compute-1.amazonaws.com;   Restarted nginx and hit  but got a "could not connect" error.  What did I forget to do?  Thanks


So, if we have a large pipe which is constricted in the middle, the fluid in the middle section  will move faster. Why is it so? What dictates that liquid that an X amount of it must pass on the other side regardless of the size of the encasement?  The only reason I could think about is because that the initial pressure which causes the movement somehow is being transferred to a smaller area, but that makes no sense.


How would I go about making water shoot out of a pipe rather than just flow out?

I am working on a project that requires the water to shoot out of the end of the pipe rather than what it is doing right. Now, I have played with some of the settings but am kinda afraid to mess with it too much since I am new to blender, and it does not play well when I mindlessly click.   Would I generate more fluid particles? Or would I change some property about the inflow animation? I added a cylinder object to the top of the pipe as well, I think that will help keep all the water inside of the pipe.   Thank you once again and have a great day!


I was trying to solve some change of basis exercises, so I've done them and I want you to tell me if I've done it correctly.     1) Given the coordinates system $(O'; X'' Y'')$ asociated to the   basis $B=[{b_1=\frac{1}{\sqrt{2}}; \frac{1}{\sqrt{2}};  > b_2=\frac{-1}{\sqrt{2}}; \frac{1}{\sqrt{2}}}]$ with origin in   $O'=(2;5)$, find the intersection between $Q: y''^2=-4 \sqrt{2} x''$   and the straight line $V=(0;5)+t(-1;1)     t\epsilon R$   Well, first I tried to write $Q$ in terms of $X$ and $Y$, and not in terms of $X''$ and $Y''$. I used the formula: $(\begin{matrix}     X''\\     Y'' \\     \end{matrix})$ =$(C)_B$ × $(\begin{matrix}     X-2\\     Y-5 \\     \end{matrix})$  Then I replaced those values in the equation of $Q$ and I got $Q: \frac{(-x+y-3)^2}{2}=-4 \sqrt{2} \frac{(x+y-7)}{\sqrt{2}}$  After that, I found the intersection between $Q$ and $V$ using equations and I got that the intersection points in $(O;XY)$ are $P_1(3;2)$ and $P_2(-1;6)$     2)Given the coordinates system $(O,X'Y')$ asociated to the basis   $B=[{b_1=\frac{1}{\sqrt{2}}; \frac{1}{\sqrt{2}}; > b_2=\frac{-1}{\sqrt{2}}; \frac{1}{\sqrt{2}}}]$ with origin in   $O=(0;0)$ and the ellipse $9X'^2+5Y'^2-3X'+2Y'-10=0$ find the   coordinates of the centre of the ellipse in $(O,XY)$   So, here I found the centre of the ellipse in $(O,X'Y')$ and it was $(\frac{1}{6}; - \frac{1}{5})$, then, doing something similar to what I've done before I found out that the centre in $(O,XY)$ was $( \frac{11}{30 \sqrt{2}};$ $\frac{-1}{30 \sqrt{2}}$)


I'm trying to create alias for for cd command to AppData and %programdata% folders but I got path not found while if  I write manual it works, here is what I'm doing:  In .bashrc I do   alias client= 'cd /mnt/c/Users/username/AppData/' alias driver= 'cd /mnt/c/ProgramData/   the error is   -bash: alias: cd /mnt/c/Users/username/AppData/: not found -bash: alias: cd /mnt/c/ProgramData/: not found   however in the terminal cd mnt/c/Users/username/AppData/, will navigate me to the folders


Taking jewellery from United States to India

I bought some jewellery during the black friday sale for my family. The total cost of which is around $500 but the actual value is higher. Can I still take all of the items I purchased without paying custom charges or should I return some stuff so that the actual value that I take across borders does not cross more than the allowed threshold? Keeping in mind I'm on an F-1 visa and have been staying in the states for more than a year. P.S. I would appreciate if someone can list a resource to check what is the actual value of the allowed items allowed to be taken from the United states to India without paying the custom duty.


Evaluate $\lim\limits_{n \to \infty}\frac{1!+2!+\cdots+n!}{n!}$.

Problem Evaluate $$\lim\limits_{n \to \infty}\frac{1!+2!+\cdots+n!}{n!}.$$ Solution 1 Applying Stolz theorem, $$\lim_{n \to \infty}\frac{1!+2!+\cdots+n!}{n!}=\lim_{n \to \infty}\frac{(n+1)!}{(n+1)!-n!}=\lim_{n \to \infty}\frac{n!(n+1)}{n!\cdot n}=\lim_{n \to \infty}\frac{n+1}{n}=1.$$ Solution 2 \begin{align*} 1=\frac{n!}{n!}\leq \frac{1!+2!+\cdots+n!}{n!}&\leq \frac{(n-2)!(n-2)+(n-1)!+n!}{n!}\\&=\frac{n-2}{n(n-1)}+\frac{1}{n}+1\to 1(n \to \infty). \end{align*} Applying the squeeze theorem, $$\lim\limits_{n \to \infty}\frac{1!+2!+\cdots+n!}{n!}=1.$$ Any more solutions? Thanks.


What is the maximum number of consecutive periods can be used in a grammatically-correct sentence?

I'm curious how many period characters can be in a row in a valid sentence. I acknowledge that there are different conventions for how to treat dots (e.g. treating an ellipsis as a single character or putting a space before and after an ellipsis), but for the purposes of this question, I think we should allow reasonable conventions that could be considered acceptable, even if they aren't perhaps recommended. I'm also fine ignoring whitespace. Examples  Here's a sentence with one period. This sentence combines two periods into one, according to some prof. This sentence ends with an ellipsis.... This sentence also might make sense, according to Knowsalot et al.....  Clarification Please read the question carefully and in its entirety before voting to close a question. Some closed this question because they thought this question has an answer here: . Those people have made unreasonable assumptions about what this question is asking. For clarity: I am not asking whether or not the period following an abbreviation gets put at the end of a phrase. I am not asking about a period before or after an ellipsis. I am asking how many periods can be in a row for any reason. Clearly, those other questions are relevant to my question, but to answer my question, you'd need the answers to all of those kinds of questions and combine their answers to be able to answer this question.


Dummit exercise 14.3.11: extension degree of finite fields

Dummit and Foote's exercise 14.3.11 asks to prove that $f(x) = x^{p^{n}}-x+1$ is irreducible over $\mathbb{F}_{p}$ iff $n=1$ or $n=p=2$. To prove the 'only if' part, the exercise suggest to prove that if $\alpha$ is a root of $f(x)$, then so is $\alpha + a$ for every $a \in \mathbb{F}_{p^{n}}$. This implies that $\mathbb{F}_{p}(\alpha)$ contains $\mathbb{F}_{p^{n}}$ and that $[\mathbb{F}_{p}(\alpha):\mathbb{F}_{p^{n}}] = p$.   I've proven everything except that $[\mathbb{F}_{p}(\alpha):\mathbb{F}_{p^{n}}] = p$. Can anyone give me some ideas for this? Thanks.


There is a dateTime in the format of "dd/mm/yyyy hh:mm:ss tt". A string is required to be created from this, in the format of "yyyyMMddHHmmssfff".   string timestamp = (dateTimeUTC.Year).ToString() +  (dateTimeUTC.Month).ToString() + (dateTimeUTC.Day).ToString() + (dateTimeUTC.Hour).ToString() + (dateTimeUTC.Minute).ToString() +                            (dateTimeUTC.Second).ToString() + (dateTimeUTC.Millisecond).ToString();   The problem with this code is that if any of the digits for month or day are 0-9, there is no 0 in front of the digit. For example, suppose we have the dateTime 1/26/2020 11:59:53 PM. This must be converted to 20200126235651100. Instead it will be 20201262359530.


Why did the First Order do this at the cantina?

In The Force Awakens, after the First Order are alerted to BB-8, Rey, and Finn's presence at the cantina, an aerial bombardment of the compound begins. They also deploy ground troops.  Wouldn't it have been better to not have an aerial bombardment and simply have the troops surround the cantina, keeping as many people as possible bottled up inside it while they searched both the interior and surrounding area for BB-8?  Instead of a surgical extraction, the strategy that they chose seemed to create chaos and even risked destroying BB-8.  Perhaps this was a sign of the inexperience and emotionally-charged state of Kylo Ren, but General Hux seemed to have more direct authority over the deployment of troops and fighters.  So what was the strategy behind these tactics?


I've making some research about RSA, and see that it is working with products of two prime numbers and difficulty of factorization... But why we can't make assumptions of primes like this way...  Here is a example, 27221 is product of two three digit primes, so we can think last digits of primes can be  ab1  cd1  or  ab9  cd9  or  ab3  cd7  or  ab7  cd3  So it seems to me thinking like this and going backwards for every digit of products with computer power could work. What is problem of my logic?


How to count the repeated word as one in serial number using Excel?  For example:  Below are subject code  BC02551 BC02551 BC02551 BC02552 BC02552 TQ22 TQ123 TQ123   Now I want to count the code which are similar as one. Like below:  Sr. No.    1       BC02551           BC02551           BC02551   2       BC02552           BC02552   3       TQ22   4       TQ123           TQ123


I installed Ubuntu 18 alongside Windows 10 on the same C drive, SSD, by creating two partitions. However, I was hoping that both Windows and Ubuntu would be able to access my D Drive, HDD. However, Ubuntu can only read that drive and not write to it. I have fiddled around with it a little and tried to find a solution and I think that remounting it through recovery mode worked but then didn't after reboot. Ubuntu says that it is read/write but it doesn't actually allow writing.


Take a look at .   He has bronze tag badge for , but not for  and (for those tags he has ).   The score calculation looks like wrong,  .    But, it shows 216 for .


Search for first and lastname without order

maybe there is a simple answer to my problem:  I have a mssql table ('Person') with a field for first and one for last name. I am coding a Program, where the User should be able to search for persons.     SELECT id, firstname, lastname FROM Person WHERE firstname LIKE   @searchstring + '%' OR lastname LIKE @searchstring + '%'   doesn't work very well, because if the user types 'John W' nothing is found.  For example the person I search for is called John Williams: It should work with searchstrings like 'John W', 'Williams Jo', 'Will' or 'Joh'  Concatenating first and lastname and use %Searchstring% also doesn't work well, because if the searchstring is e.g. 'Will' it should find people who are called Will, Willibald, Williams or Willson or something like that, but not a Person called Goodwill e.g.  And the query should be as fast as possible, because it is executed at every keydown...  edit: forgot to mention that the database must not be changed, because it is from another company.  Thank you for your help.


Why is the Christian god being spelled with a lowercase letter?

It's been going on for some time, but the phenomenon which was once seen as almost an act of rebellion is now becoming more commonplace. God, capitalized, is increasingly seen only at the start of a sentence. Leaving aside whether one believes in a god, or in the Christian God Himself, why is this convention not being criticized?   God is after all a proper noun, the name of a deity which for over 2,000 years we have all heard of, and know by that very name. It matters not that god or God may or may not exist. It is a name. And like any other name that belongs to a real person or a fictional character in a book, it ought to be spelled with a capital letter.   I always feel uncomfortable writing about God with a capital letter, I always feel there is a hoard of die-hard atheists ready to accuse me of being a creationist, god forbid. (Should that have been: "..., God forbid"?)  Is the spelling of the Christian "God" politically incorrect?  Is God with a capital letter, grammatically speaking, an archaic tradition? And if so, why?  EDIT: From the answers so far posted, no one has yet mentioned the political and social consequences this deceptively innocent, lowercase spelling may have had on us, on today's society. And this has lead me wondering, whether in the history of the English language there has been anything similar; any linguistic subversion, spoken or written which was in reality a show of defiance toward an established authority such as a government or political leader.


"The two youths walked back, recounting/each recounting to the/each other"

A. The two youths walked back, each recounting to the other what had happened to them.   B. The two youths walked back, recounting to each other what had happened to them.   Which sentence is more common?


upstart scripts: run a task after networking goes up

I'm working on moving my current server setup to newer hardware, and migrating from ubuntu karmic koala to lucid lynx. Currently i'm using gw6c (compiled from the gogo6 website, as opposed to the version from the repositories) to get ipv6 access for my systems. On the karmic koala system, i used simple init.d script to get the ipv6 client started   #! /bin/sh /usr/local/gw6c/bin/gw6c -f /usr/local/gw6c/bin/gw6c.conf   I figured since this runs at any runlevel, it should translate to  respawn console none  start on startup  stop on shutdown  script exec /usr/local/gw6c/bin/gw6c -f /usr/local/gw6c/bin/gw6c.conf emit free6_ipv6_started end script   this works fine started from initctrl, but it apparently fails to start when it boots. - its status being stop/waiting. It works fine (and respawns) when started otherwise.Any ideas on where i'm going wrong, and what would be the appropriate 'start on' arguement?  EDIT: the exact error is 'init: gw6c main process (xxx) ended with status 8' followed by the process respawning , with xxx being a PID i suspect. I'm also half suspecting this is cause gw6c starts before networking does, and i need my eth0 up before gw6c is


My current scenario involves allowing various rules, but I need ftp to be accessible from anywhere.  The OS is Cent 5 and I am using VSFTPD.  I can't seem to get the syntax correct.  All other rules work correctly.  ## Filter all previous rules *filter  ## Loopback address -A INPUT -i lo -j ACCEPT  ## Established inbound rule -A INPUT -m state --state ESTABLISHED,RELATED -j ACCEPT  ## Management ports -A INPUT -s x.x.x.x/24 -p icmp -m icmp --icmp-type any -j ACCEPT -A INPUT -s x.x.x.x/23 -p icmp -m icmp --icmp-type any -j ACCEPT -A INPUT -s x.x.x.x/24 -p tcp -m state --state NEW -m tcp --dport 22 -j ACCEPT -A INPUT -s x.x.x.x/23 -p icmp -m icmp --icmp-type any -j ACCEPT -A INPUT -s x.x.x.x/23 -p tcp -m state --state NEW -m tcp --dport 22 -j ACCEPT -A INPUT -i lo -j ACCEPT  ## Allow NRPE port (Nagios) -A INPUT -s x.x.x.x -p tcp -m state --state NEW -m tcp --dport 5666 -j ACCEPT -A INPUT -s x.x.x.x -p tcp -m state --state NEW -m tcp --dport 5666 -j ACCEPT  ##Allow FTP  ## Default rules :INPUT DROP [0:0] :FORWARD DROP :OUTPUT ACCEPT [0:0] COMMIT   The following are rules I have tried.  ##Allow FTP -A INPUT --dport 21 any -j ACCEPT -A INPUT --dport 20 any -j ACCEPT  -A INPUT -p tcp --dport 21 -j ACCEPT -A INPUT -p tcp --dport 20 -j ACCEPT  -A INPUT -p tcp -m state --state NEW -m tcp --dport 21 -j ACCEPT -A INPUT -p tcp -m state --state NEW -m tcp --dport 20 -j ACCEPT   -A INPUT -p tcp -s 0/0 -d 0/0 --destination-port 20 -j ACCEPT -A INPUT -p tcp -s 0/0 -d 0/0 --destination-port 21 -j ACCEPT  -A INPUT -s 0.0.0.0/0 -p tcp -m state --state NEW -m tcp --dport 21 -j ACCEPT -A INPUT -s 0.0.0.0/0 -p tcp -m state --state NEW -m tcp --dport 20 -j ACCEPT


Running a 32-bit application in Debian Wheezy 64 bits: Missing libraries

I want to play the game Aquaria in a Debian Wheezy 64 bits. The installation went ok, but when trying to play the game I get these errors:  ALSA lib conf.c:3314:(snd_config_hooks_call) Cannot open shared library libasound_module_conf_pulse.so ALSA lib control.c:951:(snd_ctl_open_noupdate) Invalid CTL hw:0 AL lib: alsa.c:1000: control open (0): No such file or directory Message: SDL_GL_LoadLibrary Error: Failed loading libGL.so.1   I have added 32 bit compatibility with dpkg --add-architecture i386 and I think that the required libraries are present in the system since typing locate libasound_module_conf_pulse.so yields:  /usr/lib/x86_64-linux-gnu/alsa-lib/libasound_module_conf_pulse.so  and locate libGL.so.1:  /etc/alternatives/glx--libGL.so.1-x86_64-linux-gnu /usr/lib/mesa-diverted/i386-linux-gnu/libGL.so.1 /usr/lib/mesa-diverted/i386-linux-gnu/libGL.so.1.2 /usr/lib/mesa-diverted/x86_64-linux-gnu/libGL.so.1 /usr/lib/mesa-diverted/x86_64-linux-gnu/libGL.so.1.2 /usr/lib/x86_64-linux-gnu/libGL.so.1 /usr/lib/x86_64-linux-gnu/fglrx/fglrx-libGL.so.1.2 /usr/lib/x86_64-linux-gnu/fglrx/libGL.so.1   However, it seems that Debian is ignoring them. What can I do to play Aquaria?  EDIT 1: ldd aquaria  linux-gate.so.1 =>  (0xf77e1000) libSDL-1.2.so.0 => /opt/Aquaria/./libSDL-1.2.so.0 (0xf7748000) libopenal.so.1 => /opt/Aquaria/./libopenal.so.1 (0xf76fa000) libstdc++.so.6 => /opt/Aquaria/./libstdc++.so.6 (0xf760d000) libm.so.6 => /lib/i386-linux-gnu/i686/cmov/libm.so.6 (0xf75c3000) libgcc_s.so.1 => /opt/Aquaria/./libgcc_s.so.1 (0xf75b8000) libc.so.6 => /lib/i386-linux-gnu/i686/cmov/libc.so.6 (0xf7455000) libdl.so.2 => /lib/i386-linux-gnu/i686/cmov/libdl.so.2 (0xf7451000) libpthread.so.0 => /lib/i386-linux-gnu/i686/cmov/libpthread.so.0 (0xf7437000) librt.so.1 => /lib/i386-linux-gnu/i686/cmov/librt.so.1 (0xf742e000) /lib/ld-linux.so.2 (0xf77e2000)


Does C# have anything comparable to Python's list comprehensions?

I want to generate a list in C#. I am missing python's list comprehensions. Is there a C# way to create collections on the fly like list comprehensions or generator expressions do in python?


"method driver /usr/lib/apt/methods/https could not be found" update error

sudo apt-get update E: The method driver /usr/lib/apt/methods/https could not be found. michael@Ubuntu:~$ sudo apt-get clean michael@Ubuntu:~$ cd /var/lib/apt michael@Ubuntu:/var/lib/apt$ sudo mv lists lists.old michael@Ubuntu:/var/lib/apt$ sudo mkdir -p lists/partial michael@Ubuntu:/var/lib/apt$ sudo apt-get clean michael@Ubuntu:/var/lib/apt$ sudo apt-get update E: The method driver /usr/lib/apt/methods/https could not be found. E: Could not get lock /var/lib/dpkg/lock - open (11: Resource temporarily unavailable) E: Unable to lock the administration directory (/var/lib/dpkg/), is another process using it? michael@Ubuntu:/var/lib/apt$ sudo apt-get update E: The method driver /usr/lib/apt/methods/https could not be found.   Why am I getting these errors when doing an apt-get update?


Why are hand-built wheels considered to be better than machine-built wheels? I would think that a machine-built wheel would be better and cheaper, since machines generally do a more precise job than humans.