Does there exist a function $f: \mathbb{R} \to \mathbb{R}$ such that for all non-empty, open, and uncountable subset $E \subseteq \mathbb{R}$, $f(E) = \mathbb{R}$?  I have been thinking about it for a bit, but really can't think of any way to prove or disprove it. I have a hunch that if a set $E \subseteq \mathbb{R}$ is open and uncountable, then there should be a bijection to $\mathbb{R}$. This may not be true, however. I'm not well versed in the more advanced concepts of cardinality, so I'm unsure if there is an uncountable set $E \subsetneq \mathbb{R}$ such that there is no bijection from $E$ to $\mathbb R$.  I'm having great difficulty imagining a function with this property. I understand that proving existence doesn't imply that construction of such a function is feasible, but I want to understand if such a function even exists.  Any help would be greatly appreciated.

I wonder  whether there is a function $f\colon\Bbb R\to\Bbb R$ with the folowing characteristic?   for every two real numbers $\alpha,\beta,\alpha\lt\beta$,  $$\{f(x):x\in(\alpha,\beta)\}=\Bbb R$$   I can't  say such a function does not exist, neither can I construct a example  Thanks a lot!


We cannot include $\infty$ into $\mathbb R$ if we define $0\infty =1$. However, we don't have to do so. We just define another element $1/\infty\neq 0$ to be the reciprocal of $\infty$. In that way, can we get a consistent system of numbers?   Please read the following carefully, because this is NOT the usual way we treat $\infty$. I know perfectly why we cannot define $0\infty =1$ with ordinary rules for addition and multiplication. I am NOT doing that. Please do not downvote without reading this carefully.  To be more specific, we can do arithmetic operations with this extended set of real numbers and $\infty$ and $1/\infty$. For example, $(3\times \infty)^{-1} =\frac13 1/\infty$  Is there a branch of math about this?

I know some properties cannot be defined with the real number system such as supremum of an unbounded set. but I want to know the philosophy behind this construction (extended real number system ($\mathbb R \cup\{+\infty,-\infty\} $) and projectively extended real number system ($\mathbb R \cup\{\infty\}$)) and why did mathematician want to do so? what are the beautiful properties they achieved? I want an answer with a philosophical point of view.   P.S. is there any books or notes or something which I can refer?


I have been trying to install the ubuntu developer environment so that I may begin gaining practice in app development. But once I try to install ubuntu-sdk I get the following error:  The following packages have unmet dependencies: ubuntu-sdk : Depends: ubuntu-html5-container but it is not going to be installed   for which I then proceed to insert the command:  sudo apt-get install ubuntu-html5-container   in which I then receive the following error message:  The following packages have unmet dependencies: ubuntu-html5-container : Depends: qtdeclarative5-ubuntu-ui-extras-browser-plugin but it is not installable   at which point I would feel logical to insert the command:  sudo apt-get install qtdeclarative5-ubuntu-ui-extras-browser-plugin   and my new error message is:  Package qtdeclarative5-ubuntu-ui-extras-browser-plugin is not available, but is referred to by another package.   This may mean that the package is missing, has been obsoleted, or is only available from another source  I have no idea what I'm doing wrong and I have updated my repository libraries several times and still nothing. Could someone please tell me what it is that I'm doing wrong? Why isn't this working like it should?

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


I know there are thousands of this type of question on S.O but i haven't found an appropraite solution that suits my problem.  I have a simple text file create creator that saves file using the default extension .tj. I did this using      DialogResult DR = openFile.ShowDialog();     if (DR == DialogResult.OK)     {          StreamWriter writeFile = new StreamWriter(new FileStream(openFile.FileName,FileMode.CreateNew,FileAccess.Write));          writeFile.WriteLine(rtbText.Text);          writeFile.Flush();          writeFile.Close();     }   This works perfectly but what i want is that whenever my Application is installed and a file with the default extension is saved, Whenever the file is Double Clicked, the file opens in my Application and the Rich Text Box shows the text in the file.  Any help will be appreciated

I'd like to to associate a file extension to the current executable in C#. This way when the user clicks on the file afterwards in explorer, it'll run my executable with the given file as the first argument. Ideally it'd also set the icon for the given file extensions to the icon for my executable. Thanks all.


I am having a little issue with my code. I am trying to find the runtime to compare to some math that I have prepared for the problem. I have one method in particular that I am testing that goes like this:   public static int foo(int n, int k){         long startTime = System.nanoTime();         if(n<=k){             long endTime = System.nanoTime();             System.out.println("checkFoo");             System.out.println("start time: " +startTime);             System.out.println("end time: " +endTime);             return 1;         }         else{             return foo(n/k,k) + 1;         }     }   I test this code in my main method in the following way:   public static void main(String[] args){     foo(1, 1);     foo(5, 1);      foo(10, 1);     foo(100, 1); }   I get an error where it says   Exception in thread "main" java.lang.StackOverflowError   and then it repeats the line:  at Problem3.foo(Problem3.java:42)    I am wondering if this has to do with the fact that foo is supposed to return an int and maybe I am just not calling the function correctly. If that is the case, what is considered the correct way to call this function so that it also prints out the information that I need it to? Or is this error completely different than how I am understanding it to be?

What is a StackOverflowError, what causes it, and how should I deal with them?


I'm making a minigame map in Minecraft and I cant figure out how can I test if all players from a particular team are in a particular area using Command Blocks (with a radius of 8 blocks, if all players are present the Command Block should give a Redstone output). Can someone help me by providing the correct Minecraft command?

This has got me. I need a command that tells me if all players on a server are in a radius of a command block. If one of them isn't in the radius, the command will be false. Any ideas? Thanks!


I'm making pumpkin custard and it calls for 1 can evaporated milk AND 3/4 c.sugar. I have a can of condensed milk. Can I used the condensed milk instead? Add a little milk or water?

(Not a duplicate of , I don't believe)  If I have a recipe that calls for sweetened condensed milk but only have a can of evaporated milk, is there anything I can do to it to the evaporated milk to make it a suitable replacement for sweetened condensed milk?  Does the heating / sterilizing of evaporated milk ruin it as a replacement?


I can prove that given a function $f:X \rightarrow Y$, where $X,Y$ are metric spaces, the set $A \subseteq X$ of points on which $f$ is continuous, is $G_{\delta}$.   (Take $U_n = \bigcup_{y \in Im(f)} f^{-1}(B_{\frac{1}{n}}(y))$ and $V= \bigcap_{n \in \mathbb{N}}U_n$, and $V$ is $G_\delta$).  My question is: Is the converse direction true? Is it true that, given a $G_\delta$ set $A \subseteq X$, there exists a metric space $Y$, and a function $f:X \rightarrow Y$, such that, the set of points on which $f$ is continuous is $A$?  Thank you! Shir

I have a question about subsets $$ A \subseteq \mathbb R $$ for which there exists a function $$f : \mathbb R \to \mathbb R$$ such that the set of continuity points of $f$ is $A$. Can I characterize this kind of sets? In a topological,measurable or in some way? For example, does there exist a function continuous on $\mathbb Q$ and discontinuous on the irrationals?


I can't seem to input the syntax for an umlaut.  Here is what I write  \documentclass[12pt]{article}  \setlength\parindent{0pt}  \usepackage{amsmath} \numberwithin{equation}{section} \usepackage{color} \usepackage{amssymb} \usepackage[margin=2.0cm]{geometry} \usepackage{graphicx} \usepackage{float} \usepackage{array} \usepackage{url} \usepackage{braket} \usepackage{hyperref} \usepackage{tensor} \usepackage{titlesec}  \usepackage{amsthm}  \begin{document} {\''o} \end{document}   Now when I copy and paste {\''o} from the internet it works fine and I get the first thing, but if I type it in manually then I get the second. Texworks automatically changes my ' to a \rq{}, so I have to do ctrl+shift+' or alt+' to get the character -- I think that this will have something to do with it but I don't know what.

Now, my version of TeXworks is 0.4.5r.1280 and I can't have the " character on the keyboard.    I have ``  or '' instead. Why?  And It's the same with Alt+034. I'm very disappointed with that.


I believe there is a term for your first and last name beginning with the same sound/letter, but I don't know what it is. Example: Bobby Brown; Cindy Cinnamon; Graham Gusto.

Is there a term for the kind of wordplay in which homophones are repeated adjacently with different meaning? For example,  The rose rose up. Rose rows in church.


Does a magnetic field moving relative to a stationary charge act on it?

I heard that a magnetic field only creates a force on a moving charge, not a stationary one. However, what if the solenoid containing the magnetic field was moving through a stationary charge. Would that create a similar force? Thanks!


I want to study quantum mechanics. But I don't know what and which topics  of mathematics are required.  I know a bit of differential calculus. But what else is needed to study a bit advanced quantum mechanics (not qft)? Please name a few books also if possible.

Every once in a while, we get a question asking for a book or other educational reference on a particular topic at a particular level. This is a meta-question that collects all those links together. If you're looking for book recommendations, this is probably the place to start.  All the questions linked below, as well as others which deal with more specialized books, can be found under the tag  (formerly ).  If you have a question to add, please edit it in. However, make sure of a few things first:   The question should be tagged  It should be of the form "What are good books to learn/study [subject] at [level]?" It shouldn't duplicate a topic and level that's already on the list   Related Meta:


I am converting the English date into the Welsh date using a Java program but the if statements do not appear to run as the date does not change. What am I doing wrong?  I am new to Java and I have learnt Python and am now teaching myself Java. This English-to-Welsh date converter was a task I set myself in Python and I have now set it for Java.  Code:  import java.util.Scanner;  public class Main {     public static void main(String args[]){         System.out.println("What is the Date?:");         Scanner date = new Scanner (System.in);         String Date = date.next();         date.nextLine();         System.out.println("What Day is it?:");         Scanner day = new Scanner (System.in);         String Day = day.next();         day.nextLine();         System.out.println("What Month is it?:");         Scanner month = new Scanner (System.in);         String Month = month.next();         month.nextLine();         if (Day == "Monday"){             Day = "Dydd Llun";         }         if (Day == "Tuesday"){             Day = "Dydd Mawrth";         }         if (Day == "Wednesday"){             Day = "Dydd Mercher";         }         if (Day == "Thursday"){             Day = "Dydd Iau";         }         if (Day == "Friday"){             Day = "Dydd Gwener";         }         if (Day == "Saturday"){             Day = "Dydd Sadwrn";         }         if (Day == "Sunday"){             Day = "Dydd Sul";         }         if (Month == "January"){             Month = "Ionawr";         }         if (Month == "Febuary"){             Month = "Chwefror";         }         if (Month == "March"){             Month = "Mawrth";         }          if (Month == "April"){             Month = "Ebrill";         }         if (Month == "May"){             Month = "Mai";         }         if (Month == "June"){             Month = "Mehefin";         }         if (Month == "Jully"){             Month = "Gorffennaf";         }         if (Month == "August"){             Month = "Awst";         }         if (Month == "September"){             Month = "Medi";         }         if (Month == "October"){             Month = "Hydref";         }         if (Month == "November"){             Month = "Tachwedd";         }         if (Month == "December"){             Month = "Rhagfyr";         }         System.out.println(Date + " " + Day + " " + Month);     } }

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


What about "youth"? As in:  "The youth of today is highly interconnected in many ways."  vs. "The youth of today are highly interconnected in many ways."

I'd say Microsoft have a way of bending the rules and I know that McLaren have won the championship. While this sounds strange, I believe it is correct English (sorry, I'm not native).   But when it's a small company, would you still use it this way? Is a company always plural, or are small companies singular? I.e., would you say Bakery Johnson makes fine bread or Bakery Johnson make fine bread? Is it My book seller, Woody's, have moved or is it has moved?


I want to be sure if the object I get is a List of Strings. Here's my code:  Object obj = plugin.getConfig().get("groups"); if(obj instanceof List<?>){ // Is the Object a List ?     List<?> list = (List<?>) obj;     if(list.get(0) instanceof String){ // Does the List contain Strings ?         List<String> groupList = (List<String>) list;     } }   But Eclipse says that the last cast on line 5 isn't safe:     Type safety: Unchecked cast from List<capture#3-of ?> to List<String>    How can I fix that? I've also tried  List<String> groupList = (List<String>) obj;   ...but I still get the same error (basically).

Eclipse is giving me a warning of the following form:     Type safety: Unchecked cast from Object to HashMap   This is from a call to an API that I have no control over which returns Object:  HashMap<String, String> getItems(javax.servlet.http.HttpSession session) {   HashMap<String, String> theHash = (HashMap<String, String>)session.getAttribute("attributeKey");   return theHash; }   I'd like to avoid Eclipse warnings, if possible, since theoretically they indicate at least a potential code problem.  I haven't found a good way to eliminate this one yet, though.  I can extract the single line involved out to a method by itself and add @SuppressWarnings("unchecked") to that method, thus limiting the impact of having a block of code where I ignore warnings.  Any better options?  I don't want to turn these warnings off in Eclipse.  Before I came to the code, it was simpler, but still provoked warnings:  HashMap getItems(javax.servlet.http.HttpSession session) {   HashMap theHash = (HashMap)session.getAttribute("attributeKey");   return theHash; }   Problem was elsewhere when you tried to use the hash you'd get warnings:  HashMap items = getItems(session); items.put("this", "that");  Type safety: The method put(Object, Object) belongs to the raw type HashMap.  References to generic type HashMap<K,V> should be parameterized.


In structure, memory space will be created for all members inside structure. In union memory space will be created only for a member which needs largest memory space. Consider the following code:  struct s_tag {    int a;    long int b; } x;  struct s_tag {    int a;    long int b; } x;  union u_tag {    int a;    long int b; } y;  union u_tag {    int a;    long int b; } y;   Here there are two members inside struct and union: int and long int. Memory space for int is: 4 byte and Memory space for long int is: 8   So for struct 4+8=12 bytes will be created while 8 bytes will be created for union. I run the following code to see a proof: C  #include<stdio.h> struct s_tag {   int a;   long int b; } x; union u_tag {      int a;      long int b; } y; int main() {     printf("Memory allocation for structure = %d", sizeof(x));     printf("\nMemory allocation for union = %d", sizeof(y));     return 0; }   But I can see the following output:  Memory allocation for structure = 16 Memory allocation for union = 8   Why memory allocation for struct is 16 instead of 12? Is there any wrong in my understanding?

Why does the sizeof operator return a size larger for a structure than the total sizes of the structure's members?


I have a docker build script which builds a series of libraries and runs test suits. In order to make my build script run faster on a many core server, I changed put the sequential order of commands (being passed to RUN to a bash invocation of several parallel commands:  RUN /bin/bash -c -e '\     cmd1 arg1 & \     cmd2 & \     cmd3 arg1 arg2=foo arg3 & \     wait'   This worked file when there was no error. Then I realized even if one of child processes return a non-zero exit status, the whole bash command returns 0 and docker continues to build... How can I make the bash call to return 0 iff all its children return 0 ?

How to wait in a bash script for several subprocesses spawned from that script to finish and return exit code !=0 when any of the subprocesses ends with code !=0 ?  Simple script:  #!/bin/bash for i in `seq 0 9`; do   doCalculations $i & done wait   The above script will wait for all 10 spawned subprocesses, but it will always give exit status 0 (see help wait). How can I modify this script so it will discover exit statuses of spawned subprocesses and return exit code 1 when any of subprocesses ends with code !=0?  Is there any better solution for that than collecting PIDs of the subprocesses, wait for them in order and sum exit statuses?


Whenever I try to install codeblocks I get this error:  The following packages have unmet dependencies:   codeblocks : Depends: codeblocks-common (= 12.11-3) but it is not going to be installed

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


Find the derived group of $GL(n,\mathbb{R})$   I believe that the derived group is $SL(n,\mathbb{R})$, as it is easy to see that $GL(n,\mathbb{R})' \subset SL(n,\mathbb{R})$, since for any $A,B \in GL(n,\mathbb{R})$,  we get that $det(ABA^{-1}B^{-1})=1$, and therefore $ABA^{-1}B^{-1} \in SL(n, \mathbb{R})$.  However, I'm not sure how to prove that other side - $ SL(n,\mathbb{R}) \subset  GL(n,\mathbb{R})'$?

Try to prove the following proposition.     $SL_n(\mathbb R)$ is a subgroup of kernel of $f\in$ Hom($GL_n(\mathbb R), A)$, where $A$ is an abelian group.   My first attempt is to show that $SL_n(\mathbb R)$ is in form of $ABA^{-1}B^{-1}$, then it's clear that $ABA^{-1}B^{-1}$ is in $ker(f)$. However, there exists an elementary row reduction matrix, i.e. $E_{ij}(m)$ adding m times $j$-th row to $i$-th row. Then $E_{ij}(m)\in SL_n(\mathbb R)$. Now, it is possible that $E_{ij}(m)$ is not in $ker(f)$. Then I try to find any relation between $\mathbb R^{\times}$ and $A$, but, except knowing they are both abelian groups, I cannot figure out what else connects those two group. Could you give me some hints?


I want to write a little system of two equations with a left bracket over the two lines. Moreover I want to label each of these equations in order to refer to them.  I wrote this :    The system of the two equations \eqref{eq1} and \eqref{eq2} :    \begin{align}     \left\{     \label{eq1}     x+2y=8\\     \label{eq2}     x-y=3     \right.   \end{align}   However the compilation is failing. But this is working if I remove the \left\{ and \right. parts.

As much as I have tried, it doesn't seem possible to use separate labels when using a casesconstruction (from the amsmath package).  Ideally, I would like to be able to write something like  \documentclass{article} \usepackage{amsmath} \begin{document} \begin{equation} f(x)=\begin{cases}   1&x\geq0\label{positive}\\   0&x<0\label{negative} \end{cases} \end{equation} \end{document}   and later refer to both cases at different places. What would be the best way to achieve this result?


Is there a measurable subset E ⊆ R such that whenever a < b are real numbers we have both $m(E ∩ (a, b)) > 0$ and $m((a, b) -E) > 0$ ?  This is an extra question on my real analysis class, but it is not graded, just for fun.   I was thinking about the "fat Cantor set"(), and play with it a little bit, but somehow I can still find "gaps" between real numbers. Can anyone give me some hint so I can carry on ?  Thanks !!!

I was wondering how one can construct a Borel set that doesn't have full measure on any interval of the real line but does have positive measure everywhere.   To be precise, if $\mu$ denotes Lebesgue measure, how would one construct a Borel set $A \subset \mathbb{R}$ such that $$0 < \mu(A \cap I) < \mu(I)$$ for every interval $I$ in $\mathbb{R}$?   Moreover, would such a set necessarily have to contain infinite measure?


I'm currently running large processes, and I'm afraid the limit of my API calls is not enough to handle that. I want to retrieve my current number of API calls (and my maximum API calls), to verify that I never exceed my maximum - 5000 (margin of safety).  How to recover these 2 numbers?

Is there an API method to return how much API calls were used and how much total calls is allowed by my SF org?


The question is: "Maria flip a coin for $6$ times while Davide for $7$ times. What is the probability that Davide obtains more heads than Maria?"  I solved this problem analysing $7$ cases:  $1)$ Maria doesn't obtain  a head, therefore Davide has to obtain at least a head. The probability is: $$P=\frac{2^7-1}{2^7}$$ $2)$ Maria obtains a head, therefore Davide has obtain at least two heads. The probability is: $$P=\frac {2^7-(1+7)}{2^7}$$ (indeed there are $7$ possible dispositions with a only head for example a possible disposition is $TTHTTTT$)  $3)$ Maria obtains two heads, therefore Davide has to obtain at least three heads. The probability is: $$P=\frac {2^7-(1+7+21)}{2^7}$$ (indeed there are $21$ possible dispsitions with two heads and five tails, e.g. $TTTTTHH$  $4)$ Maria obtains three heads, therefore Davide has to obtain at least $4$ heads. The probability is: $$P=\frac {2^7-(1+7+21+35)}{2^7}$$ (in this case there are $35$ possible dispsositions with $3$ heads and $4$ tails).  $5)$Maria obtains $4$ heads, Davide has to obtains at least $5$ heads. The probability is: $$P=\frac {2^7-(1+7+21+35+35)}{2^7}$$  $6)$ maria obtains $5$ heads, Davide has to obtain at least $6$ heads. The probability is: $$P=\frac {2^7-(1+7+21+35+35+21)}{2^7}$$  $7)$ Maria obtains $6$ heads, Davide has to obtain $7$ heads and the probability is: $$P=\frac {2^7-(1+7+21+3535+21+7)}{2^7}=\frac {1}{2^7}$$ (indeed there is an only case:$HHHHHHH$)  Is there a simplest method ?

Your friend flips a coin 7 times and you flip a coin 8 times; the person who got the most tails wins. If you get an equal amount, your friend wins.  There is a 50% chance of you winning the game and a 50% chance of your friend winning.  How can I prove this? The way I see it, you get one more flip than your friend so you have a 50% chance of winning if there is a 50% chance of getting a tails.  I even wrote a little script to confirm this suspicion:  from random import choice  coin = ['H', 'T']  def flipCoin(count, side):     num = 0     for i in range(0, count):         if choice(coin) == side:             num += 1     return num   games = 0 wins = 0 plays = 88888  for i in range(0, plays):     you = flipCoin(8, 'T')     friend = flipCoin(7, 'T')     games += 1     if you > friend:         wins += 1  print('Games: ' + str(games) + ' Wins: ' + str(wins)) probability = wins/games * 100.0 print('Probability: ' + str(probability) + ' from ' + str(plays) + ' games.')   and as expected,  Games: 88888 Wins: 44603 Probability: 50.17887678876789 from 88888 games.   But how can I prove this?


Question: Some physicists believe that it is possible to have . My questions is would this negative mass create a negative gravity field, exerting a negative force on positive masses? And if so, would the negative gravity field cause an opposite effect on time, possibly slowing it down?  My attempt: I feel like it would exert a negative force because of the Universal Law of Gravitation. So we have a negative force exerted from a negative mass ($m_1$) on a positive mass ($m_2$):  $$ F_{+mass} = G \frac{(-m_1) m_2}{r^2} \vec{r} $$  This would mean that the gravity vector field is now pointed away (I think) from the center of gravity rather than towards it, aka negative gravity.  Now I am not familiar enough with the time dilation equations to take a shot at that but any search I have done comes up empty on that matter. But intuitively, it seems to me that time dilation would also work backwards.

Time tends to slow down near objects with large amounts of positive mass relative to observers in micro gravity.  Considering that negative mass is the opposite of normal mass and would time tend to speed up near a body of negative mass relative to observers in micro gravity?


I have a function that dynamically adds an input and dropdown box when a '+' sign is clicked. However, when the dropdown is changed, the alert returns undefined. Why does it?  jQuery(document).change(".marker-drop-down", function() {            alert(jQuery(this).attr("id"));      });  //functions function addInputBox() {         jQuery("#insert-question-inbox").append('

 <input class="question-input" type="text" id=question-'+i+' value=question-'+i+' /> <select id="question-'+i+'-drop-down" class="maker-drop-down"> <option>Select</option><option value="multiple-choice">Multiple Choice</option> <option value="select-all">Select all that apply</option></select>

');     i += 1;      }

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


On the older versions I was able to switch from one of 4 screens in the work space. Is this not available in the new 14.04 version?

It appears that Unity on Raring only comes with a single virtual desktop (aka workspaces) by default, and CCSM's Wall plugin has no way to add more. Is this configurable at all?


I want to install unicode-math to use with XeLaTeX. I use ubuntu 12.04 LTS (because of some incompatibilities of later kernel versions with my HW).  Is there a way to install unicode-math package? I tried to install it through apt-get install texlive-math-extra, but it doesn't seem to be in that package.

I want to install a package (specifically xlop). I'm using TeXLive on Ubuntu, and I don't really know my way around LaTeX.  Can apt-get install or something similar be used?


The requirement is to publish a platform event in one salesforce org and subscribe to it in another salesforce org. In simple words, I need to publish a platform event from a salesforce app/org for an external app which is another salesforce app/org. I am not aware with APIs and stuff. I have already done Trailhead on Platform Event Basics. How do I connect or create channel between two different salesforce orgs so that platform event is flown between them. Thanks in Advance..!

Does anyone have experience using Platform Events between separate orgs? I'm having trouble finding documentation or mention that something like this is possible. Basically I'd like to define a set of events that partnered companies can subscribe to so they can track our fulfillment process. Typically someone might set up web services or Connections as an integration solution, but I don't like how Connections couples our schema together. Web Services would require developer expertise than I'd like to compel them to pay for. A set of domain specific events is much more re-usable and less likely to change, than an object definition. In our use case of multiple integrated partners it would allow a given org to make changes without requiring a Connection change for every other org Connected to that object.  If it's not possible using more conventional Salesforce tooling, I know I could use a separate middleman pub/sub solution with Platform events, but I'd like to minimize moving parts.   Any info someone might have on the subject would be greatly appreciated!


I try upgrade from 18.04 to 20.04 and receive the message: "There will not be any further Ubuntu releases for this system 'i386' architecture.". Can I upgrade? What can I do?

I want to know if it is possible to update to Xubuntu 20.04 since I can't find a 32-bit version. If I update through the terminal with sudo apt update && sudo apt -y dist-upgrade  will the system break? Thank you!


I have a document class that isn't as thoroughly documented as I might like, and I'd like to figure out what font it uses. Is there an easy, universal way to get TeX to tell you directly what font is being defined by the class file? Preferably in a way that will show me how I can define the font in my own file, in TeX code? I have read this question that asks how to . This doesn't tell me what the font is called in TeX, and is very round-about. Preferably, I'd like to know the name of the font package that I want to use.

Is it possible to identify the font used in a specific document/picture?  Answers to this question should identify:   Possible methods to do this (perhaps one answer per method) and adequately describe how to use it (as opposed to merely stating it); Ways of finding the identified fonts, if possible (free or not); and Any prerequisites associated with the method used, if required (for example, "In order to use method X, your document has to be in format Y").   This question is meant as an FAQ, based on an . Its aim is to facilitate the community with the general procedures involved in font identification. Similar cases are solved on a per-usage basis on 's  tag.


I am trying to debug network errors on a container running in kubernetes. I don't have root or sudo, so I am trying to use the ss command. netstat would be better but I can't install it. I am trying to find the equivalent of : [john@localhost ~]$ netstat -s Ip:     Forwarding: 1     6286139 total packets received     53196 forwarded     0 incoming packets discarded     6232895 incoming packets delivered     5238848 requests sent out     880 outgoing packets dropped     1539 dropped because of missing route     40 reassemblies required     20 packets reassembled ok     75 fragments received ok     150 fragments created Icmp:     3169 ICMP messages received     15 input ICMP message failed     ICMP input histogram:         destination unreachable: 3084         echo requests: 85     6881 ICMP messages sent     0 ICMP messages failed     ICMP output histogram:         destination unreachable: 6796         echo replies: 85 IcmpMsg:         InType3: 3084         InType8: 85         OutType0: 85         OutType3: 6796 Tcp:     35870 active connection openings     11 passive connection openings     1278 failed connection attempts     7643 connection resets received     86 connections established     3758844 segments received     3338714 segments sent out     31144 segments retransmitted     92 bad segments received     21169 resets sent Udp:     3344084 packets received     9222 packets to unknown port received     0 packet receive errors     2435535 packets sent     0 receive buffer errors     5 send buffer errors     IgnoredMulti: 4125  netstat command is supposedly , so I thought there would be an equivalent to netstat -s within the ss command.

prints out a lot of very detailed protocol statistics like number of TCP reset messages received or number of ICMP "echo request" messages sent or number of packets dropped because of a missing route.  When in Linux netstat is considered deprecated at nowadays, then is there an alternative?  Statistics provided by ss -s are superficial compared to the ones provided by netstat.


Preface this with the following: I am not a DBA. I see this is a fairly common issue, but everything points back to the transaction log backups. I've been tasked with something well outside my wheelhouse. I set up our SQL DB (Roughly 20gb in size,) in FULL recovery mode with a nightly FULL backup that occurs every weekday at 4:30AM. This task checks integrity, reorganizes index, updates statistics, history cleanup, backup the full db, shrinks the db, and then maintenance clean up. I then set another subplan for Transaction Logs. This backs up the Transaction Log every 3 hours during business hours (8am, 11am, 2pm, 5pm), also during weekdays. There are not that many transactions that occur really; in the years I've been here the actual DB has increased less than a gb. The .LDF file for the server exploded over night on Saturday and with no monitoring or warning, the server is now at capacity. This had been running fine from the looks of the data usage report (and random eyeballing) for months. It looks like shortly after the backup started, at 4:36AM, the transaction log file kept growing to the point where it is sitting at 90gb, with a whopping 5MB free on the drive. My initial thought was to move one of the older db backups off the server to alleviate space constraints; This worked for a few minutes before the .LDF file gobbled that up also. Is the only real option I had to switch the DB to SIMPLE, shrink the transaction log, and then swap to FULL, take a backup, and resume where I left off? I attempted to do a compressed transaction log backup to the other drive on the machine and it still would not allow me to do a DBCC SHRINKFILE. It errored out saying the transaction log for the DB is full due to 'log_backup'. I attempted three transaction log backups and trying the DBCC SHRINKFILE each time. In my testing environment the FULL->SIMPLE->FULL method seemed to work, but I am unsure why, or how this happened to begin with. Am I missing something? I realize that this method is not ideal since it can break the log chain.. Thanks!

This one seems to be a common question in most forums and all over the web, it is asked here in many formats that typically sound like this:  In SQL Server -  What are some reasons the transaction log grows so large? Why is my log file so big? What are some ways to prevent this problem from occurring? What do I do when I get myself on track with the underlying cause and want to put my transaction log file to a healthy size?


I'm having trouble getting Pokemon GO to run on my phone, it's stuck on a loading screen that has the "Pokemon GO" logo at the top, a cancel button ("X") at the bottom and a spinny ball in the middle and never starts the game. I've played it many times on this phone (to level 36) so not sure what's going on. I've tried looking for information on line about it but there's nothing I can see that's similar.  Any ideas?  Thanks

Pokemon GO isn't working at all for me right now. I'm in one of the following circumstances and can't do anything:   My game is displaying a "Try Again" message I'm stuck on the Loading Screen When I sign in I get a message that the servers are experiencing problems. I see the map but nothing is loaded, and my team color is wrong The "loading" Pokeball just ends up spinning and I can't catch or interact with things When I try to catch a Pokemon, the Pokeball just sits on my screen doing nothing Gym opponents will drop to 1 HP and won't take any more damage or attack When I open a pokestop, the pokestop image and the name of the pokestop does not load.   What's causing this? Is there a way to fix it?


r has always the last integer between the parenthesis.  What is the output of the following program?  #include <iostream> using namespace std; main() {     int i = 1, j = 2, k = 3, r;     r = (i, j, k);     cout << r <<endl; }   Possible answers:  A - 1 B - 2 C - 3 D - Compile Error   What I want to know is why does this happen.


Which is correct?   I haven't gotten any sleep since Monday  I haven't got any sleep since Monday   (Are both of these sentences wrong? Should I use "I haven't slept since Monday" instead?)  Thank you x

I see these two expressions are used almost identically in different contexts. Is there a difference between I have got and I have gotten?


Does the  count as a magical source of damage to bypass resistance/immunity to nonmagical attacks?   While it is in the Magic Items section of the DMG, it does not actually state  that it is a magical weapon like they did with the .

I am planning on having an encounter with a monster that has immunity to basically any attack from a non-magical weapon. Now, my players mostly have weapons with magical qualities, but they are not all combat related (like a shortsword that gives +1 to charisma checks, or a staff that grants the ability to cast druidcraft once a day).  So my question is:  Does any weapon with magical qualities (regardless if they're combat related or not) negate damage resistances or immunity a monster may have from non-magical weapons?


I simply don't understand the question. Doesn't $\mathbb{Z}/42\mathbb{Z}$ consist of $42$ subsets? (Namely $\{0,42,84,\cdots\}, \{1,43,85,\cdots\}, \cdots, \{41, 83, 125, \cdots\}$) And then how would you square an entire subset? New to this website so if I did anything wrong please tell me.

I need the idempotent elements of $Z_{900}$ $2^2\cdot 3^2\cdot 5^2=900$ Of course there's $$0 \pmod 4 \\ 0 \pmod 9 \\ 0 \pmod {25} \\ $$ and $$ 1 \pmod 4 \\ 1 \pmod 9 \\ 1 \pmod {25} \\ $$ I found the answers by making a C++ program to test all numbers, but I don't know how to quick solve on paper. This is the output of the program $(0, 0, 0) \rightarrow 0 \\ (1, 1, 1) \rightarrow 1 \\ (0, 0, 1) \rightarrow 576 \\ (0, 1, 0) \rightarrow 100 \\ (1, 0, 0) \rightarrow 225 \\ (1, 1, 0) \rightarrow 325 \\ (0, 1, 1) \rightarrow 676 \\ (1, 0, 1) \rightarrow 801 \\$


relates continuous symmetries in the time evolution of a system to a conserved value.  Many conserved values, such as conservation of momentum, can be described via this theorem.  I'm interested in whether there is a meaningful conserved value for a cyclic time symmetry, $t^\prime = t + \tau$, where $\tau$ is not an infintessimal perturbation.  From what I can tell, that symmetry is not a continuous symmetry, so I should not be able to apply Nother's thorem.  However, intuitively things like standing waves feel like there's a conservation law that governs them (less general than conservation of energy or momentum).  Of course, feelings are not the same as mathematical truths.  Is there a clever mathematical way to treat a cyclic time symmetry which permits the application of Nother's theorem or a related corollary, or is this simply a perfect example of what Nother's theorem can't speak to?

states that, for every continuous symmetry of an action, there exists a conserved quantity, e.g. energy conservation for time invariance, charge conservation for $U(1)$. Is there any similar statement for discrete symmetries?


In my script I need to generate a simple list of [1,2,3,4] values and then shuffle each one of those lists inside this list individually. I used random.shuffle() function which works fine on single arrays, but when I try to use it in a for loop the output is a list of shuffled arrays, but all of them identical:     [3, 1, 2, 4]   [3, 1, 2, 4]   [3, 1, 2, 4]   etc...   I have tried running the script with different python versions (2.7, 3.6) but the problem persists.  Here is a simplified code that represents the issue:  import random  numbers_list = [1,2,3,4] #make a list of 10 numbers_list list_of_lists = [numbers_list]*10  #shuffle every list inside list_of_lists for i in list_of_lists:     random.shuffle(i)  #print every list from list_of_lists for a in list_of_lists:     print(a)   Running the script multiple times results in different lists, but they always consist of a repeated one array. What can I do to fix it? Is it an issue with random.shuffle() or my script? What am I doing wrong?

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


I’m not a native English speaker, and therefore very often I prepare my texts in a Google Translate application, copy it to the clipboard, and paste in a desired place.  The problem is that I can’t paste any text into the comment box below a question/answer.  Is it a bug, or some sort of security stuff?   App Version: 1.6.6.2 Device: iPhoneXs (iPhone11,2) OS Version: Version 12.0.1 (Build 16A405)

I’m able to copy-paste from any application to any application. I’m able to copy from a comment or from a question or from an answer. I’m able to paste to a question or answer. However, if I attempt to paste into a comment, nothing happens. I am able to subsequently paste into another application, confirming that the text is actually on the clipboard.   However, copying SE links will paste them successfully, but all other text - including other links - still fails. This leads me to believe that it’s a SE issue and not an Apple one.   This has been an issue since 11.0 beta and persists through iOS 13 release.


Currently I have privileges to approve wiki tag edits in   Pre-Requisite  User should have reputation score more than 5000  Steps to reproduce   Edit a wiki tag From that moment onward you can see following     Clicking on that gives

On the new History beta site I have the privilege to approve tag edits already but my own edits still go into the review queue. And the review dashboard displays a different number of pending edits depending on where I am: on  I see one pending edit, on  I see none. I am pretty sure that the pending edit being displayed is my own - I edited a tag wiki and that edit hasn't been approved yet. It shouldn't be counted no matter where I am.


Let $p$ be a prime and let $F=\mathbb{F}_p$.  Prove that there exists an irreducible polynomial $f\in F[x]$ with $\deg(f)=2014$.   Attempt:  Assume in contradiction that every polynomial $f\in F[x]$ of degree $2014$ is reducible. Let $f\in F[x]$. (My problem is to find a proper $f$ such that I will get a contradiction). There exist $g,h\in F[x]$ s.t. $$ F[x]\ni f(x)=g(x)\cdot h(x)$$ If we look at $f$ as an element in $\mathbb{Z}[x]$ then we get that there exists some $r\in\mathbb{Z}[x]$ s.t. $$\mathbb{Z}[x] \ni f(x)=g(x)\cdot h(x) +p\cdot r(x)$$

Let $F$ be a finite field. How do we prove that for each $n \in \mathbb{N}$ there is an irreducible polynomial of degree $n$?  One can assume that $F = \mathbb{F}_{p^m}$ where $p$ is prime. If $n \ge |F|$ then I can construct an irreducible polynomial, namely  $ p(x) = 1 + \prod_{j=1}^{|F|} ( x - a_j )$  where $a_j$ are all the field elements. It is clear that $p(x)$ has no roots in $F$.  This trick doesn't work for $n < |F|$. A counter-example: Let $F = \mathbb{F}_3$ and $p(x) = 1 + (x-1)(x-2)$, then $p(1) = 1$, $p(2) = 1$, $p(0) = 1 + (-1)(-2) = 1 + 2 = 3 = 0 \pmod 3$.  I know there is a way to count them using the Möbius function $\mu(n)$ but I want a proof without it that just shows existence.


I mean can I login using Advanced options -> Recovery Menu as root user without any restriction (except for a Full Disk Encrypted system)? Can someone explain how to fix this security hole?  Visual explanation:

How is the ability of a person who gained physical access to your computer to get root with those steps in any way secure?   When grub2 menu opens press  e  to edit the Linux start options Change:   "linux   /vmlinuz-2.6.35-23-generic root=UUID=e7f1e48d-0015-485f-be7d-836217a31312 ro   quiet splash"    to:  "linux   /vmlinuz-2.6.35-23-generic root=UUID=e7f1e48d-0015-485f-be7d-836217a31312 ro init=/bin/bash"  Now you have root access just do:   mount -o remount,rw / passwd user mount -o remount,ro /  sync  reboot the computer and you win.   My question is, how is being able to break into any Linux machine through grub2 secure? I don't understand that fact about Linux, thank you for your answers.


I have two .blend files and each one has materials library. How can I have the both materials libraries in ONE .blend file?

I have created several designs for a particular project and they are related, but I don't want to have to keep recreating any similar elements, such as shared materials or textures.  How can I use the existing data in a new Blender file?


I am trying to read from a URL but my program constantly gives me this error:  java.io.IOException: Server returned HTTP response code: 403 for URL: https://www.google.com/search?q=weather+in+seattle&oq=weather+in+sea&aqs=chrome.0.0l3j69i57j0l2.4686j0j4&sourceid=chrome&ie=UTF-8 at java.base/sun.net.www.protocol.http.HttpURLConnection.getInputStream0(HttpURLConnection.java:1913) at java.base/sun.net.www.protocol.http.HttpURLConnection.getInputStream(HttpURLConnection.java:1509) at java.base/sun.net.www.protocol.https.HttpsURLConnectionImpl.getInputStream(HttpsURLConnectionImpl.java:245) at java.base/java.net.URL.openStream(URL.java:1117) at Main.main(Main.java:17)      Exception in thread "main" java.lang.NullPointerException       at Main.main(Main.java:25)   What must I do to fix this?

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?


Is there a common standard for the title hierarchy of research positions in the English language?  Excluding people who do research such as students or professors, but purely researchers.  Something in engineering such as, Junior Programmer and Senior Programmer.  I have heard of these, and in what I assume is a hierarchy:    Research assistant Assistant researcher Researcher Senior researcher   Is there such thing as "Principal Researcher" which describes the job position as opposed to the PI on a project.  Would this title be given to more than one person in the same lab?  Purpose of the question:  In other languages, specifically in Asia, there are many words for hierarchy in both business and academia.  Google translate does not work, as it just recommends "senior" for many of the words, but in the native language they are much different, and are all above the standard "Researcher" position.  The research institute would like things like business cards and website to make sense to other countries and native English speakers.  As of now, the native language shows two different words, but in English they are the same "Senior Researcher", which makes it difficult to understand/explain what position the person is in.

Looking at the  on Wikipedia shows that the same academic rank/title can mean quite different things in different countries. For instant, a "research assistant" in the US can stand for an undergrad student doing an internship, while in the UK it can stand for a postdoc. Similarly, the term "lecturer" might stand for a permanent position (e.g. in the UK) or for a teaching assistant position, open to graduate students.   However, when thinking about it, there are not so many kind of possible positions (permanent or not, with teaching or not, with research or not, with PhD supervision or not, with team responsibility or not, etc), and having a clear title could help a lot (for instance, in my case, I've been working in four different countries, with a different job title each time!).    Is there some kind of official taxonomy that one could refer to?  If not, who could be in charge to create it? (the EU, if only for intra-Europe mobility?)


I'm having some issues understanding how the effective potential energy of a two-body system is derived from the Lagrangian of the system. Specifically my issue is with one step...   Suppose we are analyzing the system in the centre of mass frame with a reduced mass $\mu$, radial separation $r$, and angular speed $\dot{\phi}$. Then the Lagrangian can be expressed as:  $$\mathscr{L}= \frac{1}{2}\mu(\dot{r}^2+r^2\dot{\phi}^2)-U(r)$$ I understand that $\phi$ is a cyclic coordinate, since $\frac{\partial \mathscr{L}}{\partial \phi}=0$ , and thus the angular momentum $l$ is conserved. Since  $l=\mu r^2 \dot{\phi}$ , we can use this to substitute in for  $\dot{\phi}$  and make the Lagrangian one-dimensional.   My problem is this: if we substitute in the  $\dot{\phi}$  before using the Euler-Lagrange equation to derive the equation of motion, we get the wrong result. There is a minus sign where there shouldn't be! $$\begin{align} \mathscr{L} &= \frac{1}{2}\mu\dot{r}^2+\frac{1}{2}\mu r^2 \biggl(\frac{l}{\mu r^2}\biggr)^2-U(r) \\ &= \frac{1}{2}\mu\dot{r}^2+\frac{l^2}{2\mu r^2}-U(r) \ \Rightarrow \ U_{eff}(r) = U(r) - \frac{l^2}{2\mu r^2} \end{align}\\  \frac{d}{dt} \frac{\partial \mathscr{L}}{\partial \dot{r}}=\frac{\partial \mathscr{L}}{\partial r} \ \Rightarrow\ \ \mu\ddot{r}=\color{red}{-}\frac{l^2}{\mu r^3}-U'(r)$$  Whereas if we reverse the order of these steps, we get the correct result. $$\mathscr{L}= \frac{1}{2}\mu\dot{r}^2+\frac{1}{2}\mu r^2\dot{\phi}^2-U(r) \\  \begin{align}\frac{d}{dt} \frac{\partial \mathscr{L}}{\partial \dot{r}}=\frac{\partial \mathscr{L}}{\partial r} \Rightarrow\mu\ddot{r} &= \mu r \dot{\phi}^2 -U'(r)\\ &= \mu r \biggl(\frac{l}{\mu r^2}\biggr)^2 -U'(r)\\ &= \frac{l^2}{\mu r^3} -U'(r)\\ \end{align}$$ What's going on here? Why does the order of these operations matter and what does this mean physically?  POST-EDIT:   In response to being marked as a duplicate of: . I did not fully understand the answer to this question as it is beyond the scope of what I've learned (as an undergraduate sophomore).  As for: , the title isn't very descriptive of what's being asked, so I didn't find this post. However, the accepted answer is very succinct and given with less advanced theory. Thank you for bringing it to my attention!

If there is a system, described by an Lagrangian $\mathcal{L}$ of the form   $$\mathcal{L} = T-V = \frac{m}{2}\left(\dot{r}^2+r^2\dot{\phi}^2\right) + \frac{k}{r},\tag{1}$$   where $T$ is the kinetic energy and $V$ the potential energy, it is also possible to define the total energy $E$ of the system   $$ E = T + V =\frac{m}{2}\left(\dot{r}^2+r^2\dot{\phi}^2\right) - \frac{k}{r}.\tag{2}$$  If the angular momentum $M$ is defined by $$ M = m r^{2} \dot{\phi},\tag{3}$$ then $E$ can be written as  $$ E = \frac{m}{2}\dot{r}^2 + \underbrace{\frac{M^2}{2mr^2}-\frac{k}{r}}_{V_\textrm{eff}\left(r\right)},\tag{4}$$  where the last two terms are written as new, "effective" potential $V_\textrm{eff}\left(r\right)$.    In addition, using the definition of $M$, the Lagrangian $\mathcal{L}$ can be written as  $$ \mathcal{L} = \frac{m}{2}\dot{r}^2 + \underbrace{\frac{M^2}{2mr^2}+\frac{k}{r}}_{-V_\textrm{eff}\left(r\right)},\tag{5}$$  where the sign of $V_\textrm{eff}\left(r\right)$ has been changed, since $\mathcal{L} = T-V$. But from this argument, it appears that there are two different possible ways to construct the same effective potential. This seems to me contradictory. Where is my mistake?


I've been working on updating a site which was running on an old version of WordPress, I've had to update the theme, most of the plugins and finally got the WordPress up to date. I've had to do a few customisations including using plugins to replace old theme functions that the site used which are not present/working in the updated theme. The theme is now not supported by the developer.  The only thing stopping the site going live is that a scroll up button doesn't work properly on the Home page. The scroll up button appears after a user scrolls down a page and when clicked on smooth scrolls to the top of the page and disappears. This is acheived using a bit of jQuery that has been added to the theme's custom.js file.  The custom.js file starts with the line:  jQuery(document).ready(function($) {   The button script works fine on all the other pages but not on the front page where it seems the jQuery script has not been loaded. Here's the bit of jQuery:      /* --------------------------------------------------------------------------- */ /*  13. Back to Top /* --------------------------------------------------------------------------- */  $("#back-top").hide();  $(window).scroll(function () {     if ($(this).scrollTop() > 100) {         $('#back-top').fadeIn();     } else {         $('#back-top').fadeOut();     } });  $('#back-top a').click(function () {     $('body,html').animate({         scrollTop: 0     }, 600);     return false; });  });   I'm at the point where I'm just going to wpenqueue the required script to make it work anyway but I'd rather fix the problem which may be obvious to some but now has me going in circles.  The site can be seen at   UPDATE 28/10/2013:  I've copied the jQuery code and put it into its own script and enqueued the script via functions.php. I can see the script (backtotop.js) loading but it still isn't working on the home page but works on all others.  Here's the script:  jQuery(document).ready(function() {     jQuery("#back-top").hide();      jQuery(window).scroll(function () {         if (jQuery(this).scrollTop() > 100) {             jQuery('#back-top').fadeIn();         } else {             jQuery('#back-top').fadeOut();         }     });      jQuery('#back-top a').click(function () {         jQuery('body,html').animate({             scrollTop: 0         }, 600);         return false;     });  });   The site is at

I know that jQuery is loaded, because I can switch out the $ for 'jQuery' and everything behaves as expected, but this will be a messy script if I can't fix this  This script:  jQuery(document).ready(function(){     $("ul.vimeo_desc_feed li a").click(function(){         alert($(this).attr('href'));         return false;     }) });   Produces the error $ is not a function  This script:  jQuery(document).ready(function(){     jQuery("ul.vimeo_desc_feed li a").click(function(){         alert(jQuery(this).attr('href'));         return false;     }) });   works fine.


I'm interested in street photography but always had the fear of how people may react when I'm taking candid pictures. Because, I have seen people snatch away cameras and create a big drama on the street.  It seems that other photographers get different reactions because of their appearance. When taking similar shots the subjects are not bothered as much and may just shy away from the frame if not interested.     [This question is not a duplicate because I want to take candid shots and not approach people and make them pose]

I am enjoying taking candid photos of people, but the subject is usually someone I know, or it is during some family/friend event, so after a while the people get used to the presence of the camera and act quite naturally.  I like "street photography" which captures ordinary people in everyday situations and I am thinking about giving it a try.  If you have experience in that type of photography, could you share some tips on how to approach people in a way that the the presence of the camera is not too obtrusive, and you can achieve the natural look on your photos?  I am not interested in paparazzi-style shooting using telephoto lenses, but more in photos taken within the range of 24-85mm lens, which means that you need to be pretty close to the subject.


I've been researching it for a couple of days and as far as I can see I just can't. I was hoping someone here has some insight into a workaround that can help me do it?  For example I need to do basic +-/* with max unsigned int = 4294967295 or with a number like 175723942.7192731.

To use  as you would require when using the  with large numbers (100,000+), it calls for some very large calculations.  When I multiply two large numbers (eg: 62574 and 62574) PHP seems to cast the result to a float. Getting the modulus value of that returns strange values.  $x = 62574 * 62574; var_dump($x);          // float(3915505476) ... correct var_dump($x % 104659); // int(-72945)  ... wtf.   Is there any way to make PHP perform these calculations properly? Alternatively, is there another method for finding modulus values that would work for large numbers?


I have set up a network as such: Set up host-only networking on VirtualBox. The first adapter is configured with NAT, the second with host-only networking  HOST: Windows GUEST: CentOS VM1, CentOS VM2 (clone of VM1)    When executing ifconfig -a on both VMs, I noticed that the MAC addresses are exactly the same. My question is how am I able to ping from  VM1 to VM2 considering that the MAC addresses are the same?  VM1: eth0      Link encap:Ethernet  HWaddr 08:00:27:AF:A3:28             inet addr:10.0.2.15  Bcast:10.0.2.255  Mask:255.255.255.0           inet6 addr: fe80::a00:27ff:feaf:a328/64 Scope:Link           UP BROADCAST RUNNING MULTICAST  MTU:1500  Metric:1           RX packets:27 errors:0 dropped:0 overruns:0 frame:0           TX packets:47 errors:0 dropped:0 overruns:0 carrier:0           collisions:0 txqueuelen:1000            RX bytes:10671 (10.4 KiB)  TX bytes:5682 (5.5 KiB)  eth1      Link encap:Ethernet  HWaddr 08:00:27:C4:A8:B6             inet addr:192.168.56.102  Bcast:192.168.56.255  Mask:255.255.255.0           inet6 addr: fe80::a00:27ff:fec4:a8b6/64 Scope:Link           UP BROADCAST RUNNING MULTICAST  MTU:1500  Metric:1           RX packets:859 errors:0 dropped:0 overruns:0 frame:0           TX packets:41 errors:0 dropped:0 overruns:0 carrier:0           collisions:0 txqueuelen:1000            RX bytes:114853 (112.1 KiB)  TX bytes:4823 (4.7 KiB)   ip -6 addr     1: lo: <LOOPBACK,UP,LOWER_UP> mtu 16436          inet6 ::1/128 scope host             valid_lft forever preferred_lft forever     2: eth0: <BROADCAST,MULTICAST,UP,LOWER_UP> mtu 1500 qlen 1000         inet6 fe80::a00:27ff:feaf:a328/64 scope link             valid_lft forever preferred_lft forever     3: eth1: <BROADCAST,MULTICAST,UP,LOWER_UP> mtu 1500 qlen 1000         inet6 fe80::a00:27ff:fec4:a8b6/64 scope link             valid_lft forever preferred_lft forever  VM2:  eth0      Link encap:Ethernet  HWaddr 08:00:27:AF:A3:28             inet addr:10.0.2.15  Bcast:10.0.2.255  Mask:255.255.255.0           inet6 addr: fe80::a00:27ff:feaf:a328/64 Scope:Link           UP BROADCAST RUNNING MULTICAST  MTU:1500  Metric:1           RX packets:114 errors:0 dropped:0 overruns:0 frame:0           TX packets:151 errors:0 dropped:0 overruns:0 carrier:0           collisions:0 txqueuelen:1000            RX bytes:41594 (40.6 KiB)  TX bytes:13479 (13.1 KiB)  eth1      Link encap:Ethernet  HWaddr 08:00:27:C4:A8:B6             inet addr:192.168.56.101  Bcast:192.168.56.255  Mask:255.255.255.0           inet6 addr: fe80::a00:27ff:fec4:a8b6/64 Scope:Link           UP BROADCAST RUNNING MULTICAST  MTU:1500  Metric:1           RX packets:1900 errors:0 dropped:0 overruns:0 frame:0           TX packets:78 errors:0 dropped:0 overruns:0 carrier:0           collisions:0 txqueuelen:1000            RX bytes:259710 (253.6 KiB)  TX bytes:9736 (9.5 KiB)    ip -6 addr     1: lo: <LOOPBACK,UP,LOWER_UP> mtu 16436          inet6 ::1/128 scope host             valid_lft forever preferred_lft forever     2: eth0: <BROADCAST,MULTICAST,UP,LOWER_UP> mtu 1500 qlen 1000         inet6 fe80::a00:27ff:feaf:a328/64 scope link             valid_lft forever preferred_lft forever     3: eth1: <BROADCAST,MULTICAST,UP,LOWER_UP> mtu 1500 qlen 1000         inet6 fe80::a00:27ff:fec4:a8b6/64 scope link tentative dadfailed             valid_lft forever preferred_lft forever

I have two virtual machines both running on a Linux host (Fedora 16).  I set both adapters as attached to NAT.  When I boot them up they both have their default gateway set to 10.0.2.2.  They also both have the same IP address (10.0.2.15). They are both on the same adapter (adapter 1). I don't know why they are getting assigned the same IP address, and shouldn't the default gateway be 10.0.2.1 since the subnet address is 10.0.2.0 and the netmask is 255.255.255.0. Is there something I am missing, has this happened to anyone before? How do I get the VirtualBox DHCP working properly?


I bought a PS4 in UK and I've been using it for close to two and a half weeks here and I'm taking it back to India so will I have to pay them? There are no boxes, just the console in one suitcase wrapped in a blanket and the controller in another suitcase.   If I do get stopped how much will I have to pay? The total price I paid was around 38k including a game and the console.

I am going to India (Delhi) from USA (California) for the first time. When talking about how many items (electronics, jewelry, perfumes, watches etc) we can take in luggage bags and/or cabin bags there is always confusion. Some people say you can't take more than two phones or at most four electronic items. Some other mention different numbers. I was never terrified with numbers until I came to this situation.   Can anybody provide me with an official link stating the amount of items I can bring to India? Or any authentic resource where I can find the exact answer?


I was following a fire tutorial () on YouTube and got to the part where I have to bake the simulation and I noticed that I don't have a bake button at all. I have tried to change it to cycles from Eevee to workstation and still don't have the bake button. I have even tried it on a different Pc and on 2.82/3 I would appreciate it if someone could help Thanks Here is the screen shot of the menu.

(new to blender) i am trying to create a fluid sim in blender 2.83 but in my physics tab under domain there is no 'bake data' button in the options. It's there in all the tutorials i've watched but i dont seem to have it.


I want to to make another clash of clans base but when I log out of Game Center and log into another account it doesn't ask if I want to delete my base and sign in with the new Game Center. Is there any other was i can get a new base with out loosing my old one?

I have been playing on two clash of clans accounts on one device for a long time but just recently i cannot switch from my lvl17 to my lvl75. The switch villages option is not popping up for me and I don't know why. Can anyone help me get my main account back?


I am writing my thesis with by use of the classicthesis style by use of biblatex for my bibliography. biblatex offers a compatibility mode for natbib and all of the basic commands shall work according to the documentation of biblatex. However, the command \Citet{} which is important for capital letters of authors like "van Krevelen" or "de Nevers". In my case \Citet{} does the same like \citet{}     \documentclass[     twoside,openright,titlepage,numbers=noenddot,headinclude,     footinclude=true,cleardoublepage=empty,     headsepline,     dottedtoc,     BCOR=5mm,paper=a4,fontsize=11pt,      ngerman,american,     ]{scrreprt}       \PassOptionsToPackage{utf8}{inputenc}    \usepackage{inputenc}    \usepackage[american]{babel}     \PassOptionsToPackage{%     backend=biber,     isbn = false,     doi = false,     language=auto,     style=authoryear-comp,     sorting=nyt,     maxbibnames=1,     natbib=true     }{biblatex}     \usepackage{biblatex}      \addbibresource{example.bib}      \usepackage{classicthesis}       \begin{document}         When citing with "Citet" one obtains for example:          \Citet{Krevelen.1950}.     \end{document}   with example.bib:  @article{Krevelen.1950,     author = {{van Krevelen}, D.W. and Hoftijzer, P.J.},     year = {1950},     title = {Studies of Gas Bubble Formation},     volume = {46},     number = {1},     journal = {Chemical Engineering Progress} }

I use natbib compatibility code with biblatex and it should produce a capital letter but it does not. I even tried another representation of the name but this got worse: The van got dropped. biblatex has the command defined \newrobustcmd*{\Citet}{\bibsentence\citet} but somehow \bibsentence seems to be broken. Is there any way to fix this and get the functionality?  \documentclass{article} \usepackage{filecontents} \begin{filecontents*}{\jobname.bib}  @article{vanTrijp2013a,         Author = {Remi {van Trijp}},         Year = {2013} }   @article{vanTrijp2015a,         Author = {van Trijp, Remi},         Year = {2015} }    \end{filecontents*} \usepackage[backend=biber,natbib=true,   citestyle=authoryear-comp]{biblatex} \addbibresource{\jobname.bib} \begin{document}  \Citet{vanTrijp2013a} should come out as Van Trijp (2013).  \Citet{vanTrijp2015a} drops the \emph{van} alltogether. \printbibliography \end{document}


I've figured out how to create a custom menu, but I'd like to be able to hide or show certain columns (not necessarily ranges), based on what menu item is selected.  Not sure on the next steps / can't make it work.  function onOpen() {` var ui = SpreadsheetApp.getUi()     .createMenu('Custom Menu Views')     .addItem('Financial', 'financial')     .addItem('Schedule', 'schedule')     .addToUi(); }

Trying to determine a way that I can use a custom menu (.createMenu) with views that will allow me to show / hide specific columns.  I need the capability to pick specific multiple columns and not ranges.  In the example below how can you pick a custom view from the menu (say "Customer Info") that will only show columns A, B, C, and H?  Maybe another view could show "Financial".


We've  the canonicity of the Lego Star Wars shows (Yoda Chronicles and the four Episodes (Empire Strikes out, Padawan Menace, etc) but what is the canonicity of the new "" shows?   Since they were produced after April 2015, is their canon status any different to the other Lego: Star Wars properties?

For all types of derivative works, namely:   Movies Novels Comic books Other written works (including RPG materials) Cartoons Video games Derivative movies (such as the infamous Ewok movies and even more infamous )   According to what rules does something become "canon" and who is responsible for the evaluation of a published work?


I have a python list, created by model = [[[[0,0,0,0]]*4]*15]*5, which is a list that looks like this (without the brevity dots): model = [[[[0,0,0,0],...[0,0,0,0]]...[[0,0,0,0],...[0,0,0,0]]]...[[[0,0,0,0],...[0,0,0,0]]...[[0,0,0,0],...[0,0,0,0]]]]. The problem is that when I try to set one of the zeros to some other value using    def setLED(model,boardid,chipid,tankid,ledid,value):      model[boardid][chipid][tankid][ledid]=value   every list of 4 zeros gets set the same. i.e. if I tried to use setLED(model,0,0,0,0,255), the first value in every list of 4 zeros would be 255. The intended result is that only the first list of 4 zeros, (i.e. model[0][0][0][0]), would be changed. I don't think there is a way to attach files, but if anyone needs it, I can post the full contents of the list.  Thanks in advance to anyone who can figure out why this is happening.  EDIT: This is a duplicate of

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


Image.h  #include <iostream> #include "Array.h"  using namespace math;  namespace imaging {     class Image: public Array     {         public:             Image();     }; }   Array.h  namespace math {      template <typename T>     class Array     {         protected:             T * buffer;             unsigned int width, height;         public:             Array(unsigned int w, unsigned int h);     }; }   and Array.cpp  #include <iostream> using namespace std;  namespace math {     Array::Array(unsigned int w, unsigned int h)     {         this->width = w;         this->height = h;     } }   I have these errors: Image.h:12:2: error: expected class-name before { token  {   ^ In file included from Image.cpp:1:0: Image.h:12:2: error: expected class-name before { token  {   ^ Array.cpp:8:2: error: invalid use of template-name math::Array without an argument list   Array::Array(unsigned int w, unsigned int h)  Any help for this??? Thnx

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.)


So, I've been trying to renewcommand \alpha by assigning it parameters in Latex. This is what I have for my preamble and the body...(seen below). On line 12, I attempted to create such a "function", but I continue to get the following errors for line 14:  ! TeX capacity exceeded, sorry [input stack size=5000].\alpha #1->\alpha (#1) ...\mathcal{C}^{\infty})\) is a map \(\alpha:   and for line 1: ! ==> Fatal error occurred, no output PDF file produced! Can someone please help!?   \usepackage[utf8]{inputenc} \usepackage{latexsym, braket, amsmath, amsfonts, amssymb,amsthm, mathtools, standalone, setspace, graphicx, tikz, pgfplots, nccmath} \pgfplotsset{compat=newest} \usepackage[english]{babel} \newcommand{\Def}{\underline{\textbf{Definition:}}} \renewcommand{\labelenumiii}{\roman{enumiii}} \renewenvironment{proof}{\textbf{Proof:}\setlength{\parindent}{5em} \setlength{\parskip}{1em} \renewcommand{\qedsymbol}{$\blacksquare$}}{\hfill \qedsymbol} \DeclarePairedDelimiter\abs{\lvert}{\rvert} \renewcommand{\sup}[1]{\mathrm{sup}(#1)} \renewcommand{\inf}[1]{\mathrm{inf}(#1)} \renewcommand{\alpha}[1]{\alpha(#1)} \newcommand{\eps}{\epsilon} \usepackage{anysize}\marginsize{.5in}{.5in}{.5in}{.5in} \setlength{\parindent}{3em} \setlength{\parskip}{1em} \author{Dwight Dinkins} \title{DIfferential Geometry ITCP: Lecture 1} \date{March 19, 2020} \setstretch{2}% \begin{document} \maketitle \Def A differentiable curve \((\mathcal{C}^{\infty})\) is a map \(\alpha: I \longrightarrow \mathbb{R}^{3}\), \(I=(a,b)\subset\mathbb{R}\), such that \[\alpha{t}=( x(t), y(t),z(t))\), \(x,y,z\) are \(\mathcal{C}^{\infty}\) functions. \end{document}```

I'd like to "add to" an existing command by writing something like  \renewcommand{\somecommand}{\begin{something}\somecommand\end{something}}   but (not surprisingly) I get errors about being "too deeply nested".  Is there a way to take an existing command, add to it (by appending or prepending additional commands or text), and then have that "augmented" command replace the existing command?


I would like to use a custom icon (a .ico file) for an executable, on windows (XP). The executable is a C++ program created thanks to visual studio (2008).  How can I change the icon from the executable, to the .ico file I want?

How do I set the executable icon for my C++ application in visual studio 2008?


When I probe my city mains with one probe in the live and one in earth (which should be 0 volt) it shows a voltage of around 250v. But when I probe the neutral and the earth it shows no voltage. I know that current runs in one direction for 50 times in a second. So the neutral should act like live for 50 times in a second. Then neutral should show some voltage with the earth, which it doesn't. If you touch the neutral wire you won't get shocked but if you touch the live the wire you get shocked why and how?

If the neutral wire carries current, why do many people believe that it's safe? I've heard "You can touch the neutral wire/bar in the breaker box and not get shocked. Only the hot can hurt you." If the circuit is complete and current is flowing, can't you receive a shock?


I am using the TikZ package to create braids for my 4th year project.  But everytime I hit the button to run the code, my braid jumps to the top of the page rather than sitting where I want it.  Can anyone help?  I am using the following packages,  \usepackage{amsmath, amsfonts, amsthm, amssymb} \usepackage{graphicx} \usepackage{tikz} \usepackage{braids}  \begin{document}  \begin{figure}      \centering         \begin{tikzpicture}             \braid[rotate=90, line width=.4mm] a_1 a_2 a_2 a_1 a_2^-1;         \end{tikzpicture}      Figure~1 shows an example of a $3$-braid. \end{figure}  \end{document}

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 working on the following question:   $X$ is Banach. $A, B$ are closed subspaces such that $x \in X$ can be uniquely represented as the sum $x = a + b, a \in A , b \in B$. Show that $\exists k \in \mathbb{R}: \| a\| \leq k \|x\| \\ \| b\| \leq k \|x\| \hspace{2cm} \forall x \in X$.  I am completely stuck. I can't figure out how to use the closedness other than to conclude completeness of the space. Or perhaps to conclude that the projection maps will be bounded. But I can't proceed. Any nudge would be helpful.

Problem Statement  Let $(X,\|\cdot \|)$ be a Banach space and $Y$, $Z$ closed subspaces of $X$. If every $x \in X$ can be uniquely represented as $x=y+z$ for $y \in Y$ and $z \in Z$ then show that there exists $c$ such that $\|y\|\leq C\|x\|$ and $\|z\| \leq C\|x\|$  Attempt  If $L:X \rightarrow Y$ given by $L(x)=L(y+z)=y,$ then we will be done if we can show that $L$ is a bounded linear operator. Alternatively, by adding the two inequalities, we can show that the norm $\|\cdot\|$ is equivalent to $\| \cdot \|_{Y\times Z}$, where $\|(y,z)\|=\|y\|+\|z\|$. I attempted the first approach via the closed graph theorem but I am unable to make any headway.


iCloud, iCal and Mail integrates pretty well with Google Calendar, even though they are not both from Apple.  But I have a hassle when it comes to Calendar Notification in Mail App specifically.  I get notifications correctly on OS X, iPhone, about Google Calendar. But, my Mail.app keeps trying to send me emails about my notifications, so I either get duplicated emails (from both Google ou Apple) or, nowadays, I get hundreds of Draft in Mail since I've got 2 SMTP address from both accounts in Mail and it prompts me in each to decide which server show be default.  The thing is. I don't want either. What I really wanted is that Mail could stop sending me mail alerts, but keeping Google Calendar and iCal/iOS calendar in sync.   Thanks!

I'm using Google calendar, and I subscribe to my Google Calendar from multiple computers.  Whenever I set an event with (an) email reminder(s) on Google calendar, I'll get multiple emails because (1) Google calendar itself sends me the email reminder and (2) each computer that subscribes the calendar tries to send the email reminder (when the computer wakes up).  It's very annoying.


It is possible to install the same browser twice, one for personal use and another for testing? I need this because I want to use my plugins in the personal version, but sometimes the plugins may alter the look, or the code of the site, so I need the testing version without the plugins. It is not a solution to use one type of browser let's say firefox for personal, and chromium for testing, because I need to test my sites in all browsers. Thank you.

I usually have different instances of my web browsers to attend to various types of usages, on Windows that means using portable versions of Chrome and Firefox. The  for Linux are outdated and lack immediate support, compared with the portable apps for Windows. I am wondering if there is any way to make the current versions of Firefox and Chromium provided by Ubuntu work as "portable", which by that I mean running as the equivalent of a Windows portable app, detached from the default browsers.


According my second grade teacher, when you have an e in your word, the letter 'one skip' behind it is pronounced hard. For example, the word name. In 'name', the fourth letter is e, the letter behind it is m, and the second letter is a. Because a is just past e, it is a hard a, pronounced aye.  I am following this rule, ergo, are should be pronounced aye-r, right? I've been stuck on this for a while now.

How can I know, precisely, when to differentiate the sounds of the letter a, like in: apple and vault?


I am solving all my warnings/errors in my document. I have solved everything except for 2:     Underfull \vbox (badness 6876) has occurred while \output is active   [18]   and     Underfull \vbox (Badness 2142) has occurred while \output is active   [30]   My first question:   How can I found out where this error occurs? Is [18] and [30] the pagenumber? I cannot find anything strage there. How can I get more information where error occurs? Is there a debug option (like for overfull).    I found already this  with debug option:  \showboxbreadth=50  \showboxdepth=50   But that did not help.  How to deal with this?

when using an inflexible document class, one is often faced with the warning  Underfull \vbox (badness 10000) has occurred while \output is active []   on pages that contain no display math.  in  frank mittelbach quotes from the companion (2ed) regarding page specs that are "too rigid".  the recommended (and obvious) approach is to build in more flexibility.  the same suggestions, to add flexibility, are given in .  the document class in question was constructed (intentionally, if short-sightedly) with no allowance for stretch in the \parskip, between chapter title and text, and in a few other locations. furthermore, an option permits the change from [10pt] to [11pt] body text so even if the \textheight is an integral number of lines in one size, another size will not meet the criterion.  with \vfuzz one can specify a small allowance which, if not exceeded, will suppress overfull box messages.  but there isn't any equivalent for a negative allowance.  i've checked the etex manual (the latest, dated 1998/03/04) and that for etextools but didn't find anything useful.  i've looked into the tex.web code, but it wasn't obvious how one might work around the problem without a new primitive.  it's not a good idea to ignore these messages in the log, since the "structural" ones camouflage the ones (usually very few) that do need to be attended to. has anyone come up with a method for suppressing only those underfull vbox messages that are off by only a couple of points?


I have a xaml application that has two buttons: one button starts execution of my exe application:  private void RunExe(string exeName)     {         try         {             process = new Process             {                 StartInfo =                 {                     FileName = exeName,                     Verb = "runas",                     WorkingDirectory = workingDir,                     UseShellExecute = false,                     RedirectStandardOutput = true,                     CreateNoWindow = true,                  },                 EnableRaisingEvents = true             };              process.Start();         }         catch (Exception ex)         {             throw ex;         }     }   The other button is a 'Stop' button. When it's clicked i would like to stop exe execution until user confirms in pop up he wants to stop. If he confirms exe process should be stopped, otherwise it should continue. Is it possible to achive?

How do I suspend a whole process (like the Process Explorer does when I click Suspend) in C#.  I'm starting the Process with Process.Start, and on a certain event, I want to suspend the process to be able to do some investigation on a "snapshot" of it.


I have ubuntu 14.04.3 installed on my new machine equipped with an nvidia geforce 970.  Not to mention the pains I had in installing nvidia.352, last night I made a simple update and shut down. However, this morning I had the black screen login page instead of the graphical. There was a problem with nvidia I figured. So I tried to downgrade to an older version. It didn't help. Last thing I did was to purge nvidia. After reboot, however, this time I don't even get the black login page. Instead, the screen shuts down and there is nothing I can do.  I tried with recovery mode through GRUB. However, no matter which one of the options I choose, I always get the same problem. The screen shuts down and I have to reboot manually. So no terminal, no login, just the system boot settings.  After a fair amount of search, I found out that there is an issue with a concept called nomodeset which has to be set through grub. As  suggests, I searched for the line starting with linux and ending with quiet splash to add nomodeset there. However, what I have is this:  linux   /boot/vmlinuz-3.19.0-33-generic root=UUID=f40f49f8-a44b-4709-b79b-0873ca3c3b72 ro /   So there is no quiet splash to add nomodeset to. However, if I anyway try to add either nomodeset or nomodeset quiet splash in the end of the line and then reboot, it halts and I need to reboot manually.  So my question is: Is there anyway that I can have at least an access to a terminal by modifying GRUB?   At this moment I need to have a terminal to try to recover my files if possible and then maybe install nvidi again.

I've  and rebooted my machine and now I get a black or blank screen.   How can I fix this?


I need to import and export data from a table using a SQL query so I need query example for importing and exporting data. I don't want to export it to txt file as the data is not getting aligned. I have read that this can done manually but I want to do this dynamically. You can see below manually import and export data.

In my sql server 2008, after running the query the data return is very huge say in millions. I tried copying but it gives an exception sql memory error. Can you let us know how can i copy the entire data and paste it into excel.  I don't want to export it to txt file as the data is not getting aligned. So i want to manually copy and paste it into excel. Please let me know the solution for thhis


I have a TreeMap with String keys and instances of a Class as values. I want to be able to sort on an object of the Class. I have gotten this far:  public class StockTakeCompare  {      public static TreeMap<String, StockItem> sortByValues(final Map<String, StockItem> treeMap) {         Comparator<StockItem> valueComparator =                 new Comparator<StockItem>() {                     public int compare(StockItem o1, StockItem o2) {                          int res = o1.Name.compareTo(o2.Name);                         return res != 0 ? res : 1; // to preserve items with equal values                     }                 };          //THIS LINE THROWS AN ERROR:         TreeMap<String, StockItem> sortedByValues = new TreeMap<String, StockItem>(valueComparator);         sortedByValues.putAll(treeMap);         return sortedByValues;     } }   The line:  TreeMap<String, StockItem> sortedByValues = new TreeMap<String, StockItem>(valueComparator);   gives this error:      error: no suitable constructor found for  TreeMap(Comparator).    That makes sense but is there another way I can achieve my goal?    THIS IS NOT A DUPLICATE. My question is regarding using  classes as values in the TreeMap AND sorting on objects of those classes. The "duplicate" only deals with Primitives as values

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 am currently following "Python Crash Course" by Eric Matthes.  I am adding 30 new items to a list using a for loop. All the items are dictionaries. Then I am trying to update first few items of the list using the following code (actual code posted in the end)-  for item in items[0:3]:     if item['someKey'] == 'someValue':         item['someKey'] = 'someOtherValue'         item['someOtherKey'] = 'someDifferentValue'   So, as I am changing only first 3 items, it should change only first 3 items. But it is changing all items in the list if I append to the list using variable declared outside the for loop while adding items in the first place.  #Case-1 items = [] dictionary = {'someKey': 'someValue', 'someOtherKey': 'someOtherValue'} for item in range(30):     items.append(dictionary)   If I run this code and later run the for loop to update some items, then all items in the list get modified. The slicing of the list with [0:3] does not work!  #Case-2 items = [] for item in range(30):     dictionary = {'someKey': 'someValue', 'someOtherKey': 'someOtherValue'}     items.append(dictionary)   So, in this case the update process works as expected. The for loop just updates only the first 3 items. Why does this happen? I have no idea! The list gets created in both the cases just fine. Only while modifying the already created list, the behaviour is differing.    Here's the actual code-  #Case-1 aliens = [] newAlien = {'color': 'green', 'speed': 'slow', 'points': 5}  for alienNumber in range(30):    aliens.append(newAlien)  print(aliens) #Prints the whole list, showing adding dicts went just fine  for alien in aliens[0:3]: #intending change for only first 3 items     if alien['color'] == 'green':         alien['color'] = 'yellow'         alien['speed'] = 'medium'         alien['points'] = 10  for alien in aliens[0:5]:     print(alien) #Shows all five items are modified even though intended for first 3   Here's where this went good-  #Case-2 aliens = []  for alienNumber in range(30):     newAlien = {'color': 'green', 'speed': 'slow', 'points': 5}     aliens.append(newAlien)  print(aliens) #prints whole list, 30 dicts are added  for alien in aliens[0:3]:     if alien['color'] == 'green':         alien['color'] = 'yellow'         alien['speed'] = 'medium'         alien['points'] = 10  for alien in aliens[0:5]:     print(alien)  #Here only first 3 items are modified, as intended     Help me understand the behaviour of the the for loop here. The loop is only supposed to add items and nothing else. How declaring the new dictionary outside the for loop changes how items are modified later?

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


Given two independent random variable X and Y which both have uniform distribution over[0,1] I want to calculate PDF of $Z =\frac{X}{Y}$ and here is my solution: $\int_{-\infty}^{\infty}zf_X(yz)f_Y(y)dy = \int_{0}^{\frac{1}{z}}zdy = 1$ is this correct? one thing i am in doubt is the main relation that I have found over the internet: $\int_{-\infty}^{\infty}zf_X(yz)f_Y(y)dy$ is this correct?

Suppose $x_1, x_2$ are IDD random variables uniformly distributed on the interval $(0,1)$.  What is the pdf of the quotient $x_2 / x_1$?


I used scipy.stats.linregress function for my dataset. It returns 5 output variables.  Slope = 0.0453 Intercept = 14.905 r-value = 0.91 p-value = 0 standard error of estimate = 0.00015  This is the documentation link if anybody would like to see  Can somebody help in understanding the output? Questions I would like to ask are the two variables highly correlated. The r-value is something that I think points to the correlation, but since it is not 1.0, what would be ways to find out which ones do not satisfy this constraint, can I use any of the parameters here? In general when you see such values how to grasp them?

The help pages in R assume I know what those numbers mean, but I don't. I'm trying to really intuitively understand every number here. I will just post the output and comment on what I found out. There might (will) be mistakes, as I'll just write what I assume. Mainly I'd like to know what the t-value in the coefficients mean, and why they print the residual standard error.   Call: lm(formula = iris$Sepal.Width ~ iris$Petal.Width)  Residuals:      Min       1Q   Median       3Q      Max  -1.09907 -0.23626 -0.01064  0.23345  1.17532    This is a 5-point-summary of the residuals (their mean is always 0, right?). The numbers can be used (I'm guessing here) to quickly see if there are any big outliers. Also you can already see it here if the residuals are far from normally distributed (they should be normally distributed).  Coefficients:                  Estimate Std. Error t value Pr(>|t|)     (Intercept)       3.30843    0.06210  53.278  < 2e-16 *** iris$Petal.Width -0.20936    0.04374  -4.786 4.07e-06 *** --- Signif. codes:  0 ‘***’ 0.001 ‘**’ 0.01 ‘*’ 0.05 ‘.’ 0.1 ‘ ’ 1    Estimates $\hat{\beta_i}$, computed by least squares regression. Also, the standard error is $\sigma_{\beta_i}$. I'd like to know how this is calculated.  I have no idea where the t-value and the corresponding p-value come from. I know $\hat{\beta}$ should be normal distributed, but how is the t-value calculated?  Residual standard error: 0.407 on 148 degrees of freedom   $\sqrt{ \frac{1}{n-p} \epsilon^T\epsilon }$, I guess. But why do we calculate that, and what does it tell us?  Multiple R-squared: 0.134,  Adjusted R-squared: 0.1282    $ R^2 = \frac{s_\hat{y}^2}{s_y^2} $, which is $ \frac{\sum_{i=1}^n (\hat{y_i}-\bar{y})^2}{\sum_{i=1}^n (y_i-\bar{y})^2} $. The ratio is close to 1 if the points lie on a straight line, and 0 if they are random.  What is the adjusted R-squared?  F-statistic: 22.91 on 1 and 148 DF,  p-value: 4.073e-06    F and p for the whole model, not only for single $\beta_i$s as previous. The F value is $ \frac{s^2_{\hat{y}}}{\sum\epsilon_i} $. The bigger it grows, the more unlikely it is that the $\beta$'s do not have any effect at all.


I want to set an object as an optional parameter;  public async hearted(p, typeID, refID, [Optional] stud: Student) {  return ;}   how to set [Optional] stud: Student.

Note: This question was asked at a time when C# did not yet support optional parameters (i.e. before C# 4).  We're building a web API that's programmatically generated from a C# class. The class has method GetFooBar(int a, int b) and the API has a method GetFooBar taking query params like &a=foo &b=bar.   The classes needs to support optional parameters, which isn't supported in C# the language. What's the best approach?


In my pdf created from latex sources I can see that sometimes \lstinputlisting will have a page break in the middle just because it happened to be in the end of the page. I would like to prevent it.  The solution (not marked as accepted) from   is not helping since it make the listing to float.  Is there any other solution to prevent page breaking before \lstinputlisting ?

shows how to prevent a long listing from being split across several pages when the code is written directly into the tex file. I want to achieve the same effect when including code in separate files using \lstinputlisting like so:  \lstinputlisting[label=lst:mylist,caption=A Caption]{code/parametrised.xml}   How do I modify the listing environment definition given in the above question to do so?  \lstnewenvironment{code}[1][]%   {\minipage{\linewidth}     \lstset{basicstyle=\ttfamily\footnotesize,frame=single,#1}}   {\endminipage}   Any help would be greatly appreciated!  Edit: The question has been rephrased for clarity - The answers here relate to preventing a listing from being split across pages by ensuring it's treated like a unbreakable float. Howvever, this also means that listings longer than a page will not be paginated and will run off the bottom of the page.


I got this issue while running apt update command :       Err:12 http://us.archive.ubuntu.com/ubuntu precise-security InRelease   The following signatures were invalid: 630239CC130E1A7FD81A27B140976EAF437D05B5 Get:15 http://us.archive.ubuntu.com/ubuntu precise-updates InRelease [55.7 kB] Err:15 http://us.archive.ubuntu.com/ubuntu precise-updates InRelease   The following signatures were invalid: 630239CC130E1A7FD81A27B140976EAF437D05B5 Get:21 http://us.archive.ubuntu.com/ubuntu precise-backports InRelease [55.7 kB] Err:21 http://us.archive.ubuntu.com/ubuntu precise-backports InRelease   The following signatures were invalid: 630239CC130E1A7FD81A27B140976EAF437D05B5 Get:27 http://us.archive.ubuntu.com/ubuntu precise Release.gpg [198 B] Ign:27 http://us.archive.ubuntu.com/ubuntu precise Release.gpg Reading package lists... Done    W: An error occurred during the signature verification. The repository is not updated and the previous index files will be used. GPG error: https://dl.yarnpkg.com/debian stable InRelease: The following signatures were invalid: EXPKEYSIG 23E7166788B63E1E Yarn Packaging <yarn@dan.cx> W: GPG error: http://extras.ubuntu.com/ubuntu precise Release: The following signatures couldn't be verified because the public key is not available: NO_PUBKEY 16126D3A3E5C1192 E: The repository 'http://extras.ubuntu.com/ubuntu precise Release' is not signed. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. W: GPG error: http://archive.canonical.com/ubuntu precise Release: The following signatures were invalid: 630239CC130E1A7FD81A27B140976EAF437D05B5 E: The repository 'http://archive.canonical.com/ubuntu precise Release' is not signed. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. W: GPG error: http://us.archive.ubuntu.com/ubuntu precise-security InRelease: The following signatures were invalid: 630239CC130E1A7FD81A27B140976EAF437D05B5 E: The repository 'http://us.archive.ubuntu.com/ubuntu precise-security InRelease' is not signed. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. W: GPG error: http://us.archive.ubuntu.com/ubuntu precise-updates InRelease: The following signatures were invalid: 630239CC130E1A7FD81A27B140976EAF437D05B5 E: The repository 'http://us.archive.ubuntu.com/ubuntu precise-updates InRelease' is not signed. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. W: GPG error: http://us.archive.ubuntu.com/ubuntu precise-backports InRelease: The following signatures were invalid: 630239CC130E1A7FD81A27B140976EAF437D05B5 E: The repository 'http://us.archive.ubuntu.com/ubuntu precise-backports InRelease' is not signed. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. W: GPG error: http://us.archive.ubuntu.com/ubuntu precise Release: The following signatures were invalid: 630239CC130E1A7FD81A27B140976EAF437D05B5 E: The repository 'http://us.archive.ubuntu.com/ubuntu precise Release' is not signed. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details.   I have run some commands to fix another issue after that I don't know which file has been deleted and this update issue occurred. Please help me to solve this problem

I added some extra repositories with the Software Sources program. But when I reload the package database, I get an error like the following:     W: GPG error:  trusty InRelease: The following signatures couldn't be verified because the public key is not available: NO_PUBKEY 8BAF9A6F   I know I can fix it using apt-key in a terminal, according to the official Ubuntu documentation. But I would have liked to do it graphically. Is there a way to do this without using a terminal?


In a couple days, I'll be arriving at Incheon International Airport (ICN) at around 5 AM local time, and departing 6:40PM. Will sleep till 10AM - 11AM, leaving me with 7 hours of free time.  What's the best way to get a taste of South Korean culture and life in these hours? I know there is a high-speed train to Seoul which takes 45 minutes both ways, but I'm not so sure yet of going that far from the airport. Then again, I would like to get out of the airport if possible, to see some of Incheon.  What are the best places and destinations to go during these six hours? Is it wiser to stay inside ICN or should I spend sometime exploring the area on foot/train/bus? This is assuming that I will have a secure place to put luggage. I can also exchange money for Korean Won.

I am flying to Tokyo in November, and I have the choice to go direct (paying extra) or transit via Seoul. Is 6 hours transit time enough to leave Incheon airport for a bit to see something of Seoul? It might make my trip more worthwhile to see something of South Korea too. I don't know much about the busyness of the airport around this time, and travel time between the airport and the city, so that's why I am asking.