There are a number of questions on this site which query the internal logic of the Harry Potter world. Here's a couple of examples:       I could quote more, generally about economy, geography and employment in the wizarding world. I suspect most people who've read all the books have probably been struck by one or more such questions as they've gone through.   Of course, it's a testament to the skill of the author and the wonder of the world itself that these omissions don't really spoil most people's enjoyment of the story. The suspension of disbelief is extremely strong, partly precisely because Rowling has chosen to focus on the narrative over the consistency.   One of those linked questions, the one about Quidditch, is mine. I recently added another. After which I began to wonder: what if this isn't just the result of an author being more interested in story and characters than they are in consistency? What if Rowling intentionally made aspects of the wizarding world nonsensical in order to make points about modern society?  Take Quidditch. It leaves much to be desired as a sport (see answers to linked question above), yet many Wizards seem oblivious and remain fanatically devoted to it. Could this not be read as a wry commentary on the fanatical devotion shown by many sports fans to what are, after all, relatively inconsequential pursuits? And the "poor" nature of some Wizarding families in spite of the magic available to them. Again, perhaps a comment on how a rich western society still relegates some people to live in poverty, in spite of the wealth of the nation?  Other authors have form here. Kazuro Ishiguro is on record has saying he's not interested in whether his fantasy worlds make any sense, merely in whether they work to help examine his chosen themes.  A question about allegory is, to some extent, unanswerable. Unless the author has specifically commented on whether or not the allegory is intentional and/or accepted by them. So this is my question: has Rowling ever intimated that some or all of the logical inconsistency in her invented world should be read as allegory or metaphor?

Despite literary analysts' constant claims, JRR Tolkien insisted that his (LOTR series) books are not commentaries on class warfare, racism, the world wars etc. and that they are purely self-contained mythologies, irrespective of people's analyses and speculation, saying:     As for any inner meaning or "message", it has in the intention of the author none. It is neither allegorical nor topical.... I cordially dislike allegory in all its manifestations, and always have done so since I grew old and wary enough to detect its presence.   I much prefer history, true or feigned, with its varied applicability to the thought and experience of readers. I think that many confused "applicability with "allegory"; but the one resides in the freedom of the reader, and the other in the purposed domination of the author.   — J.R.R Tolkien    J.K Rowling's Potter series certainly contain a large slew of ideas, themes, characters and stories that definitely fit the bill of commentary on society or societal phenomena (the media, political corruption, class warfare, slavery, racism etc.). Some go further than being allegory and almost being surrogates for topical commentary (the same way Star Trek used aliens as surrogate ethnic minorities to talk about race issues, which would have been taboo otherwise, at the time).  My question is whether this has ever been discussed, mentioned or otherwise confirmed by J.K Rowling herself. If yes, the more varied and numerous the sources, the better (i.e. not just one interview).


I have a problem that when I apply a SubSurf modifier to my project, it has some starring and messy edges around the connection of my spheres. My goal is to have a string of "bubbles" which are smooth. I would also like to be able to rig them under one armature. The seams for UV unwrapping should be able to be placed where the spheres connect. I have used a Boolean modifier to merge the spheres. The problem I am having is that when I try to smooth out the spheres, starring occurs at the top and bottom of them. I have tried using loop cuts, the smooth option in the tools menu, and starting with a high-poly model, but none of that worked for me.  Here is an example of the starring:     Here is how the spheres should connect (Please ignore the starring and high-poly count):     And here is a download to what I would like to end up smoothing out:   If you have questions, please ask.

When I create a UV sphere and add the subdivision surface modifier, the following wrinkle appears.    How can I avoid it?  I've read the article  but there seems to be no clear solution.  UPDATE 1  I've used the word 'apply' in the first sentence of the initial version of this question. It's misleading since I want to preserve the modifier without 'applying' it. Rather, what I meant is 'adding' the modifier.  UPDATE 2  I followed josh sanfelici's solution, but still there is an artifact at the pole.  Here is the screen: (A rendered view with a sun lamp)    Maybe it's the limitation of the general-purpose subdivision modifier.  BTW, when the cast modifier is added after the subdivision modifier, the sphere becomes perfect (even for my original wrinkled sphere).  But since I want to edit the resulting sphere (for example, scaling X, Y, etc) while modifier is added but not applied, it's not usable.


I am writing a document class report that has a maximum page limit. I tend to stay away from float environments for tables and figures since I like to have them where I code them in (I try [h], and sometimes it works, sometimes it doesn't). For example, for figures I usually do this:  \begin{center}   \includegraphics[scale=0.6]{figure.png}   \captionof{figure}{caption}   \label{fig:figure} \end{center}   But I have to make a subfigure for some of my report's pictures. Here is the code for the subfigure:  \begin{figure}[h]   \centering   \begin{subfigure}{0.5\textwidth}     \centering     \includegraphics[width=\linewidth]{figure1.png}     \caption{caption}     \label{fig:figure1}   \end{subfigure}   \begin{subfigure}{0.5\textwidth}     \centering     \includegraphics[width=\linewidth]{figure2.png}     \caption{figure2 caption}     \label{fig:figure2}   \end{subfigure}   \caption{figures}   \label{fig:figures} \end{figure}   Is there a way to convert this into a non float environment or some package to ensure it will be always where I code it in?

How to influence the position of float environments like figure and table in LaTeX?   This is a general question and should collect useful answers for all users. I hope we can use this as a reference


I am using Ubuntu 14.04. I like default unity desktop environment, but now I want to try Kubuntu. So please tell me a way to do that.  I should have options for choosing which desktop environment to start at log in screen as i do not want to replace unity with KDE. So please help me... Thanks in advance!!!!

I have just installed the latest Ubuntu 14.04 and I would like to install KDE along side my Gnome/Unity that I have now. How can I do this?  Thanks!


I don't know, how should I start solving this: $$a_1 = 2 \\ a_n = 2a_{n-1} +7$$ using the repertoire method.  Could anyone give me an algorithm or explain, how to use this method in this case?

There are a few questions already about this method, which has stumped me for a long while. The process is explained, for instance, here:   What I absolutely don't get is: What's the meaning of plugging in simple functions (which are not solutions) in the recurrence and how would that help finding what the right solution really is?  As I understand it, we have a function determined by a recurrence relation and we want to find a closed formula for it. The recurrence being linear, we assume this closed form is a linear combination of 3 other functions, with coefficients $\alpha, \beta$ and $ \gamma$.   The first method suggested in the book is clear to me: set simple values for the constants, since the function will be the same for all of them, and try to guess A, B and C and prove it by induction. What I don't get is the "dual" repertoire method.  $f$ could be anything, but it's something fixed, so I don't see any meaning in this process of plugging in $f(n) = 1$. $f$ clearly is not 1. What is going on?  I expect everything coming down to seeing a vector space / module in two different ways and then somehow picking some basis vectors from each. However, I can't work out the right abstraction.  I'd like to ask for a very explicit top down explanation of this repertoire method, if possible with linear algebra vocabulary.


Can a ranger pick two humanoid races as their favored enemy at level 1, and then two more humanoid races at level 6 or level 14? My reading of the Favored Enemy feature is that any time the ranger chooses a favored enemy, be it at Level 1, 6 or 14, the ranger may alternately choose two humanoid races instead of one non-humanoid creature type. However, D&D Beyond does not allow a player to choose two more humanoid races at level 6 or 14 if they have previously chosen two humanoid races at level 1 or 6. Is my interpretation of the Favored Enemy feature incorrect, or is D&D Beyond's implementation incorrect? Note: My question is similar, but not a duplicate, to  one. That question is about a scenario where a ranger chooses a non-humanoid creature type as their favored enemy at level 1, and then wants to choose two humanoid races at level 6. My question is about a ranger who chooses two humanoid races at level 1, and wants to choose two more humanoid races at level 6.

In D&D 5e, the Ranger can choose at first level to have a Favored Enemy of a single broad type (i.e. fiends, giants, aberrations, etc.) or of two different specific humanoids (such as orcs and gnolls). They gain additional Favored Enemies at 6th and 14th level.  At each of those levels, could they opt to pick two humanoid races? Or would the choice be between one type and one specific humanoid?  Relevant text:     Choose a type of favored enemy: aberrations, beasts, celestials,   constructs, dragons, elementals, fey, fiends, giants, monstrosities,   oozes, plants, or undead. Alternatively, you can select two races of   humanoid (such as gnolls and orcs) as favored enemies.   And:     You choose one additional favored enemy, as well as an associated   language, at 6th and 14th level.   (Both quotes from PHB, pg 91.)  Specifically, I'm wondering whether "one additional favored enemy" means one absolutely, or whether the "Alternatively..." sentence means that two humanoid races can be substituted for one type whenever you select a favored enemy.


We are using ASP.NET Webforms (not MVC).  My question is this:  Is it possible to open a new browser window using a postback and then some variety of Response.Redirect?

I want to do a Response.Redirect("MyPage.aspx") but have it open in a new browser window. I've done this before without using the JavaScript register script method. I just can't remember how?


I have this code :  \documentclass[french]{article} \usepackage{pgfgantt} \usepackage{babel}  \begin{document}  \begin{figure}[htbp] \begin{ganttchart}[y unit title=0.4cm, y unit chart=0.5cm, vgrid,hgrid,  title label anchor/.style={below=-1.6ex}, title left shift=.05, title right shift=-.05, title height=1, bar/.style={fill=blue!50}, incomplete/.style={fill=white}, progress label text={}, bar height=0.7, group right shift=0, group top shift=.6, group height=.3]{1}{21} \gantttitle{2011}{21} \\ \gantttitlelist{1,...,21}{1} \\ \ganttbar{TA1}{1}{3} \\ \ganttbar{TA2}{1}{2} \\ \ganttbar{TA3}{4}{7} \\ \ganttbar{TA4}{8}{8} \\ \ganttbar{TA5}{8}{13} \\ \ganttbar{TA6}{14}{16} \\ \ganttbar{TA7}{14}{21} \\ \ganttbar{TA8}{17}{18}   \ganttlink{elem1}{elem2} % <- Line that doesn't work  \end{ganttchart} \end{figure}  \end{document}   It work fine except when i want to add liaison between task, with the line \ganttlink{elem1}{elem2} that produce this error:  E: /Users/samuelriedo/Desktop/untitled.tex:21 Package tikz Error: + or - expected \ganttlink{elem1}{elem2} E: /Users/samuelriedo/Desktop/untitled.tex:21 Package tikz Error: Giving up on this path. Did you forget a semicolon? \ganttlink{elem1}{elem2}   Does anyone have an idea why it doesn't work to draw arrows between nodes ?

In this example month names are printed in English even the babel package is loaded with French language.  \documentclass{article} %\usepackage[pdftex,active,tightpage]{preview} %\setlength\PreviewBorder{2mm} \usepackage[frenchb]{babel} \usepackage{pgfgantt} \usepackage{lscape}    \begin{document}      \begin{landscape}          \begin{tikzpicture} % optional             \begin{ganttchart}[x unit=2.5mm, time slot format=isodate]{2014-04-28}{2014-07-11}                 \gantttitlecalendar{month=name} \\                  \ganttbar{Task 1}{2014-04-28}{2014-05-10} \\              \end{ganttchart}         \end{tikzpicture}     \end{landscape}  \end{document}   Babel is not working with pgfgantt?


I got  ERROR in LATEX like this  Error ! Undefined control sequence. \documentclass  anyone is there give me response quickly ... I hope give the answer in detail because i already read more answer about this error

Very new to Tex. Trying to get the most basic doc to work. Not matter what I do I always get an "Undefined control sequence" at line 1 of my document. As of now, I am only trying to build the following:  \documentclass{article} \begin{document} This is a test of the article \end{document}   Full error is:  This is pdfTeX, Version 3.1415926-2.5-1.40.14 (TeX Live 2013)  restricted \write18 enabled. entering extended mode (./example.tex ! Undefined control sequence. l.1 \documentclass                   {article} ?   I have tried many other variations, including \usepackage directives that people mentioned - nothing every varies.


I am trying to balance a chemical equation algebraically and have found the resulting system of equations:  $$\begin{align*}     3a+8b+d&=12e+4f+2g\\     a&=e\\     4a+4c+3d&=4e+3f+g+3h\\     2b+d&=3e+f\\     c&=h \end{align*}$$ I am able to reduce this to a system of three equations: $$\begin{align*}     8b+d&=9e+4f+2g\\     c+3d&=3f+g\\     2b+d&=3e+f \end{align*}$$ Now, I recognize that there are more variables than there are equations, and so there is no single solution to this equation. However, I need a solution with reasonably low numbers and only integer values for all the variables ($a,b,c,d,e,f,g,h$ or, by substitution, $b,c,d,e,f,g$). A matrix solution won't work since (in standard $AX=B$ form) the only elements in $B$ are zero and therefore all the variables are zero.  As a side note, the reaction is: $$H_3PO_4 + (NH_4)_2 + MoO_4 + HNO_3 \longrightarrow (NH_4)_3PO_4 + MoO_3 + NH_4NO_3 + H_2O$$ If there is a better way to go about this (besides inspection; I have been trying that for hours) please let me know.  Any ideas?

In my AP chemistry class, I often have to balance chemical equations like the following:  $$ \mathrm{Al} + \text O_2 \to \mathrm{Al}_2 \mathrm O_3 $$  The goal is to make both side of the arrow have the same amount of atoms by adding compounds in the equation to each side.  A solution:  $$ 4 \mathrm{Al} + 3 \mathrm{ O_2} \to 2 \mathrm{Al}_2 \mathrm{ O_3} $$  When the subscripts become really large, or there are a lot of atoms involved, trial and error is impossible unless performed by a computer. What if some chemical equation can not be balanced?  (Do such equations exist?) I tried one for a long time only to realize the problem was wrong.  My teacher said trial and error is the only way. Are there other methods?


@whuber stop closing my question, this is really inappropriate to block me from aksing my question!  I am trying again to post my question, as it is not a duplicate and not answered in any other similiar questions.   I have two random variables which are independent and normally distributed.  In this  on page 198-9 it says:    I am wondering about this formula.  In general it :    or on :    Therefore if we assume unequal variance, I would think like this:  $s_{\bar{X}_T-\bar{X}_C}=\sqrt{s^2_T/n_1+s^2_C/n_2}$  Where is my mistake here?  In the document later on for the standard error it says:    So their formula for std error corresponds to my formula for the std dev. I don't get the derivation of these $s_{\bar{X}_T-\bar{X}_C}$ vs $SE_{\bar{X}_T-\bar{X}_C}$.

I am referring to this  page 198-9:    I have troubles understanding the case with unequal variance.  In general it :   or on :    Therefore if we assume unequal variance, I would think like this:  $s_{\bar{X}_T-\bar{X}_C}=\sqrt{s^2_T/n_1+s^2_C/n_2}$  Howerver, they give this for the standard error:    I have troubles with deriving these two different formulas.


If I have 4 identical* LEDs wired in parallel to a single resistor so that the overall current available is 30 mA, do I still run the risk of premature burnout? The LEDs peak forward current is 30 mA.   *I know that LEDs from the same package may still have slight differences  I thoroughly read through the answers here -  - but it seems like the assumption would be that one would arrange a circuit so that the available current equals the total draw of the 4 LEDs, in my case 80 mA. The problem then would be that some would draw more than the peak. But, if I'm limiting the avaialble current to 30mA, is there still an issue? That would mean that ideally 7.5mA would be supplied to each LED. Obviously, based on the answer in the aforementioned link, it would not likely be even, but it shouldn't get to "dangerous levels".   Follow-up: Based on the volt/amperage curve, it looks like I'd be seeing a ~0.1V drop. Will this significantly affect the brightness?    Still pretty new to all this so my apologies for any incorrect terminology and faulty logic!

I'm trying to wire up 6 RGB LEDs in parallel, all controlled from a single source (well, three sources, one for each colour). The LEDs came supplied with resistors to limit the current of 270 Ohm for a 5v supply.  The problem is, 6 LEDs x 3 colours = 18 resistors, which is a lot, and means I need a much bigger board and a lot more soldering.  So, can I instead wire the LEDs in parallel with each other, with a single resistor protecting all six? (3 resistors in total, one for each colour). How do I calculate the value of that resistor?  More details:  The LEDs are being driven from a  to supply a bit of current, which is in turn controlled by a Netduino providing a PWM signal on the three channels.  . If I've correctly understood the data sheet they want 20mA of current, and forward voltages of 2, 3, 3 volts (for R,G and B respectively?). The supplied resistors were all 270 Ohm, so the channels may not be balanced quite right.  For extra credit: I'm only using 3 of the transistors in my driver chip, which has 8 in total. could I wire the PWM from the netduino to a second trio of transistors, and split the LEDs into two groups of three? Is it worth the effort?  PS I don't have any diagramming tools to hand, but I can provide a diagram (drawn in paint) if it would help clarify my question. (see also )


Coming unstuck figuring this one out.  How do you obtain a set of files from a specific repository and merge them into your current working directory. The difficulty I'm finding is I want to obtain files from a certain tagged release of the repository.  I've tried adding the remote repository and fetching the most up to date but I'm flooded with every single tag and then I'm unsure how to 'select' the files I want to replace with my own.  Any guidance is greatly appreciated.

I have made some changes to a file which has been committed a few times as part of a group of files, but now want to reset/revert the changes on it back to a previous version.   I have done a git log along with a git diff to find the revision I need, but just have no idea how to get the file back to its former state in the past.


I know that usually collision with velocity collinear can be solved by simultaneous equations of both conservation of energy and linear momentum. But my question is when 2D velocity is encountered, we do only have a vector and a scalar (isn't it?) equations, how can we then find out the velocity (which is equivalent to four scalars) after collision?  But on the other hand, since they will collide, the relative velocity of two particles should be collinear. Then this can be solved by providing an equivalent 1D model without dealing with perpendicular component of velocity.   This seemed to be a contradiction that we've used 3 scalar eqns to find out 4 variables which is obviously impossible mathematically. But see this: $$ m_1\vec{v_1}^2-m_1\vec{v_1'}^2+m_2\vec{v_2}^2-m_2\vec{v_2'}^2=0 {(1)}\\ m_1(\vec{v_1}-\vec{v_1'})=m_2(\vec{v_2'}-\vec{v_2}){(2)}$$ After simple maths, you got ${(1)}/{(2)}$ is a vector equation, i.e. we've made a new equation with physical meaning unknown. Is there any physics concept behind this? Futhermore, for rigid bodies with their shape, can we also find out their angular velocity by providing conservation of angular momentum?

I am trying to calculate the final velocities of two equal mass 2-dimensional circles after an elastic collision. I have tried to figure it out using formulas I know from high school physics, but nothing seems to work. My known variables are:   initial x and y velocities for each circle x and y distances between the centres of the circles at the time of the collision   The variables I would like to solve for are:   final x and y velocities for each circle   Here are diagrams showing all the variables:


I wonder how to delete a word (or the last 5 characters) using the field calculator in ArcGIS 10.2. I have a column such as:  Paris City; London City; Berlin City  I need to remove "City", to be left with Paris, London, Berlin.  Any tips on doing this automatically?

I'm looking for a field calculator Python statement to delete only the first two letters of string entries. For Ex:  !Name!.strip([0:2])   I know this syntax is incorrect.


Machine on this picture is inspired by video:    There must be error in the computation of energy balance or there is another negative energy. Can you help me?

I realize this isn't possible, but I can't see why not, especially if you change the model a little bit so that the balls simply travel through a tube of water on the way up, rather than exactly this model.  Please be clear and detailed.  I've heard explanations like "the balls wouldn't move" but that doesn't do it for me - I really do not see why the balls on the right would not be pulled/pushed up, and the rest of the chain wouldn't continue on.


Before posting this, as I know It's may be a common problem, I've already read posts on StackOverflow and read about templates but I'm still not able to solve my problem.  I have a class Tool with one function inside.  .h file  class Tools{  public:     template<typename T>     static std::string tostr(const T& t);    };   .cpp file  template<typename T> std::string Tools::tostr(const T& t) {     ostringstream os;     os<<t;     string res= os.str();     return res; }   The purpose of this function is to transform a number into a string (I know that the c++ 11 has already a function who does that but I would like to learn and to be more familiar with the concept)  In a another class, I use the function as the following:   string resStr= Tools::tostr<string>("7.12341");   But I got this error:     error: no matching function for call to 'Tools::tostr(float)'   Then I also tried this line:   string resStr= Tools::tostr("7.12341");   And I got also an error :     error: undefined reference to `std::string Tools::tostr(float   const&)'   I don't understand because I did the following verifications:   I defined static in the .h file the function I put the template<typename T> to define the template (I also tried with template<class T>) The return type string is well defined The class Tool.h is well included in the class when I call the function   Any ideas ?  Thanks you all.

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


If k is an odd positive integer, prove that for any integer $n≥1$ , $1^k+2^k+3^k+.....+n^k$ is divisible by $\frac {n(n+1)}2$  If k equals to 1, then it is an obvious case. Though the expression is seen to be true for $k=1$ , I could not prove it by induction, as the sum becomes too complex, according to what I did..  So I tried to prove that $1^k+n^k$ is congruent to $ 0(mod (n+1))$. That took me some far, but I could not come to a satisfactory conclusion..   Can anyone please help me with this? I feel there is a smarter approach to this one. Thank you..

Problem:Let $k$ be an odd positive integer. Prove that $(1+2+3...+n)|(1^k+2^k+3^k+...+n^k)$ for all positive integers $n$.  My Attempt: Proof (By Induction on $k$): Let $P(k)$ be the proposition that $(1+2+3...+n)|(1^k+2^k+3^k+...+n^k)$ for all positive integers $n$ when $k$ is odd. Then $P(1)$ and $P(3)$ are trivially true. So for $k\geq 5$, we assume that $P(k)$ holds. We would like to show that $P(k+2)$ also holds. In order to do that consider the following sums  $$1^{2}(1^k+2^k+3^k+...+n^k)=1^{k+2}+2^k+3^k+...+n^k$$ $$2^{2}(1^k+2^k+3^k+...+n^k)=2^2*1^k+2^{k+2}+2^2*3^k+...+2^2*n^k$$ $$..$$ $$n^2(1^k+2^k+3^k+...+n^k)=n^2*1^k+n^2*2^k+n^2*3^k+...+n^{k+2}$$ Note that $$1^2(1^k+2^k+3^k+...+n^k)+2^2(1^k+2^k+3^k+...+n^k)+...+n^2(1^k+2^k+3^k+...+n^k)\equiv 0\pmod {\frac{n(n+1)}{2}}$$  Therefore, if we denote $\sum_{i=1}^{n}i^2=s$, then    $(t)(1^k+2^k+3^k+...+n^k)-t+\sum_{i=1}^{n}i^{k+2}\equiv 0\pmod {\frac{n(n+1)}{2}}$ which implies that $P(k+2)$ holds. Hence by PMI we are done.  Now I am a bit hesitant in convincing myself whether this proof is correct or not. This is because I have never seen induction performed in this manner. Any reasons as to why this argument falls would be much appreciated.


I was trying to help a student with stats homework, but an example given in class has me a bit confused.  Background, to my understanding: A linear model is given to be one where $E[Y] = \beta_0 + \beta_1 X$. So for example, the model $E[Y] = \beta_0 + \beta_1 X^2$ can be framed as a linear model with the change of variable $X' = X^2$. Or $E[Y] = \exp{\beta_0 + \beta_1 X_1}$ with the change of variable $Y' = \ln{Y}$.  So then we get to the model $E[Y]=\beta_0 + \beta_1 X_1 + \beta_2 X_1^2 + \beta_3 X_1^3$. The professor says that, no problem, we can just substitute $R = X^2$ and $S = X^3$, and get $E[Y] = \beta_0 + \beta_1 X + \beta_2 R + \beta_3 S$, and we have a multiple linear regression with three variables.  It seems ridiculous to me to just hide non-linear terms this way and call them new variables. So ridiculous I'm having a hard time even finding the right foothold to criticize it. Could someone either explain why I'm wrong or help articulate my objection a bit more clearly?

If polynomial regression models nonlinear relationships, how can it be considered a special case of multiple linear regression?  Wikipedia notes that "Although polynomial regression fits a nonlinear model to the data, as a statistical estimation problem it is linear, in the sense that the regression function $\mathbb{E}(y | x)$ is linear in the unknown parameters that are estimated from the data."  How is polynomial regression linear in the unknown parameters if the parameters are coefficients for terms with order $\ge$ 2?


I am flying from Chennai to Toronto via Dubai, where a 21 hours layover is available in Dubai. In order to avail a transit visa, is it necessary to book a hotel? Since it's a connecting flight, what about the baggage? Due to the 21 hours layover will we get the baggage in Dubai or will we get it at the end?

Do I need a transit visa for a layover via airports in the UAE, such as Dubai International Airport or Abu Dhabi International Airport? If so, what are the requirements for such a visa? Can I get the transit visa on arrival?


I am going to write a program to manage my library of Magic cards and I am looking for a database file or list of all of the cards that have been released.  I know that the Gathering site is useful, but it limits the number of cards I can return in a search.  I would happily accept a spreadsheet file, database file, or even a text file.    The more information contained in the database, the better.  Having associated images would just be fantastic, but at this point I would settle for names and basic stats of the cards.

How is it that websites like SCG or CFB created their card database inventory. How would i be able to do this myself now? I want to create a similar website where a user can search and find any card with images. Obviously entering manually into a sql server is not feasible. Any help on easiest way to get this done?


How to add any language keyboard in Ubuntu 16.04 ?

I want to switch between English and another language.  I have tried Lubuntu and it was easy, I figured it out from the friendly menus. But in Ubuntu everything is so cryptic.


I've made a very large mistake. I've deleted some files accidentally from my C:// It was a bunch of .CR2 wedding photos that I mistaken for incorrectly exported JPEG's.   The files were too big to send to the recycling bin though. What can I do to recover the files? It was on an SSD, so I'm worried about that too.  I do have a backup on my compact flash + SD that I can use, although I have some duplicated .tiffs that I've retouched, removed bushes etc.   Any advice would be extremely appreciated.

I've accidentally deleted some really important files on my machine, and I'm looking to find out how to recover them.  Using the Trash bins "restore" isn't an option, as the files aren't there (mostly likely I wasn't paying attention and permanently deleted them from there).  Is there any way that I can un-delete these files?


Last night I ran an upgrade and this morning after a shutdown I am experiencing a login loop (even though I normally don't even have the login screen displayed). I checked .xsession-errors and found the following:  openConnection: connect: No such file or directory cannot connect to brltty at :0 upstart: gnome-session (Unity) main process (4070) terminated with status 1 upstart: unity-settings-daemon main process (4059) killed by TERM signal upstart: logrotate main process (3887) killed by TERM signal upstart: bamfdaemon main process (3973) killed by TERM signal upstart: unity-panel-service main process (4077) killed by TERM signal upstart: indicator-bluetooth main process (4110) killed by TERM signal upstart: indicator-power main process (4111) killed by TERM signal upstart: indicator-datetime main process (4113) killed by TERM signal upstart: indicator-keyboard main process (4117) killed by TERM signal upstart: indicator-sound main process (4118) killed by TERM signal upstart: indicator-printers main process (4121) killed by TERM signal upstart: indicator-session main process (4123) killed by TERM signal upstart: Disconnected from notified D-Bus bus   I have tried to reboot lighdm, mv .Xauthority into a backup file, reinstalling ubuntu-desktop and ubuntu-session, and chown .Xauthority.  I think it is a graphics driver issue, since when I appear at the login screen my displays arrangement is incorrect (I have two monitors).

I installed or upgraded to Ubuntu 16.04, but I'm having some problems with my graphics card.   The display is blank The display flickers Items on the screen do not display correctly Certain programs complain of graphics issues The computer boots to low-graphics mode Your specific issue may not be here, but try the solutions described in the answers anyway.   This question is very broad, but each one of these issues likely has one solution.    If you are experiencing a login loop, check the last part of my answer.    If you experience one of the listed issues and have your own solution (mine didn't work, or there's a faster way), feel free to post another POLITE answer, describing your problem and how you fixed it.    Those attempting to install Ubuntu, please refer to the section titled: If you are unable to enter a TTY or are trying to install Ubuntu.


public class Course {      public static void main(String[]args) {         String name="",course="",marks="";         System.out.println("Enter the name");         name=System.console().readLine();         System.out.println("Enter the course");         course=System.console().readLine();         System.out.println("Enter the marks");         marks=System.console().readLine();         System.out.println("the Name is"+name);     } }   But it works fine if compiled with cmd

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


When studying advanced classical mechanics, we all study about Lagrangians and the Euler-Lagrange equations and their importance. Of course, the Lagrangian is calculated based on the potential and kinetic energy. But usually, this is calculated using the position function and some constants. For example, potential energy can be defined as:  $$U(x) = - \int F(x)dx$$  and  $$F = ma \, .$$  This means that potential energy can be defined with mass and acceleration, which is the second derivative of the position function. Of course kinetic energy is defined as   $$(1/2) mv^2 \, .$$  Again, kinetic energy is defined with mass and velocity, the derivative of the position function. As you can see, it is kind of repetition to use the position function to derive the Lagrangian to figure out the dynamics of a system because that is what the position function tells you. So, what is the point of the Lagrangian? I heard from @Sofia that it may be used when only the potential and kinetic energy functions are known. But in what practical experiments it that done? It id much easier to find the position function. So what uses of the Lagrangian are there that can't be done with the position function?

What is Lagrangian mechanics, and what's the difference compared to Newtonian mechanics? I'm a mathematician/computer scientist, not a physicist, so I'm kind of looking for something like the explanation of the Lagrangian formulation of mechanics you'd give to someone who just finished a semester of college physics.  Things I'm hoping to have explained to me:   What's the overall difference in layman's terms? From what I've read so far, it sounds like Newtonian mechanics takes a more local "cause-and-effect"/"apply a force, get a reaction" view, while Lagrangian mechanics takes a more global "minimize this quantity" view. Or, to put it more axiomatically, Newtonian mechanics starts with Newton's three laws of motion, while Lagrangian mechanics starts with the Principle of Least Action. How do the approaches differ mathematically/when you're trying to solve a problem? Kind of similar to above, I'm guessing that Newtonian solutions start with drawing a bunch of force vectors, while Lagrangian solutions start with defining some function (calculating the Lagrangian...?) you want to minimize, but I really have no idea. What are the pros/cons of each approach? What questions are more naturally solved in each? For example, I believe Fermat's Principle of Least Time is something that's very naturally explained in Lagrangian mechanics ("minimize the time it takes to get between these two points"), but more difficult to explain in Newtonian mechanics since it requires knowing your endpoint.


I have searched around and haven't found a specific answer to my question..  I am wondering the best practice for storing timestamp information.  Example: user1 logs in in Florida (-0500) at 3:00pm EST The admin logs into the system an hour later from California (-0800) at 4:00pm  I want the admin to see the log onscreen and see that user1 logged in 1 hour ago..  My brain is going nuts bc i feel that i am over complicating this..  I should be able to use UNIX time stamp and then adjust with the -0800 or -0300.  Do i store the users timezone offset in their profile information? Do i store the -0300 with the log entry.  Any input would be greatly appreciated!

Would you recommend using a  or a  field, and why (using MySQL)?   I'm working with PHP on the server side.


I'll try to ask a naive question. In quantum field theory, which is more fundamental, fields or particles? And in string theory?

My confusion about quantum theory is twofold:    I lack an adequate understanding of how the mathematics of quantum theory is supposed to correspond to phenomena in the physical world I still have an incomplete picture in my mind of how cause and effect relationships occur at the quantum level of reality.    This is why phenomena such as "entanglement" make absolutely no sense to me. So, in an attempt to come to some understanding of all of this, I would like to know that if what we conceptualize as a "field" is merely an interaction among particles, and particles themselves are actually fluctuations in "fields", then which comes first, particles or fields?


$$x^2 \equiv 134 \text{ mod } 197$$   $$x^2 \equiv  134 \text{ mod }  197^2\times 67$$   $$x^2 \equiv  134 \text{ mod }  197^{30}\times2^{10}$$   $$x^2 \equiv  134 \text{ mod }  197\times 23^2$$   The firs one has a solution as the Legendre symbol gives 1, but I never got around understanding the other ones.   I notice that $134=2\times67$ but I am not quite sure how to use that for the other parts

In general, to show that $a$ is quadratic residue modulo $n$? What do I have to show? I'm always struggling with proving a number $a$ is quadratic residue or non-quadratic residue.    For example,     If $n = 2^{\alpha}m$, where $m$ is odd, and $(a, n) = 1$.    Prove that $a$ is quadratic residue modulo $n$ iff the following are satisfied:   If $\alpha = 2$ then $a \equiv 1 \pmod{4}$.   I just want to know what do I need to show in general, because I want to solve this problem on my own. Any suggestion would be greatly appreciated.  Thank you.


I have a Tier 2 character currently affected by the Death Curse after playing a Season 7 module, and I want to get rid of  that curse as soon as possible (but I haven't started playing the Tomb of Annihilation Hardcover yet, so ending the Death Curse by completing its story with my character would most likely take a very long time).   I have, however, read information about Season 7 Tier 3 material being able to make you automatically end the Death Curse on your characters. So, as I want to be sure that I understood properly, is the following statement accurate ?  "Once Season 7 Tier 3 material is released (supposedly in January 2018, so should be in a few weeks after this question is posted), I can simply choose to end the Death Curse on any of my Tier 1/2 characters currently affected by it - this permanently prevents me from playing Season 7 Tier 1/2 material (Tomb of Annihilation + DDAL07-X) with these characters, but not other seasons' Tier 1/2 material"

I have an Adventures League character and enjoy playing, but don't have the time to actually complete a full season.  So I can only "adventure" a few times a year/season.  So if I, for example, did an adventure in the Ravenloft season, how would I get out of Barovia.  Or how would I get rid of the Death Curse.  I more generic answer is what I am looking for since upcoming season may have different conditions that are acquired.  I have skipped playing in those season because I didn't know what effect they would have on my character if I acquired a condition that wouldn't be cleared by the end of the session.  I mean if you were at a convention doing multiple seasons and you played one adventure for Tomb of Annihilation and the next Adventure in Ravenloft would your character be stuck in Barovia under the Death Curse?


int num = 000111; System.out.println(num);   The output is 73.  Why is this happening?  How can I make the output to be 111? Or, How can I make the value to become 111.

This prints 83  System.out.println(0123)   However this prints 123  System.out.println(123)   Why does it work that way?


I have to write a program with c# in visual studio. I want to call Prolog functions from C# code. Is there any way of this? Thanks so much.

Does anyone know of a nice (and preferably free) way to integrate Prolog and C#?  Im looking to create a Prolog dll or similar to call from my managed code, and retrieve an answer once all the processing has been complete. Im looking for it to be predominantly one sided (c# calls Prolog).  I have seen  which talks about Prologs real world usage but I was wondering if anyone had either any experience with c# & Prolog? or a nice tutorial/article?


I want to display text in Hindi Language in my website but it is giving me error. In return the value is showing as "????"  How do I display the text in Hindi or other language.  I have the META tags as well in place.

I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1.  Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur?  This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.


I'm guessing the difference between the two is the pin config and not the hotshoe mounting. Which one do I go for?

I am so confused - I'm fairly new to the whole camera trigger thing, as well as new to Yongnuo and the GH4, but here's my thing:  All I want to do is figure out what I need if I want to control 2 or 3 Yongnuo flashes remotely (none on camera) in manual mode. Which Yongnuo flashes work and which triggers and how many do I need?  I've read up so much on this and it's so tough. People have opened up and rewired certain Canon-friendly Yongnuo triggers to make them work with the GH3, which I have NO intention of doing, and I'm just lost. I just want to go to Amazon, order the right flashes and triggers and sort it out at home, with the confidence that whatever I buy WILL work with the Panasonic GH4


Is there any advantage or disadvantage between doing    var a = b.toString()   or  var a = b+""   from performance wise? Both works and serve the same purpose. We can think of doing it on for example a billion of strings.

CPU Cycles, Memory Usage, Execution Time, etc.?  Added: Is there a quantitative way of testing performance in JavaScript besides just perception of how fast the code runs?


I am sorry to ask an obvious question but I have tried looking this up on Google and cannot get an answer. In particle physics, when it is said that something is 'truth-level', what does that mean?  For example, if someone is referring to a 'truth-level' jet or a plot of jet masses at truth level, could someone explain in layman's terms what this actually means?

I am working on a CMS - related project where the ROOT trees contain both reconstruction-level and generation-level particle variables (like mass). However, I don't know the basic difference between the two or when we prefer using one type of variable over the other?


Now that Ubuntu is moving back to Gnome as the default desktop, will you port the HUD? It's Unity's killer feature, and I will miss it... So please port the HUD!

Where can I send feature requests? Both for Ubuntu as a whole and individual (supported) apps?


Let $k$ be a field, and let $K = k(x)$ be the rational function field in one variable over $k$. Let $\sigma$ and $\tau$ be the automorphisms of $K$ defined by $\sigma(f(x)/g(x)) = f(1/x)/g(1/x)$ and $\tau(f(x)/g(x)) = f(1-x)/g(1-x)$, respectively. Determine the fixed field $F$ of $\{\sigma,\tau\}$, and determine $\mathrm{Gal}(K/F)$. Find an $h \in F$ so that $F = k(h)$.   I tried to equate $\sigma(f), \tau(f)$ and $f$ to come up with some conditions, but it didn't really help. So, what is the goto methodology / thought process when solving these kind of problems? Where do I start?  Edit : From the conversation I had in the comments, it seems that $F$ might be the collection of $f/g$ where $f$ and $g$ are polynomials of the same degree with symmetric coefficients.

Let $k$ be a field and let $K=k(x)$ be the rational function field in one variable over $k$. Let $\DeclareMathOperator{\aut}{Aut}\sigma, \tau \in \aut(K)$ s.t. $$\sigma\left(\frac {f(x)}{ g(x)}\right)=\frac {f(1/x)}{g(1/x)}\qquad \&\qquad \tau\left(\frac {f(x)}{ g(x)}\right)=\frac {f(1-x)}{g(1-x)}.$$ Find the fixed field $F$ of $<\sigma, \tau>$. Determine $\DeclareMathOperator{\gal}{Gal}\gal(k/F)$. Find an $h \in F$ so that $F=k(h)$.   Now for the first automorphism $\sigma$, I think if I concentrate on $k[x]$ it will give me some idea. Now, if $f(x)=a_0+a_1x+a_2x^2+ \cdots + a_nx^n \in k[x]$ then if $x^n \sigma(f(x))=f(x)$ the case will be $a_i=a_{n-i}$ $\forall i=0(1)[n/2]$. So all the funtions in $K$ which will be fixed by $\sigma$ are of the form $\frac {f(x)}{ g(x)}$ where $f(x)=a_0+a_1x+a_2x^2+ \cdots + a_nx^n$ and $g(x)=b_0+b_1x+b_2x^2+ \cdots + b_nx^n$ such that $a_i=a_{n-i}$ $\forall i=0(1)[n/2]$ and $b_i=b_{n-i}$ $\forall i=0(1)[n/2]$.   Please check whether am I right or not?  And any ideas for the rest of the part?


Since the basic version of Diffie-Hellman key exchange protocol is vulnerable to Man In The Middle Attack, some sort of authentication is needed. It was mentioned that RSA digital signature can be used to handle this case. However, I don't understand that if the public keys of the two parties are known to each other, what would be the point of using DH at all? One of them can just propose a shared key k, compute its hash value and send the (k, h(k)) encrypted with the other one's public key. I appreciate if anyone can clarify the benefit of using DH in case of known public keys.

I just read this post here:  that asserts that in public key cryptography when asymmetric keys are used to secure communications, for parties to agree on a common shared secret, the following method is used:     So, say you want to send me a very long message, using asymmetric   encryption. Here's what you'd actually do:      (1) Pick a random key for use with a symmetric (fast) cipher. Encrypt   your message using that (fast) cipher and key. Send me that encrypted   message.      (2) Then use asymmetric (slow) encryption to encrypt the following   message and send it to me      "Hi, I just sent you a message encrypted using the BLAH   symmetric   cipher with key ABCDE123456."   So, you use your peer's public key to encrypt a shared secret, send the peer the encrypted secret, and then the peer decrypts the secret with his or her private key. In this way, you can use the big certificates to authenticate parties as well as use them to establish a shared secret.   This makes sense, but i have to be missing something. Why/how would DH be used here as well? I see that there are plenty of schemes like RSA2048 that have large keys, which i assume would be used in this way above, but also incorporate DH in their cipher suite:RSA_DHE, ECDHE.   What benefit does the DH component add? What can it do, now that we can establish a shared secret with the public keys in the certificates?


Ive just started doing reviews on stackoverflow, and after reading some of the debates about minor edits here on meta and developing my personal thoughts thoughts on the topic, I wonder about the case for adding tags.  I've seen that adding/removing a single or even a couple of tags is often considered too minor by other reviewers. However, this included at least one occasion when the single added 'java' tag was key which brought the entire question into context.  Unfortunately I havent been able to find that example again.  While I can see how pedantic minor spelling or grammer tweaks can and should be considered too minor, with tags you get more than a slight increase in readability. It helps bring the right people in on the question, helps give context to the question, helps remove confusion when incorrect tags are removed, and depending on the tag type also adds colouring to any code samples.  So is it ok to approve simple tag additions/removals, or should they be considered too minor?

Say, there's a Java (C#, Javascript, etc) question involving array and tagged only 'java'. Two months ago nobody would lift a finger to add 'arrays' tag: the benefit is tiny, if it exists at all.  Yet, last few days I've been noticing a lot of such edits and not sure what to do. Some users even go on retagging rampage, updating every question they can lay their hands on (you can see them repeatedly in the list of pending edits).  I don't mind those guys getting their lousy 1000 reputation this way (well, only a little), but somehow I feel that the system was intended for slightly more substantial changes.    What would you do in this case? Approve or reject?  PS Some examples from the last few minutes


Can someone help me understand what is the reason behind this drop in reputation in my Stack Overflow account please?

On Stack Exchange, users may gain a certain level of reputation.  What does reputation do? How can a user gain or lose reputation?   See also   in the Help Center  - Maximum amount of votes a user can use in a day and reputation requirements to vote.  - How to get an exact overview of the actions that got you your reputation.  - A full list of all privileges granted at each reputation level on all sites.


My cantilever brakes have roughly 1mm movement in them and can be moved backwards and forwards very easily by hand.   Is this because the shoulder bolt is too long or should the setup have some extra washers in place to stop this?  Will braking be improved by changing this?

I have been working my way through issues with noisy front cantilever brakes. After running through many different ways to solve the issue including new pads (Kool Stop Dura2 Duel Compound), setting the toe in and cleaning the rims.  I now believe the noise is being generated by the play in the pivot point of the cantilever arm. It is not possible to tighten the bolt any further so there will need to be a washer or shim placed in here.   Has anyone had any success in removing the play from the pivot point?  The bike is a cyclocross Kona Jake 2012.


How to figure out where the UV shows on the Mesh?  I know that there is an option or button to find out what part of the UV mapping matches up with the mesh so that fixing problems is easier.   Does anyone know what that option is?

Is there any simple way of telling which UV face corresponds to which 3D model face?  I created a room (in V 2.71) with a doorway and a window out of a hollowed cube and generated a UV mapping for it with "Smart UV project" but it is not obvious to me how to tell which face is, say, the floor or the left face of the door frame. I can highlight them in the main window to see which face gets highlighted in the UV window, but that's laborious and confusing.   And if my model gets a little more complicated, say I had more rooms and interior doorways, I know I'll end up with lots of tiny thin rectangles on the UV map often placed in really weird locations that don't correspond to the floorplan. Telling which is which will be really hard.  How is this done on complicated models?


Which of the following rings are fields ?      $\mathbb{Z}_{2}$, $\mathbb{Z}_{3}$, $\mathbb{Z}_{4}$, $\mathbb{Z}_{5}$, $\mathbb{Z}_{6}$, $\mathbb{Z}_{7}$, $\mathbb{Z}_{8}$   And can you give a brief reason why?  Thanks

Let $n \in ℕ$. Show that the ring $ℤ/nℤ$ is a field if and only if $n$   is prime.   Let $n$ prime. I need to show that if $\bar{a} \neq 0$ then $∃\bar b: \bar{a} \cdot \bar{b} = \bar{1}$. Any hints for this ?  Suppose $ℤ/nℤ$ is a field. Therefore: for every $\bar{a} \neq 0$ $∃\bar b: \bar{a}\cdot \bar{b}=1$. How can I show that $n$ must be prime ?


I wanted to use a modpack and used my account. I was asked to login to mojang, so I did. But it said it was incorrect. I reset my password and it still doesn't work. I can't log into minecraft.net or the vanilla launcher. My firewall does not block java and I have an English keyboard.

I created a Mojang account and downloaded the Minecraft launcher, but when I started it up, I couldn't log in. Since the log in fields did not require a username, I tried typing in my email, and still couldn't log in. I've tried after resetting my password, but that didn't work either. What am I supposed to do to log in and play?


I'm new to RegEx and I find it really confusing, so I would like a simple example of how to extract multiple strings of the same type.  Let's say we have a random string and I want to capture anything that is surrounded by "###". So I assume the pattern would look something like this:  string str = "dsad###hi###vdkv324da###dog###fs"; Regex pattern = new Regex("###.+###");   How do I match and store more than one occurrences? And the bigger question - after I do that I'll be left with "###hi###" and "###dog###", so how do I extract the "hi" and "dog" from those?

I have this gigantic ugly string: J0000000: Transaction A0001401 started on 8/22/2008 9:49:29 AM J0000010: Project name: E:\foo.pf J0000011: Job name: MBiek Direct Mail Test J0000020: Document 1 - Completed successfully  I'm trying to extract pieces from it using regex. In this case, I want to grab everything after Project Name up to the part where it says J0000011: (the 11 is going to be a different number every time). Here's the regex I've been playing with: Project name:\s+(.*)\s+J[0-9]{7}:  The problem is that it doesn't stop until it hits the J0000020: at the end. How do I make the regex stop at the first occurrence of J[0-9]{7}?


I am trying to construct a macro to use the editor field of @thesis entries to assign the supervisors of the thesis. I used the following post as a starting point  but this prints out the supervision and joint supervision strings in bold fonts (not sure why) instead that using the same fnt than the rest of the reference.  Here an MWE taken from  that I cannot get to output what the post intended to help doing as is provided. Perhaps the first would be to help me understand why this code does not print the supervisors and then how to give the supervision and joinsupervision strings an italic rather than bold font:  \documentclass[british,12pt,a4paper]{article} \usepackage{filecontents} \begin{filecontents*}{\jobname.bib} @thesis{geer,         author       = {de Geer, Ingrid},         title        = {Earl, Saint, Bishop, Skald~-- and Music},         type         = {phdthesis},         institution  = {Uppsala Universitet},         date         = 1985,         subtitle     = {The Orkney Earldom of the Twelfth Century. A Musicological             Study},         location     = {Uppsala},         supervisor       = {James Oint and Stan Upervisor},     }      @thesis{loh,         author       = {Loh, Nin C.},         title        = {High-Resolution Micromachined Interferometric Accelerometer},         type         = {mathesis},         institution  = {Massachusetts Institute of Technology},         date         = 1992,         location     = {Cambridge, Mass.},         supervisor       = {Stan Upervisor},     } \end{filecontents*} \usepackage[utf8]{inputenc} \usepackage{babel} \usepackage{csquotes} \usepackage{xpatch} \usepackage[style=authoryear,backend=biber]{biblatex} \usepackage{hyperref}   \begin{filecontents*}{english-thesis.lbx}     \ProvidesFile{english-thesis.lbx}[2014/06/14 english for thesis]     \InheritBibliographyExtras{english}     \NewBibliographyString{supervision,jointsupervision}     \DeclareBibliographyStrings{%         inherit           = {english},         supervision       = {{under the supervision of}{under sup\adddotspace of}},         jointsupervision  = {{under the joint supervision of}{under joint sup\adddotspace of}},     } \end{filecontents*}  \DeclareLanguageMapping{english}{english-thesis}  \newbibmacro*{thesissupervisor}{%     \ifnameundef{editor}{}{%         \ifnumgreater{\value{editor}}{1}         {\bibstring{jointsupervision}}         {\bibstring{supervision}}         \printnames{editor}}}  \xpatchbibdriver{thesis} {\printfield{type}} {\printfield{type}     \newunit     \usebibmacro{thesissupervisor}} {\typeout{yep}} {\typeout{no}}  \addbibresource{\jobname.bib} \nocite{*} \begin{document}     \printbibliography \end{document}

In the biblatex doc, it says ( Version 1.7, p.11):     thesis      A thesis written for an educational institution to satisfy the   requirements for a degree. Use the type field to specify the type of   thesis.      Required fields: author, title, type, institution, year/date      Optional fields: subtitle, titleaddon, language, note, location,   month, isbn, chapter, pages, pagetotal, addendum, pubstate, doi,   eprint, eprintclass, eprinttype, url, urldate   I would like to know if there is any "canonical" way to add the name of the supervisor(s) in a field of the .bib file (no .bbl manipulation please, I want my bibliography to be usable "as it" in several documents).  The expect result could be something like  :     Meand Myself. “A brilliant result, explained”. PhD thesis**, under the   joint supervision of Pr. Toto and Pr. Tata**. Université Paris 24,   Nov. 2013.   The "under the (joint) supervision" could be a string that would be declined in four ways:   under the supervision of  under the joint supervision of and the abridged forms


is a discussion that talks about Noether's theorem in quantum mechanics in its Hamiltonian formulation. It tells how symmetries give rise to conserved quantities. However, we know that there also exists a Lagrangian version of quantum mechanics called the path integral formalism. Is there a statement of Noether's (Noether-like) theorem in this formalism? If yes, what is the statement, and how do we prove it? I want to confine this post to single particle quantum mechanics only not QFT. I have found  post which I think talks about QFT. I am not sure what Ward-Takahashi identity would mean in quantum mechanics. For example, what is the analog of Ward-Takahashi identity for the motion of a particle in a central potential that has rotational symmetry?

The notion that conserved quantities (or quantities for which there is something like a continuity equation) correspond to symmetries of the action of a physical system can be formulated in various different realms (classical mechanics, field theory, Lagrangian / Hamiltonian formalism, QM, QFT ...). When it is formulated in QFT / QM we usually employ the operator formalism, and see that operators that commute with the Hamiltonian generate transformations that are symmetries. I'd like to know if there is similar thing in the path integral formulation of quantum mechanics (which essentially doesn't know any operators).


Is there a way to find unresolved questions, questions that have answers but none have been accepted by the OP of question on a specific tag?  I can see the option to find ones that are 'unanswered' but not the ones that are 'unresolved'.

I have some questions with answers, but none of the answers are acceptable (just wrong).  I'm sure there are a lot more people with the same problem.  Can you add a button to filter questions with answers but no accepted answer?  This way, people will see those questions and maybe try to offer a new perspective.


Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


Why can't I do something like this:  var myDictionary = new Dictionary<string, Type>();  // Add data to dictionary  foreach(var kvPair in myDictionary) {     var result = SomeMethod<kvPair.Value>(kvPair.Key); // Error }   So I cannot use the Type that I have in the Dictionary element and use it in the type parameter. Yes I could just send the dictionary to the SomeMethod(KeyValuePair). However I do not have control of how the function is implemented.   Error: The type or namespace name 'kvPair' could not be found (are you missing a using directive or an assembly reference?  I feel like I am missing something pretty foundational and I am not sure what it is.

What's the best way to call a generic method when the type parameter isn't known at compile time, but instead is obtained dynamically at runtime?  Consider the following sample code - inside the Example() method, what's the most concise way to invoke GenericMethod<T>() using the Type stored in the myType variable?  public class Sample {     public void Example(string typeName)     {         Type myType = FindType(typeName);          // What goes here to call GenericMethod<T>()?         GenericMethod<myType>(); // This doesn't work          // What changes to call StaticMethod<T>()?         Sample.StaticMethod<myType>(); // This also doesn't work     }      public void GenericMethod<T>()     {         // ...     }      public static void StaticMethod<T>()     {         //...     } }


Just wanted to ask if I accidentally transferred my Pokemon to Willow, Will I receive candy if I don't have that kind of Pokemon in my collection?

If I get rid of the last Pokemon I have from a family do I still keep the candies from that family when I catch another one of the same family?


S.E friends,  I am a college sophomore with a major in mathematics.  I am trying to self-study multivariable and vector calculus (they means the same, right?) and prepare for Summer course on multivariable calculus.  Our university uses a course packet for the multivariable calculus which is not theoretical enough to satisfy my curiosity.  I am seeking a textbook that covers both theories and applications, with more emphasis on theories.    I have been searching the forum and it seems there are sook good books on multivariable calculus:  Hubbard/Hubbard's Vector Calculus, Linear Algebra, and Differential Forms; Marsden/Tromba's Vector Calculus, Collier's Vector Calculus, and Lang's Multivariable Calculus.  I want to pick only one from them.  Could you help me?

Due to my ignorance, I find that most of the references for mathematical analysis (real analysis or advanced calculus) I have read do not talk much about the "multivariate calculus". After dealing with the single variable calculus theoretically, it usually directly goes to the topic of measure theory.    After reading the wiki article "", I'd like to find the rigorous proof for this test. The first book comes to my mind is Courant's Introduction to Calculus and Analysis which includes the multivariate case in the second volume.   Motivated by this, I'd like to put the question here:     What are the usual references for the   theoretical treatment for   ?


Did the Nazgûl wear their 9 rings?  Wikipedia is singularly unhelpful:     Some passages in the novel suggest that the Nazgûl wore their rings, while others suggest that Sauron actually held them.   (with no references).  Can someone please shed light on which version is more supported by Tolkien's work?

In The Fellowship of the Rings, Frodo sees the true appearance of the Nazgûl:      He was able to see beneath their black wrappings. There were five tall figures: two standing on the lip of the dell, three advancing. In their white faces burned keen and merciless eyes; under their mantles were long grey robes; upon their grey hairs were helms of silver; in their haggard hands were swords of steel. Their eyes fell on him and pierced him, as they rushed towards him.   The Fellowship of the Ring - J.R.R. Tolkien - chapter 11, A Knife In the Dark   There's no mention of the Nazgûl wearing the rings of power that Sauron gave them, although their hands are referenced. Did the Nazgûl retain their rings of power once they became wraiths? Or did something else happen to the rings once the Nazgûl emerged?¹  ¹ As an FYI, I am currently re-reading The Lord of the Rings trilogy and am just pages from being done with The Fellowship of the Ring. I'm very familiar with the Peter Jackson movies. So that's where I'm coming from as far as canon knowledge goes.


Note: I was brought here by the 'wonderful' community of Philosophy.  I realise the title    'By Changing My Option, How Does This Double My Chance of Winning?'    was a little vague so let me go into detail.  Problem:  I'm on a gameshow. The gameshow host presents me with three doors. Door A, B and C. Behind two of the doors are angry goats and behind one of the doors is a new car. I choose door A. The gameshow host eliminates door C. Behind it is an angry goat. I am left with two doors: One has a new car and the other has an angry goat.  Question:  By changing my option to door B instead of A, how does my chance of winning increase by 50%?  Take note that I'm just wondering why this is. Thanks.

I was watching the movie 21 yesterday, and in the first 15 minutes or so the main character is in a classroom, being asked a "trick" question (in the sense that the teacher believes that he'll get the wrong answer) which revolves around theoretical probability.  The question goes a little something like this (I'm paraphrasing, but the numbers are all exact):  You're on a game show, and you're given three doors. Behind one of the doors is a brand new car, behind the other two are donkeys. With each door you have a $1/3$ chance of winning. Which door would you pick?  The character picks A, as the odds are all equally in his favor.  The teacher then opens door C, revealing a donkey to be behind there, and asks him if he would like to change his choice. At this point he also explains that most people change their choices out of fear; paranoia; emotion and such.  The character does change his answer to B, but because (according to the movie), the odds are now in favor of door B with a $1/3$ chance of winning if door A is picked and $2/3$ if door B is picked.  What I don't understand is how removing the final door increases the odds of winning if door B is picked only. Surely the split should be 50/50 now, as removal of the final door tells you nothing about the first two?  I assume that I'm wrong; as I'd really like to think that they wouldn't make a movie that's so mathematically incorrect, but I just can't seem to understand why this is the case.  So, if anyone could tell me whether I'm right; or if not explain why, I would be extremely grateful.


How can I install an apk app outside of Google Play. Like if I downloaded it from another site and I try to open it, it says unable to install and I read that you have to do something to get it to work. What do you have to do?

I downloaded the APK file for an app to my PC.  How can I install it on my phone?


I tried to make a horizontal line inside a matrix by the attached code. However, it did not work the compiling process gives a time out message. It work normally without the \hline command. Any help!  \documentclass[journal,draftcls,onecolumn,12pt,twoside]{IEEEtran} \usepackage{array} \usepackage{blkarray} \begin{document} \begin{equation}  \centering W_b(1)=\begin{blockarray}{cccccc} \begin{block}{(ccccc)c}  a      & b     &     &  &  & \matindex{\leftarrow d=0} \\ \ddots & \ddots&     &  &  & \matindex{\vdots} \\    &     a & b   &  &  & \matindex{\ \ \ \   \leftarrow d=d_b-1} \\   %\hline  c      & d     &     &  &  & \matindex{\leftarrow d=d_b} \\   \ddots &\ddots &     &  &  & \matindex{\vdots} \\    &   c   &  d  &  &  & \matindex{\leftarrow d=D}  \end{block} \end{blockarray}, \label{eq:eq4}  \end{equation}  \end{document}

I tried to make a horizontal line inside a matrix by the attached code. However, it didnot work the compiling process gives a time out message. It work normally without the \hline command. Any help!  \documentclass[journal,draftcls,onecolumn,12pt,twoside]{IEEEtran} \usepackage{array} \usepackage{blkarray} \begin{document} \begin{equation}  \centering W_b(1)=\begin{blockarray}{cccccc} \begin{block}{(ccccc)c}  a      & b     &     &  &  & \matindex{\leftarrow d=0} \\ \ddots & \ddots&     &  &  & \matindex{\vdots} \\    &     a & b   &  &  & \matindex{\ \ \ \   \leftarrow d=d_b-1} \\   %\hline  c      & d     &     &  &  & \matindex{\leftarrow d=d_b} \\   \ddots &\ddots &     &  &  & \matindex{\vdots} \\    &   c   &  d  &  &  & \matindex{\leftarrow d=D}  \end{block} \end{blockarray}, \label{eq:eq4}  \end{equation}  \end{document}


Let $a_0, ... , a_n$ be real numbers satisfying  $$\frac{a_n}{n+1}+\frac{a_{n-1}}{n}+ ... + \frac {a_1}{2}+a_0 = 0.$$ Show that the polynomial $$p(x) = a_nx^n + a_{n-1}x^{n-1} + ... + a_1x + a_0$$  has at least one zero in the interval $(0,1)$.  The solution is that let $$f(x) = \frac{a_n}{n+1}x^n + \frac {a_{n-1}}{n}x^{n-1}+ ...+\frac {a_1}{2}x + a_0$$ ,and then apply the Rolle's theorem.   But, I am wondering how the existence of root of $f(x)$ implies the existence of root of $p(x). $

Knowing that $$ \frac{a_0}{1} + \frac{a_1}{2} + \frac{a_2}{3} +\cdots + \frac{a_n}{n+1} =0$$ Prove that  $$ a_0 + a_1x + a_2x^2 + \cdots + a_nx^n = 0$$ has at least one real solution.  I suspect that it's proven with the intermediate value theorem. But can't find two numbers that satisfy it.


I logged in on two systems, ie, office system and home. If I logged out of any one of the system means it won't get logged out , it asked me that I should log out on all devices.  Then I have to re log in to the system which I require. It is a nice feature to have logout on all devices.  This is happen for different browsers of same system too. This feature might not be seen for Gmail or Facebook or yahoo. and yes, StackOverflow is not a social networking.  I'm not asking for a new feature-request here. since, it's already .   What is the reason for forcing a user to log-out on all devices?  What is the drawback on logging out a single system or browser?

While it's great to have the ability to clear all session cookies for all devices, I'd like the ability to log out on one computer only, and not come home to have to relogin on all of my devices. It can really be a pain.   Is there a technical reason we don't have this, or why don't we?


I have a single hard disk which has both Ubuntu 17.10 and Windows 10. Unfortunately, I have to go through the pain of reinstalling Windows due to some corrupt file system issue or something else that causing its performance to grind to a halt.   However, what I don't want to do is lose Ubuntu and everything that is on it. So, what I would like to do is to use my Windows bootable iso DVD disk and simply do a clean install at that location. Therefore, I on reboot I can hopefully carry on as normal.  Can someone please give me some step by step instructions?

I have Ubuntu on my laptop. Now I want install Windows 7 in a dual-boot. How can I do this? I can't lose my Ubuntu files, and I'm afraid that I might break . Go  for UEFI only!


We have defined continuity as $\forall \epsilon, \exists \delta > 0 s.t. |x-c| < \delta, x \in D \implies |f(x) - f(c)| < \epsilon$  and uniform continuity as $\forall \epsilon, \exists \delta > 0 s.t. |x-y| < \delta, x,y \in D \implies |f(x) - f(y)| < \epsilon$  The only difference I see is that we have $x,y$ in the domain rather than just $x$, but what does that really change? Furthermore, we have a theorem about the continuity on a closed domain implies uniform continuity, why does this work? I understand the proof but I'm just not sure why it works.

$f:X\rightarrow Y $ is continuous iff every open ball in $Y$ has open pre-image. It is between topological spaces.  $f:X\rightarrow Y$ is uniformly continuous if $\forall \epsilon >0,\forall x \in X, |x-y|<\delta \implies |f(x)-f(y)|<\epsilon$.  My question is what is the difference between uniform continuity and continuity of a map.


If I have a known square wave source, known capacitor value and known inductor value, what is the fastest way to figure out what the resistor value has to be to make the circuit overdamped, underdamped, and critically damped?

In an RLC circuit,what criteria could be used to decide whether the system is overdamped or underdamped? Could we compare the maximum energy stored during one cycle to the energy dissipated during one cycle?


I am just a intermediate passout and I want to know which books should I prefer for learning the mathematics of particle physics level like the different representation, operation like Hamiltonian,  Hamiltonian Mechanics, Lagrangian and every concept related to particle physics.  I must tell you that I know little bit physics theorem and almost no mathematics background.

What are the best textbooks to read for the mathematical background you need for modern physics, such as, string theory?  Some subjects off the top of my head that probably need covering:   Differential geometry, Manifolds, etc. Lie groups, Lie algebras and their representation theory. Algebraic topology.


Upgrade to 1607 keeps failing. Any ideas?  0xC1900101 - 0x3000D The installation failed in the FIRST_BOOT phase with an error during MIGRATE_DATA operation.  Help would be appreciated.

Windows 10 downloaded a big update not long ago and went through a lengthy upgrade process. Partway through the system locked up. The little progress spinner stopped spinning and it sat there for hours.  So I powered down, the system appeared to go through a recovery process, and then I checked for updates again. It says that "Your device is up to date", but the current version is 1511, build 10586.633. That version isn't current; version 1607 was released in August.  But whenever I check for updates, it says that the system is up to date.  Windows Update troubleshooter reports no problems.  How do I persuade Windows to install 1607?


Below are my code  java.lang.NullPointerException: Attempt to invoke virtual method 'void  android.widget.Button.setOnClickListener(android.view.View$OnClickListener)' on a null object reference

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


I've been running several 1-slot radio room for a while and I only get dwellers from the wastelands whose SPECIAL stats sums 12  From time to time, one stat peaks to three instead of the usual max 2 points but it is still a 12 SPECIAL dweller  Should I always expect this? Do stats depend on the quality of the room/broadcasters or it will always be the same no matter what I do?  I am not asking about getting legendary or rare dwellers, it's just that if it's always as it's happening on my case. I have for example a +1 SPECIAL pet to newborns, maybe there could be a way of getting better stats for attracted dwellers

Okay, first things first: can you actually get a rare/legendary dweller from the radio room?    First I built a 2-wide radio room with high-charisma dwellers working it and average dwellers were arriving nicely enough, okay. But, if I want rare/legendary dwellers, can I expect them to show up from broadcasting?    If I build a bigger radio room, will that attract rare dwellers? (I don't really see the point in manning a larger room if all it does is tweak the timer... am I wrong?)


All the equations I've seen assume I know the sag, height, force, or the weight of the catenary I want to plot, but I don't. All I know is the total length ($L$) of the wire and the position of the two points it's attached to ($x_1$, $y_1$, $x_2$, $y_2$, respectively).    If I give it values so that $L = sqrt((x_2-x_1)^2 + (y_2-y_1)^2)$, I'd expect to get a straight line, since $L$ is equal to the distance between the two points. If $L$ was larger, however, I'd expect it to sag like a catenary normally does. $L$ will never be less than the distance between the two points.  How can I plot a curve knowing only this? Is it even possible?

I need to find a general way of expressing a catenary, and I couldn't find anything online.  Is it possible to explicitly find an explicit equation of a catenary which goes through $P_1 = (x_1,y_1)$ and $P_2 = (x_2,y_2)$ (assuming $x_1 \neq x_2$) so that the length of the curve between the two points is $l$ (assuming $l> d(P_1,P_2) = \sqrt{(x_1-x_2)^2+(y_1-y_2)^2}$)?


How can algebraically prove $f(x)=x^{3}+x$ is injective. I can get to $a^2+b^2+ab=-1$ but I can't go any further.

The Problem  For my discrete structures course, I need to prove that $f(x)$ is one-to-one and onto, with $f:{\rm I\!R}\rightarrow{\rm I\!R}$ where $f(x)=x^3+x$. Based on the graph, this function is one-to-one and onto, and Wolfram confirms this, but I don't know how to approach the actual proof.  Proving it One-to-One  I understand a function $f(x)$ is one-to-one if for $x_1,x_2\in{\rm I\!R}$, if $f(x_1)=f(x_2)$ implies $x_1=x_2$.  The problem is when I set $f(x_1)=f(x_2)$ this, I eventually get to $$\sqrt[3]{x_1^3+x_1}=\sqrt[3]{x_2^3+x_2}$$ It's at this point I'm stuck, and don't know how to progress any further.  Proving it Onto  So I understand to prove a function is onto, you solve $f(x)$ for $y$, and use the result as input to $f(x)$, and if $f(x)=y$, the function is onto. But I run into a similar problems where $$x^3+x=y$$ I could take a cubic root or rearrange the variables all I want but I can't think of a way to isolate $x$ and get $x=something$


I have a conversation with someone on Facebook that contains some sensitive information that that person could use to harm me. What should I do to delete that conversation from both my inbox and from his inbox?  As far as I know, the delete option in Facebook only works for my inbox. That means that the messages I delete still remain in that person's inbox.  What options do I have?

How can I delete Facebook messages I've sent to other Facebook users from their inbox?  I have had a conversation with my friend but now I want to delete my messages from that conversation. Can I have them deleted from my friend's inbox?


dhruvhadoop1@hadoopmaster:~$ cat /home/hadoopuser/.ssh/id_rsa.pub >> /home/hadoopuser/.ssh/authorized_keys bash: /home/hadoopuser/.ssh/authorized_keys: No such file or directory dhruvhadoop1@hadoopmaster:~$ cat /home/hadoopuser/.ssh/id_rsa.pub >> /home/hadoopuser/ .ssh/authorized_keys bash: /home/hadoopuser/: Is a directory dhruvhadoop1@hadoopmaster:~$ cat /home/hadoopuser/.ssh/id_rsa.pub >> /home/hadoopuser/ .ssh/authorized_keys/ bash: /home/hadoopuser/: Is a directory dhruvhadoop1@hadoopmaster:~$ cat /home/hadoopuser/.ssh/id_rsa.pub >> /home/hadoopuser/.ssh/authorized_keys bash: /home/hadoopuser/.ssh/authorized_keys: No such file or directory dhruvhadoop1@hadoopmaster:~$

$ ssh-keygen -t rsa -P "" Generating public/private rsa key pair. Enter file in which to save the key (/home/dhruvhadoop1/.ssh/id_rsa): cat /home/hadoopuser/.ssh/id_rsa.pub >> /home/hadoopuser/ .ssh/authorized_keys open cat /home/hadoopuser/.ssh/id_rsa.pub >> /home/hadoopuser/ .ssh/authorized_keys failed: No such file or directory. Saving the key failed: cat /home/hadoopuser/.ssh/id_rsa.pub >> /home/hadoopuser/ .ssh/authorized_keys. $ chmod 600 authorized_keys chmod: cannot access ‘authorized_keys’: No such file or directory $ chmod 600 authorized_keys chmod: cannot access ‘authorized_keys’: No such file or directory


I want to getKey by with duplicate values in map, but the result is not correct, an I have this code for example  import java.util.*; import java.util.Map.*;  public class Main {     public static void main(String[] args) {         Map<String, Integer> map = new HashMap<>();         map.put("A", 10);         map.put("B", 20);         map.put("C", 30);         map.put("D", 10);         map.put("E", 11);         map.put("F", 30);          System.out.println("Before Sorting:");         for (Map.Entry<String, Integer> entry : map.entrySet()) {             System.out.println(entry.getKey() + " - " + entry.getValue());         }          List<Integer> list = new ArrayList<>(map.values());         Collections.sort(list);         Collections.reverse(list);          System.out.println("\nAfter Sorting:");         for (Integer entry : list) {             System.out.println(getKeyByValue(map, entry) + " - " + entry);         }     }      public static <String, Integer> String getKeyByValue(         Map<String, Integer> map, Integer value) {         for (Entry<String, Integer> entry : map.entrySet()) {             if (entry.getValue().equals(value)) {                 return entry.getKey();             }         }         return null;     }  }    for now the result of the output is  Before Sorting: A - 10 B - 20 C - 30 D - 10 E - 11 F - 30  After Sorting: C - 30 C - 30 B - 20 E - 11 A - 10 A - 10   and the goal is to sort the values in descending order and then get the keys from the values, but since there are duplicate values, I could not get the keys  After Sorting should be: F - 30 C - 30 B - 20 E - 11 D - 10 A - 10   Any suggestion?

I am relatively new to Java, and often find that I need to sort a Map<Key, Value> on the values.  Since the values are not unique, I find myself converting the keySet into an array, and sorting that array through array sort with a custom comparator that sorts on the value associated with the key.  Is there an easier way?


I accidentally closed the tabs in composer: Composition and Properties, I think it is called.  The question: How can I open them again?

I unfortunately deleted the menu (Qgis 1.8.0) in print composer (settings for labels etc) . Now I am wondering how to display it again? The menu is gone in all my projects and I could not find a solution for this.  Any suggestions? Thank You!!


A disc of radius 0.1 m rolls without sliding on a horizontal surface with a velocity of 6 m/s.It then ascends a smooth continuous track. The height up to which it will ascend is Now I'm very confused because my textbook has two formulas regarding this 1/2 mv^2  & 1/2Iw^2 which one should I equate it with mgh?

In this question, I did energy conservation, with the states being the initial one and the one where it is at the top , and I got $$ .5 I w^2 + .5 mv^2 = mgh$$ However, in  the answer key they have done, $$ .5 mv^2 + .5 Iw^2 = .5 Iw^2 + mgh$$ Now why would the k.e be turned to p.e but not the rolling energy??


So I am trying to create a function that compares two iterators, but I am unsure how to appropriately use the templates. The class  template<typename Key_T, typename Mapped_T> class Map{...}   The free function  bool operator==(const Map::Iterator &iter1, const Map::Iterator &iter2) { return (*(iter1.ref->key) == *(iter2.ref->key)) ? true : false; }   I get this error  error: invalid use of template-name ‘cs540::Map’ without an argument list   Then I tried this   template<typename Key_T, typename Mapped_T> bool operator==(const Map<Key_T,Mapped_T>::Iterator &iter1, const Map<Key_T,Mapped_T>::Iterator &iter2) {...}   and I get this error  error: need ‘typename’ before ‘cs540::Map<Key_T,  Mapped_T>::Iterator’ because ‘cs540::Map<Key_T, Mapped_T>’ is a dependent scope

In templates, where and why do I have to put typename and template on dependent names? What exactly are dependent names anyway?    I have the following code:  template <typename T, typename Tail> // Tail will be a UnionNode too. struct UnionNode : public Tail {     // ...     template<typename U> struct inUnion {         // Q: where to add typename/template here?         typedef Tail::inUnion<U> dummy;      };     template< > struct inUnion<T> {     }; }; template <typename T> // For the last node Tn. struct UnionNode<T, void> {     // ...     template<typename U> struct inUnion {         char fail[ -2 + (sizeof(U)%2) ]; // Cannot be instantiated for any U     };     template< > struct inUnion<T> {     }; };   The problem I have is in the typedef Tail::inUnion<U> dummy line. I'm fairly certain that inUnion is a dependent name, and VC++ is quite right in choking on it. I also know that I should be able to add template somewhere to tell the compiler that inUnion is a template-id. But where exactly? And should it then assume that inUnion is a class template, i.e. inUnion<U> names a type and not a function?


Racism being the classic example, but there are many. ACAB (all cops are bastards) is another. I thought reductionist might work here but it doesn't. "Lazy" is too simplistic. "Collectivist" doesn't work either.

What is the technical term for when people thinks the actions of the few represent the many.  Like when people thinks everyone in a specific group behaves a certain way cause of how a few people in the group behave, including non stereotypical behaviours. I thought it was "generalisation" but I couldn't find any articles using that term.


If you invent a new word, how do you go about getting this recognised as a real word in dictionaries?

is a typical example for , though it is said that long time no see has been accepted by the mainstream English speakers.  Recently, there is a  movement in the , and a few new Chinglish words have been invented to demonstrate the characteristics of the Mainland.  The most outstanding examples (in my opinion) are:   shitizen - a citizen without citizen rights freedamn - the freedom for shitizens (no freedom) democrazy - the democracy for shitizens (no democracy) smilence - the speeches under the freedamn of speech () z-turn - to make effort in vain ( (Pinyin))   Here are my questions. Has there ever been any neologism movement in the history of English? What are the criteria to adopt new words into English?


I am fairly new to LaTeX, so please bear with me! :)  So my problem is the following: I have a LaTeX document with several subsections. I write in German, so I have to use Umlauts. Using them normally without the \"u trick worked fine, but now after line 246 LaTeX fails to compile because of the Umlauts. The first ~240 lines are ok though. I am using inputenc and fontenc. The document itself is in UTF-8, just like the setting for my inputenc.  I really have no idea what could have caused this, why the problem only occurs in a few lines, and why it does not apply to the whole document (and also why LaTeX stops compiling altogether!).  Thanks in advance for your help!

It sounds simple but I have a really heavy issue with the "ö ü ä ß" in Latex. I use a template from my university, i have a mac and i use TeXShop if that matters.  Within there is a packages.tex with the following  (...)  \usepackage[T1]{fontenc}            % Standard package for selecting font encodings \usepackage{lmodern}                    % alternative Computer Modern-fonts for computer screens \usepackage{textcomp}                   % LaTeX support for the Text Companion fonts (...)   Also I have a thesis.tex with  (...) \usepackage[utf8]{inputenc}     % Accept different input encodings \usepackage{ifthen}                     % Conditional commands in LaTeX documents (...)   Now I tried to use  \usepackage[ngerman]{babel}   as well as  \usepackage[applemac]{inputenc}   but unfortunately it doesn't work. The best case was another error "hyphenation flashed" or something.   \documentclass[     fontsize=12pt,     a4paper,     portrait,                                    oneside,                                         openright,                                   final,                                               titlepage,                                       onecolumn,                                       bibliography=totoc,     numbers=noenddot                     ]{scrbook} \usepackage[T1]{fontenc}         \usepackage{lmodern}     \usepackage[utf8]{inputenc}      \usepackage{ifthen}          \begin{document} öä \end{document}   Now I replaced  \usepackage[utf8]{inputenc}        with  \usepackage[applemac]{inputenc}   in the minimal working example above and it worked BUT in the other document it still doesn't work :( There it gives me the error (see picture)


I can replace a string by a string using sed, but how can I replace a string with a number? My code is:  while read x  do echo $x  sed 's/xx/$x/g' xy.in > x1 cat > x1 >> x2.dat done < xyz.dat   I want to replace string xx in xy.in with the number that I read from file xyz.dat. But Instead of the number, I am getting blank spaces in x2.dat.

I tried the following code to replace QQ with ZZ, but it doesn't do what I want:  var1=QQ sed -i 's/$var1/ZZ/g' $file   However, this code does what I want:  sed -i 's/QQ/ZZ/g' $file   How do I use variables in sed?


I am working on an animation where my character is a donut that spins to move like a wheel. I want to make it that the animation makes the donut spin perfectly and it loops perfectly. However when I attempt to make the animation, it always rotates 360 degrees but then at the end of the animation is comes to a slow halt. I don't want this. I want it to be forever traveling at the same speed so the loop is seamless. I am fairly new to this so help would be appreciated thanks.

When I make an animation, it always starts out slow, then speeds up, then slows down at the end.  I cannot figure out how to fix this.


[INCORRECT] I did not attend the rally, which was very unpatriotic of   me.                   The word which has no single, clear antecedent.     Instead, it refers   to the entire clause - "I did not attend the rally."     However, a   pronoun must always refer to a single, clear, unmistakable NOUN   ANTECEDENT.   I excerpt this from . This is kind of what I was taught in school about the proper use of "which." I was told that "which" must be used to refer to only the noun that comes before the comma, like in these sentences:     The science fair, which lasted all day, ended with an awards ceremony.      We drove past my old school, which is celebrating its 100th   anniversary this year.   However, these are example sentences in :     The movie turned out to be a blockbuster hit, which came as a surprise   to critics.      My friend eventually decided to get divorced, which upset me a lot.   But the, Purdue OWL also came up with this example:     INCORRECT: Vacation is coming soon, which is nice. (What is nice, the   vacation or the fact that it is coming soon?)   Cambridge Dictionary suggests that "which" can refer to the whole sentence before it:     She had to get up and walk all the way to the other side of the room,   which isn’t easy with a bad back. (which refers to the whole sentence   before it)   Now, also according to Cambridge Dictionary, using a relative clause to refer to a whole clause or a whole sentence is only often used in informal speaking:     Some relative clauses refer to a whole clause, a whole sentence, or a   longer stretch of language. We always use which to introduce these   clauses.      We often use these clauses in informal speaking to express an opinion   or evaluation (In the examples, the relative clause is in bold, and   the clause or person that is referred to is underlined.):      I think the other thing that was really good about it as well was that   everybody worked really hard and helped tidy up at the end, which I   hadn’t expected at all.   So what is the consensus here?

In this sentence      Green tea contains the vitamins and healthy properties of the green tea leaf, which makes green tea popular among health-conscious people.    what is the "which" referring to?? Is it referring to the green tea leaf or the vitamins and healthy properties?


Is it possible for a set to equal another set, yet the former set be an element in the latter set?  I.e.:  $\mathcal{X} = \mathcal{Y}$, yet $\mathcal{X} \in \mathcal{Y}$

When I study Topology, I met with a problem. On my book, it says 'we cannot admit that there exists a set whose members are all the topological spaces. That will lead to a logical contradiction, that there will be a set who is a member of itself.' But why we cannot have a set who is a member of itself?


Prove that if $f'(x)≠0$ on an interval $( a , b)$ on $A$ for a differentiable function $f$, then $f$ is one-to-one on $A$.  I was wondering whether the proof in the attached picture is correct. Could anyone please help me?

This is an exercise from Abbott's second edition of Understanding Analysis.     Let $f$ be differentiable on an interval $A$. Show that if $f'(x) \neq 0$ on $A$, show that $f$ is one-to-one on $A$. Provide an example to show that the converse statement need not be true.   Is my solution (below) correct?   Let $x_{1},x_{2} \in A $ such that $x_1 \neq x_2$. Since the function satisfies all the conditions of the mean value theorem, there exists $c \in (x_1,x_2)$ [without loss of generality we consider $x_1 < x_2$] such that $f(x_2) - f(x_1) = (x_2 -x_1) f'(c) \neq 0$ as it is given that $f'(x)$ is nonzero on $A$ and $x_1 \neq x_2$ is our assumption. Therefore $x_1 \neq x_2$ implies $f(x_1) \neq  f(x_2)$ for every $x_1,x_2 \in A$. Thus $f$ is one-to one on $A$.  The converse may not be true. Consider $A=[-1,1)$ and $f(x)= x^3$. Therefore $f$ is injective on $A$. Again $f'(x)= 2x^2$. Therefore $f'(0)=0, 0 \in A$. So the converse need not be true.


This is a story I would have read in the '90s, I think. The beginning involves a bunch of aliens landing on Earth back in the Knights on Horseback era. They wave their ray guns around, intending to cow the lowly natives, but the lowly natives are a bunch of knights on horseback, who promptly ride up the ramp, skewer the aliens, and take over the ship. I don't remember much of the plot after than, except they go on as you would expect and conquer right and left.

I'm searching for a science-fiction book set in the quite an old time: around the 15th-16th century. Features aliens arriving in a spaceship to an old country: likely a western country from what I remember.  Here are the details that I can remember:   Read the book during 2005-2008. Definitely not published during that time based on the writing style: I will hazard a guess at around 1960-1980 publication.  Story begins where there's some sort of military rally and an alien spaceship lands in this old country. The aliens attempt to kill the people there but are overpowered and killed. I believe 1-2 aliens were kept as prisoners. People board (capture) the ship and use it to travel to the alien's base seemingly reach there. They talk to the aliens and have a treaty whereby the aliens also have to serve in the (people's) country's military force to win a war.  Not long after one of the alien's bases are bombed and the spaceship is destroyed, leaving the people trapped on the alien's country.    I'm pretty sure the ending is where a few years later, the people trapped on that planet manage to get back home.   One interesting part to note: when the people captured the spaceship they named it. I can't remember the name but it likely has an '-ade' at the back. Something like 'Invade' along the line.   I just remembered reading the book recently after reading 'War of the Worlds' - another alien scifi book; any help is appreciated!


This isn't my original problem, but I'm posting a simplified version and then I'll try to see if I can apply it myself to my original problem. (yay for self-learning)  Suppose I have a sample and I want to test if the data has been drawn from a normal distribution, but $\mu$ and $\sigma$ are unknown. How am I supposed to compute the expected number of counts in each bin if I don't know these parameters? [and also, which bins should I use, since $\mu$ can stretch anywhere from $-\infty$ to $\infty$] I was thinking maybe we could use the MLE, but that seems bad because I think it will lead to an artificially low test statistic [because of something along the lines of "MLE is computed from your data so the fit would be artificially better"].

From , there are three interpretations of the degrees of freedom of a statistic:     In statistics, the number of degrees of freedom is the number of   values in the final calculation of a statistic that are free to vary.      Estimates of statistical parameters can be based upon different   amounts of information or data. The number of independent pieces of   information that go into the estimate of a parameter is called the   degrees of freedom (df). In general, the degrees of freedom of an   estimate of a parameter is equal to the number of independent scores   that go into the estimate minus the number of parameters used as   intermediate steps in the estimation of the parameter itself (which,   in sample variance, is one, since the sample mean is the only   intermediate step).      Mathematically, degrees of freedom is the dimension of the domain of a   random vector, or essentially the number of 'free' components: how   many components need to be known before the vector is fully   determined.   The bold words are what I don't quite understand. If possible, some mathematical formulations will help clarify the concept.  Also do the three interpretations agree with each other?


In the Data Explorer, how do I find the questions I have asked, which are answered but not accepted by me?  In search, I could do something like:  hasaccepted:0 user:id answers:1   I am looking for a similar Data Explorer query.

I mean to get back them, really I do. So, how can I view all my unaccepted questions across the Stack Exchange network?  , but the stackexchange.com search doesn't work the same way (it searches for the text). Is there any way to do this?


I am redesigning the core navigation of a brand site.  We are now including a "Community" section. This will be hosted in a subdomain like "community.brandname.com".  It's an important section and needs to remain prominent. Does it makes sense to add this link to the first level nav in our header or in the meta navigation - smaller nav elements just above?  Any best practices on that?  Thanks!!

I'm creating a website for web creator, designer and video editor. I'm a multimedia integrator, so I'm doing almost everything related to media on the web or video. Whatever, on my portfolio I would like to add a photography section for my personal photos to show people that I love more than only web/video. Also, I draw a wireframe of what my photography page could look like and it will be really different from my original portfolio website I'm creating.  For example, my portfolio website has the nav menu on top, but the photography website will have the menu fixed on the left with a filter (to choose which picture you want to look at). Do you think I should put this photography section as "mywebsite.com/photogrpahy" or "photography.mywebsite.com"? I heard that sometimes SEO is weird with subdomain.  Also, thinking about adding two blogs in the futur. One for my work and one other for my travel and other personal stuffs. So I thought about :  mywebsite.com/blog ---> Work  blog.mywebsite.com ---> Travel/activities/etc.  What do you think about this?  Thank you