I create a list of buttons with this instruction:  $("ul#cards").append("
<button id="modifiedCard" type="button" class="btn btn-primary btn-xs pull-left">Modified</button>
");   Ok, it works. Buttons are generated correctly.   In the same page I wrote:  $("#modifiedCard").click(function () {     alert("Hello!"); });   But, when I click on one of them the alert doesn't start.   I tried with:  <button id="modifiedCard">Try</button>   and the alert starts.  Why?

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.


When closing a question as a dupe, the system generates a comment:     possible duplicate of  --     Can we get a capital P and a period on this comment, please? I find myself editing the comment afterwards for two characters.  I know this is a nitpick, but it's still something that could be fixed.

The comment reads:     possible duplicate of [link]   The missing capitalization bothers me a lot; it should be Possible.


I am using a workflow action "copy item" and "delete item from current list" which copies the files from one document library to another but when the files are copied over to a different library, it removes all the version histories.  I know there is a manual way to move item using "Open With Explorer" which moves files with its version history but we don't want to use that and want something that moves files with its version history automatically...  Any Help Would Be Greatly Appreciated.  Thanks You

Here's the scenario:  2 document libraries Both contain multiple documents The documents have multiple versions  When I copy a document from library A to Library B using the Content and Structure tool from Site Settings, my versions do not carry over. I'm trying to merge the two document libraries into one, but I want to retain the versions. Do you know of a way to complete this without third party tools or custom code? I've heard suggestions of using Explorer View copy and paste, SharePoint Designer and List Templates, but I'm not sure any of those will carry version info. Modern solution For modern SharePoint experiences, use Move To. Update 4/24/2018: There's a new solution in Office 365. You can now select a file or group of files in the modern experience in OneDrive or SharePoint and select Move to. A file or group of files moved this way will retain version history. Update 6/6/2021: As @KJH mentioned in a comment, you may not see the modern experience unless you . Also, there's more detail now in the Microsoft article .


There is a circuit breaker in every home, which trips the switch if there is a fault somewhere in a circuit. And there is a GFCI outlet/switch which also trips if there is a fault downstream. If circuit breaker is there, then why do we need GFCI ? May be dumb question but I am dumb when it comes to electricity.

What purpose does a GFI serve?  Where should they be used?


I work in D8, I create a custom module first_module. By modules create a url and display all nodes by *.html.twig file.  Write code in controller.php  public function contentthree() {    $connection = Database::getConnection();    $query = $connection->select('node', 'n');   $query->fields('n', ['nid', 'type']);    $groups = $query->execute()->fetchAll();    foreach ($groups as $group) {     $events[] = [$group->nid, $group->type];   }    return [     '#theme'  => 'first_module_display',     '#events' => $events,   ]; }   In *.module  function first_module_theme($existing, $type, $theme, $path) {    return [     'first_module_display' => [       'variables' => ['events' => NULL],       'template'  => 'first-module-list',     ],   ]; }  function _get_node_details() {    $output = 'Welcome D8';    $output .= 'Node Details';    return $output; }   and create templates first-module-list.html.twig and display data  {%for key, data in events %}  {%for key1, data1 in data %}     {{ data1 }}  {% endfor %}  {% endfor %}   work fine and showing data correct. But, my question is how to call function _get_node_details() and how to render node details in first-module-list.html.twig files?

Let's say I create a function in a module file:  function _get_test() {   return 'test'; }   How can I call this in any Twig file? For example *.html.twig, page.html.twig, node.html.twig etc.   OR   How can I pass a variable from PHP to Twig and display in any Twig file.  For example *.html.twig, page.html.twig, node.html.twig etc.


I will see you on Monday morning. I will see you Monday morning.   Is the second version idiomatic and grammatically correct? Which version do native speakers prefer to use more?

I am a bit confused. When can we omit the preposition on before weekdays? (Monday, Tuesday etc.) Sometimes I read weekdays without the preposition on. If the preposition is left out, does it work the same way, or does it change the meaning?  Example without the preposition     The UGC issued the public notice Monday after its two previous orders   in this regard were overlooked by the DU.   Example with the preposition     The commission on Monday also issued a public notice against the FYUP   in all leading newspapers for parents and students.


I have only asked ONE question till now which is:    It has received 3 up-votes so I think it wasn't a very low quality question. In comments/answers I wasn't even once told that the question was low-quality. Now when I go to ask another question I get the following message:     You have a history of asking low quality questions. Please put more thought, time, and effort into your questions. To help you do this, the number of questions you may ask per week is currently limited. For more information, visit the Help Center.   I don't even have a history, much less a "history of low-quality questions" and the one that I asked didn't even receive negative votes.   What is the reason I am being barred from asking questions?

If you are reading this, you may have been affected by one of our post quality bans. If so, it is important that you  to understand what has happened and how to regain the permissions that you lost. While trying to ask a question, one could see:  We are no longer accepting questions from this account. See  to learn more.  Likewise, for answers:  We are no longer accepting answers from this account. See  to learn more.   Why am I getting this message? Are deleted posts taken into account too? Is a question/answer ban the same as a suspension? How do I avoid getting a question ban? How long do I have to wait before I can post again? What can I do to release the ban? How can I reactivate my account? Can I simply create a new account? I'll just ask somewhere else on the SE network, and they'll migrate my question to the correct site! Will a ban on one Stack Exchange site affect my standing on other sites in the network? Does this apply to meta sites too? My account is in good standing. Why am I still blocked?


To use the app, users have to increase the brightness of the screen and this causes the battery to run out faster and still the best experience is not perceived.  It is an app that users use daily for 6 hours under sunlight taking meter readings located in the customers' house.  They make a tour in the street visiting around 500 houses.

I am designing the layout for a touchscreen for outside use, What are some good color combination to use that will be visible under the sun light for outside use? Maybe bright neon colors?


"The biggest problem is that Deutsche Bank has too much leverage," noted analysts from Berenberg bank.  Source:

"The strong bond performance has led to a surge in leveraged debt investment positions that are ultimately funded by the banks' interbank exposures and WMPs. But nobody really knows how levered these positions are, who has financed them, and by how much," S&P said. "The contagion risks for the financial sector could be high."  source:


My passport will expire soon, but I have a Nexus Card good for a few more years.  Is it possible when my passport expires that I can use my Nexus card instead to go into the USA?  If so, will there be issues getting back into Canada?

I'm looking to travel into the states for the weekend (I live in Canada). My passport has expired but I have nexus. Can I still use nexus even if my passport has expired?


I have the 10k tools on a site (a private beta, so 1k), and when I got it, the review counter suddenly changed. It went from showing suggested edits to something else much larger.    What does this represent now? Note it isn't all queues together:

Clicking the orange review counter used to take me right to suggested edits. As of sometime in the past couple days, it started showing the total number of waiting reviews (not just edits), and leading to /review.  When was this changed, and why? It's not on


I'm a Linux newbie, I'm doing quite well starting to get my head around it. But I've run into a problem. I don't plan to use the GUI much but here's the problem: My root account password works in terminal mode but when i switch to startx the same password for the same account doesn't work. after entering it, the screen flickers to a black screen then the original screen reappears asking for the password.  Oh and its a Guest on a VMware Hypervisor  Any ideas? Cheers

My Ubuntu is stuck in a login loop when trying to enter my desktop. When I login, the screen gets black and soon after that the login screen comes back.   I've read that the problem might be caused by an error depending on the graphics, here's my graphics card: ATI Radeon 7670M


When Google Chrome asks me to share my location with a website that uses the geolocation feature such as , and I allow it, the website locates me a few kilometers away in the next big town and shows a low accuracy value.  My stationary desktop PC doesn't have GPS or WiFI or GSM, so I guess the information comes from my IP address.  That begs the questions:   Why does the browser even ask for approval to share that information, because my IP is shared with the website anyway? How does it matter whether I click Allow or Deny? How can I tell my browser or the OS a more exact location? Some location services are actually useful, such as when I'm ordering a pizza or search through classified ads.   Things I tried:   Google Chrome -> Developer tools -> Sensors -> Specify exact location (is not kept across browser sessions) Windows -> Settings -> Change default location (doesn't seem to have an effect on Google Chrome's geolocation feature)

Possible Duplicate:          I'm not sure if this question should be asked here or not by here it goes:  In html5 there is a function navigator.geolocation.getCurrentPosition which can locate your position. I've tested this function in IE, chrome, and firefox. While IE doesn't seem to be very accurate, firefox and chrome were able to locate my position with only 10 meters error. Considering that I'm using a laptop, connected to internet though a wimax router via wireless connection, and I'm sure my laptop doesn't have any GPS devices, do you have any ideas how are they finding my location.   I'm sure it's not based on IP since all sites working with IP just give results way off my actual position. and it doesn't seem to be some protocol which browsers use to ask my ISP since IE does not give same results as others.


I would like to change the font size of labels next to points in pgfplots.  As an answer to my  I got the following MWE:  \documentclass{standalone} \usepackage{pgfplots} \pgfplotsset{compat=1.12}  \begin{document}  \begin{tikzpicture}  \begin{axis}[   axis x line=bottom,   axis y line=left,   xmin=0, xmax=2.5,   ymin=0, ymax=2.5,   xtick=\empty,   ytick=\empty,   xlabel=position $x$,   ylabel=time $t$,   ]    \addplot [only marks,mark=*,nodes near coords={\labelz},             visualization depends on={value \thisrowno{2}\as\labelz}]    table[header=false] {    0.5 1 a    1.5 1 f    0.5 2 g    1.5 2 z   };   \end{axis} \end{tikzpicture} \end{document}   This works as expected and gives the following result:   In my real document, the label texts are much longer and don't properly fit in the graph. Now I would like to use a smaller font size for the labels. How can I achieve that?  ----- EDIT -----  The solution suggested in the comment by LaRiFaRi (add the option every node near coord/.append style={font=\tiny} to axis) works, but the result doesn't look very pretty. Here are two screenshots of my graph:  Normal font size:    Tiny font size:    I think the problem is that I use math mode in the label texts.

How can I change the font size of marker labels in a pgfplots scatter plot? I've tried  label style={font=\small} in \pgfplotsset as well as adding scatter/@pre marker code/.code={font=\small}, to no avail.   MWE follows:  \documentclass{article} \usepackage{tikz} \usepackage{pgfplots} \usepackage[active,tightpage]{preview} \PreviewEnvironment{tikzpicture} \begin{document} \begin{tikzpicture}  \begin{axis}[     xlabel=$a$,     ylabel=$b$ ] \addplot[blue,mark=*,mark options={fill=blue},nodes near coords,only marks,    point meta=explicit symbolic] table[meta=label] { x y label 100 150 1 200 180 2 }; \end{axis} \end{tikzpicture} \end{document}    Thanks!


Im stuck on where to go from what I have. My proof so far is "If p|a-b then a is congruent to b mod p. Then by fermat's last theorem then a^p is congruent to a mod p and same for b^p. This leads to a^p - b^ p being congruent to a - b mod p." but i dunno where to go from there or even if what I have is on the right track. I know what p^2 wont necessarily be a prime but it will still be divisible by p.

What I have done is this:  $a\equiv b \pmod{2n}$,  $a=b+c\times2n$, for some $c$,  $a^2=b^2+2b\times c\times2n+c^2\times2^2n^2$,  $a^2-b^2=(b\times c+c^2n)\times4n$, then  $a^2\equiv b^2\pmod{2^2n}$.  I think that this is right: what I DON’T understand is how to generalize this to:  $a\equiv b\pmod{kn}\Rightarrow a^k\equiv b^k \pmod{k^2n}$.  Please give me a hint.


I'm building a calculator in HTML, CSS & Javascript. When a user clicks a number it is added to an Array. Which Array it is added to is determined by three variables which are initially set to false. If the variable is true then that Array has already been used.    The problem I am facing is that my event listener for the operands is failing to change the value of the three variables to true when required to do so.   Initial Variables  var numberArrayOne = []; var numberArrayTwo = []; var numberArrayThree = [];  var operandOne = false; var operandTwo = false;  var operandThree = false;   This is the code that listens for operand clicks.  const operandDivide = document.querySelector('.btnDivide'); operandDivide.addEventListener('click', () => {     switch(false){         case (operandOne):             var operandOne = true;             break;         case (operandTwo):             var operandTwo = true;             break;         case (operandThree):             var operandThree = true;             break;         default:             console.log("Error");          } });   This code chooses which array to place a number into.  const displayFunction = (num) => {     switch(true){         case (!operandOne):             numberArrayOne.push(num);             console.log(numberArrayOne);             break;         case (!operandTwo):             numberArrayTwo.push(num);             console.log(numberArrayTwo);             break;         case (!operandThree):             numberArrayThree.push(num);             break;         default:     } };   Clicking divide button on my calc the value remains false, it should change to true, and I am getting the console.log(error) message I added as the default.

What is the scope of variables in javascript? Do they have the same scope inside as opposed to outside a function? Or does it even matter? Also, where are the variables stored if they are defined globally?


I have an iPod Touch 6th generation.  Can I use a Belkin Boost Charger made for an iPhone/iPad to charge it? It's 18w USB-C and 12w USB-A. My concern is about the wattage, not about the brand.

I'm not sure its the right place to ask but, I just wondered whether I can charge my iPhone Xr with my Samsung adapter. I understand it works and no harm is done to the iphone.  I know that the iPhone transmitting info about voltage and current between the phone and adapter so that the current and voltage wont exceed iPhone limits?


Have been using blender for months now and recently upgraded to the newest version 2.75a. It worked for about 2 days fine but now when i launch it the console flashes and immediately closes and blender doesn't open...  This is incredibly annoying, i have even uninstalled and reinstalled but the same thing happens.  Does anyone have a solution?  Edit: i saw those answers.... none of them work. i dont have a config file at C:\Users\USER_NAME\AppData\Roaming\Blender Foundation\Blender\2.xx\config  so i cant delete startup.blend or userpref.blend

I installed blender on a windows 7 64 bit system.  I opened it one time then went to the tutorials.  in the meantime I had a power failure and when I tried to start blender again I get a dos window that closes itself then nothing.  I reinstalled Blender and get the same thing.  I am going to try to uninstall then reinstall but in the mean time, any other suggestions are welcome.


How to prove that the series $$\sum_{n\geq 2}\log\left(1-\frac{1}{n^2}\right)$$ is convergent? What about finding the sum?  My attempt: $$\ln (1-1/n^2)= \ln(n-1) -2\ln n + \ln(n+1)$$ The term in the log is decreasing so I get the feeling that the series converges but confused how to prove this and also find the sum.


Is it possible to create dummy column while fetching in SOQL Like  select 'Dummy Column Text' as DUMMYCOL from MY_TABLE

Is there an equivalent SOQL syntax to write following SQL?  SELECT Id, 'Northwind Category' AS Note FROM categories


I want to dual boot windows 10 and Ubuntu 18.04 on my Hewlett-Packard Pavilion laptop. Is there an uncomplicated way of doing this?

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


I was reviewing my Topology notes today and came across the proof that "if $(X,\tau)$ is first countable and $A\subset X$ is sequentially closed, then it is closed". I will do a brief recap of (our) proof:  Let $x\in \overline{A}$ and open $U_1\supset U_2\supset \dots$ be a nested local base at $x$. Then $U_n\cap A\neq \emptyset $ for all $n$. So $\textbf{choose}$ $x_n\in U_n\cap A$. Define $f: \mathbb{N}\cup \{\infty\}\to X$ as $f(n)=x_n$ and $f(\infty)=x$. To show $f$ is continuous, let $U\subset X$ be open. If $x\not\in U$, then $f^{-1}(U)\subset\mathbb{N}$ is open and if $x\in U$, then there exists $N$ such that $U_n\subset U$ and therefore, $f^{-1}(U)\supset\{N,N+1, \dots\}$ so it is open in this case as well. We conclude that $x_n\to x$ and thus that $x\in A$.   Now we very clearly invoke (at least a weak version of) the axiom of choice here. As indicated in the title, I am wondering if this result still is true without this assumption?

The following proof is based on Rudin's Principles, chapter 2, exercise 26. I wanted to confirm that the axiom of (countable) choice is used in the line in bold, and was curious to know whether this proof can be modified so that it isn't required, and if not, whether there is an entirely different proof which doesn't require choice.  Let $X$ be a metric space in which every infinite subset has a limit point. By previous exercises, we know that $X$ must have a countable base. So every open cover of $X$ has a countable subcover $\{ G_{n} \}$. Assume that $\{ G_{n} \}$ has no finite subcover. Construct a set $E$, containing one element from each set $F_n = (\bigcup_{i=1}^{n}G_i)^c$. Then $E$ is infinite, since every point in it is in some $G_m$, so won't be in $F_{m}$. But then $E$ must have a limit point $y$, which is in contradiction with the fact that $y$ must be in some $G_n$, which is open. Thus $\{ G_{n} \}$ must have a finite subcover.


I have Ubuntu 10.XX in my PC and would like to upgrade it to a 18.xx version. Is there a way I can do this in place or I have to install Ubuntu from scratch again?

Recently I have installed an older version of Ubuntu on my old machine. Whenever I try to install any software, I get an error saying it couldn't be found:  $ sudo apt-get install vlc Reading package lists... Done                Building dependency tree        Reading state information... Done     E: Couldn't find package vlc


I'm just looking for a simple reminder when it comes to aperture, such as: when there's a lot of light in the atmosphere where a photo is exposed, the aperture should be low, or something. The more light, the lower the aperture - something like that, but in the correct sense because I'm still not sure about it.

What is the exposure triangle? How do the "sides" affect my photographs?


So my question told me to find the $E[Y]$ and $V[Y]$ first and then find the PGF of $Y$ and state its distribution. Am I supposed to use the information from $E[Y]$ and $E[X]$ to derive the PGF or are they unrelated, because I am having trouble finding the PGF of $Y$.  Let $ X \sim exp(1) $ and $Y  |X = x \sim Pn(x)$  From: $$E[E[Y|X=x]] = E[Y]$$ $$ E[X] = E[Y] $$ Since: $$E[X] = 1 $$ So I found that: $$E[Y] = E[X] = 1$$ and: $$V[Y] = E[V[Y|X]] +V[E[Y|X]]$$ $$V[Y] = E[X] + E[Y] = 2$$  And this is where I am stuck I don't know how to find the PGF of $Y$

I have an exercise where X has an exponential distribution with rate 1, and Y|X=x is a poisson distribution with parameter x.   I can find the expectation and variance of Y using the law of total expectation and law of total variance - and I have gotten 1 and 2 respectively - I'm fairly sure this is correct.  Now I am trying to find the probability generating function of Y, but I'm struggling. I think I need to use the law of total expectation to help me here, but I'm not too sure how.   Any help is appreciated.


I've already disabled the ads in the contact list, but in the chat window, there are still ads popping up overhead.  These are from Google Ad Choices and there is no way to close them.  I can't get the ad to close like you can for the ones in the contact list. There's no little X you can push, no options that let me opt out of getting them that I have found.   This is really starting to get on my nerves. Nothing I've tried so far has gotten rid of this thing.

The Skype client shows a disturbing colored ad at the bottom of the client. The ad is unnecessary and only takes away important space for the contact list.  How can I remove that permanentely?    Even after clicking the close sign on the ad, the ad appears again each time I open/click Skype again...


I try to proof that Finite union of closed set is closed. Using this definition of closed set: Closed set it is a set wich contain all its limit points. So i strart from this: We have $E_{1},...., E_{n}$ - closed set. Lets see set $$E = \bigcup_{i} E_{i}$$ let $p \in E_{i}$ is  arbitary limit point. Then we know what exists neighborhood of $p$ which contains at least one point of the set different from p. Because we have union then $p\in E$ and p is limit point for $E$ Next thing, I don't quite know what to do.

Let $X$ be a metric space.  If $F_i \subset X$ is closed for $1 \leq i \leq n$, prove that $\bigcup_{i=1}^n F_i$ is also closed.  I'm looking for a direct proof of this theorem.  (I already know a proof which first shows that a finite intersection of open sets is also open, and then applies De Morgan's law and the theorem "the complement of an open set is closed.")  Note that the theorem is not necessarily true for an infinite collection of closed $\{F_\alpha\}$.  Here are the definitions I'm using:  Let $X$ be a metric space with distance function $d(p, q)$.  For any $p \in X$, the neighborhood $N_r(p)$ is the set $\{x \in X \,|\, d(p, x) < r\}$.  Any $p \in X$ is a limit point of $E$ if $\forall r > 0$, $N_r(p) \cap E \neq \{p\}$ and $\neq \emptyset$.  Any subset $E$ of $X$ is closed if it contains all of its limit points.


All the horcruxes are as follows:   Tom Riddle's Diary Marvolo Gaunt's Ring Salazar Slytherin's Locket Helga Hufflepuff's Cup Rowena Ravenclaw's Diadem Nagini Harry Potter   My question is though why there aren't more horcruxes? 8 to be exact. When we see Slughorn's memory, we see that Voldemort was planning on not making 1, but 7 horcruxes. However, he only made 6, and Harry was an unintended horcrux making 7.   What happened here? We even know that Voldemort wanted 7 because it was the most magically powerful number, so it would stand to reason he makes 7 horcruxes, then Harry is an unintended 8th.

Since the magical number is seven for Horcruxes, and Voldemort made Harry unintentionally then  there must be an eighth right...???   Diary Ring Cup Locket Diadem Nagini Harry (Does not count because Voldemort did not know that Harry was a Horcrux) ??????


I made this program, it deals with classes and relationships, when I run this, it gives me the error "Exception in thread "main" java.lang.NullPointerException", my IDE doesn't detect any error in the coding, can anyone help me out, this is very annoying.  import java.util.Vector; class Flight {     private String id;     private String destination;     private Time depart;     private Time arrival;     private Vector passengerList;     public Flight(String a, String b, Time c, Time d) {         id = a;         destination = b;         depart = c;         arrival = d;     }     public void addPassenger(Passenger a) {         passengerList.add(a);     }     public void printInfo() {         System.out.println("Id " + id);         System.out.println("Destination " + destination);         System.out.println("Depart " + depart.getHour() + " " + depart.getMinute());         System.out.println("Arrival " + arrival.getHour() + " " + arrival.getMinute());         System.out.println("Number of passengers " + passengerList.size());     } } class Time {     private int hour;     private int minute;     public Time(int a, int b) {         hour = a;         minute = b;     }     public int getHour() {         return hour;     }     public int getMinute() {         return minute;     } } class Passenger {     private String name;     private int age;     public Passenger(String a, int b) {         name = a;         age = b;     } } class FlightTester {     public static void main(String[] args) {         Time dep = new Time(8, 10);         Time arr = new Time(9, 00);         Flight f = new Flight("PK-303", "Lahore", dep, arr);         Passenger psg1 = new Passenger("Umair", 30);         Passenger psg2 = new Passenger("Manzoor", 44);         f.addPassenger(psg1);         f.addPassenger(psg2);         f.printInfo();     } }

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


I am self-studying Linear Algebra by Hoffman & Kunze.   Exercise 6 in Section 1.2: "Prove that if two homogenous systems of linear equations in two unknowns have the same solutions, then they are equivalent."   I am trying to solve this problem by induction (see the first bullet point below).  I am hoping to solve this problem using only the information provided in the book thus far. In this text, two systems are equivalent if each equation in one system can be written as a linear combination of equations in the other system. So far the text has defined the following phrases: solution of a linear system of equations, equivalent systems, and homogenous system of equations. It has not yet covered linear dependence.  Some notes on previously asked questions:    seems to be asking the same thing, and while the OP was able to solve it with the hints given in the comments, they did not post the solution. I am trying to solve this problem by induction on the number of equations in one of the systems of equations, as suggested in the comments of that post. My trouble arises when attempting to invoke the inductive hypothesis (IH). Starting with $N+1$ equations, I cannot simply add two equations together to obtain an equivalent system of $N$ equations in order to invoke the IH. The new system of $N$ equations may have solutions that the system with $N+1$ did not.  asks the same question, but the answer uses material and intuition not yet covered by the text at this point.  I have found this question answered on , but with a different approach.

I've just begun to work learn Linear Algebra on my own through Hoffman and Kunze's book and the first problem set already has a question that I can't solve:  Prove that if two homogeneous systems of linear equations in two unknowns have the same solutions, then they are equivalent.  I can't seem to figure out how to prove this without resorting to case work where you account for the cases where one of the coefficients are zero and when both are.  Is there an elegant way to prove in general that when two systems of linear equations have the same solutions, they are equivalent? The converse is obvious enough though.  Definition of equivalence from the text :     Let us say that two systems of linear equations are equivalent if each equation in each system is a linear combination of the equations   in the other system.


I looked for a phoenix in the Monster Manual, but I can't seem to find anything. I want to see if I can use one in my adventure, but I couldn't find a phoenix anywhere. Are there phoenixes in D&D 5E?

In the , the sorcerous origin "Phoenix Sorcery" is introduced. I didn't find an entry for the phoenix in the Monster Manual or Volo's Guide; I heard there is a mention of that creature in the DMG, but couldn't find it. So, where is this creature mentioned exactly? (To be clear: I know what a phoenix, as a fabled creature, is, I just am not sure what a phoenix is in D&D 5e).


This is part of a bash script code I wish to use multi-threading  for DATABASE in $DATABASES ; do     echo Converting $DATABASE     # Check if the table is MyISAM (we don't want to convert InnoDB tables over and over again)     TABLES=$(echo "SELECT TABLE_NAME FROM information_schema.TABLES where TABLE_SCHEMA = '$DATABASE' and ENGINE = 'MyISAM'" | $MYSQL_COMMAND)     for TABLE in $TABLES ; do         echo Converting MyISAM $TABLE to InnoDB         echo "ALTER TABLE $TABLE ENGINE = INNODB" | $MYSQL_COMMAND $DATABASE     done     if [ "x$TABLES" = "x" ] ; then         echo No MyISAM tables found in $DATABASE database     fi     echo done   Is it possible for FOR to use multi-threading?  I was thinking about rewriting the script and doing it with xargs -P3 -n1 -I{} and so on, but it looks dirty to me.

I have been trying to parallelize the following script, specifically each of the three FOR loop instances, using GNU Parallel but haven't been able to. The 4 commands contained within the FOR loop run in series, each loop taking around 10 minutes.   #!/bin/bash  kar='KAR5' runList='run2 run3 run4' mkdir normFunc for run in $runList do    fsl5.0-flirt -in $kar"deformed.nii.gz" -ref normtemp.nii.gz -omat $run".norm1.mat" -bins 256 -cost corratio -searchrx -90 90 -searchry -90 90 -searchrz -90 90 -dof 12    fsl5.0-flirt -in $run".poststats.nii.gz" -ref $kar"deformed.nii.gz" -omat $run".norm2.mat" -bins 256 -cost corratio -searchrx -90 90 -searchry -90 90 -searchrz -90 90 -dof 12    fsl5.0-convert_xfm -concat $run".norm1.mat" -omat $run".norm.mat" $run".norm2.mat"   fsl5.0-flirt -in $run".poststats.nii.gz" -ref normtemp.nii.gz -out $PWD/normFunc/$run".norm.nii.gz" -applyxfm -init $run".norm.mat" -interp trilinear    rm -f *.mat done


Is it anyway possible to create a SQL Job for monitoring blocking on SQL Instance, if the blocking are still happening after some interval of time?  We are using SCOM Monitoring tool to monitor events from the event viewer and generated alert on the basis of this that. Kindly guide as to what can I do generate an event in case of blocking persists for more than a minute.  I tried enabling the blocking process threshold and created blocking, but I see no event either in event viewer or in SQL Error Logs. We are using Sql Server 2008 R2 Enterprise.  Thanks in advance.

About once a week I have to resolve a blocking chain on a SQL Server 2005 database, caused by a long-lived read lock from an Access 2003 front-end. The lock is taken out whenever a user opens a certain form and is released once the user has finished scrolling through the form or closes it. Since many of our users open this form as reference, these locks stay around for a while. Any update to the table causes the blocking, and suddenly nobody can select from this table since they're all waiting on the first lock. This is quite a problem for us, since lots of apps rely on this data. I understand that this locking behavior is part of how Access works with linked tables.  I've been solving the problem from Activity Monitor,  whenever I find out about it. This is a problem not only because it takes me time to do it manually, but also because it's reactive. By the time I hear about it, it's already been a problem for a lot of people.  I'd like to know if there is an automatic way to check for these long-lasting blocking chains, and either be emailed or have the problem resolved automatically. The logic seems straightforward enough ("if any process matching this SELECT query has been blocking for longer than a minute, notify me/kill it") but I don't know how to implement this with SQL Server.  For what it's worth, I think the proper solution is to fix or rewrite the app. However, due to departmental politics, this is not an option for the next few months, so I'm looking for a stopgap.


Given $A\in M_{n \times n}(\mathbb{F})$ and $p_{A}(x)=\det(xI-A)$ why saying that $\det(AI-A)=0$ is not valid?

Cayley Hamilton Theorem states that if $A$ is an $n \times n$ matrix over the field $F$ then $p(A) = 0$.  We note that $p(\lambda) = \det(\lambda I - A)$. Hence, why can't we just substitute $\lambda$ with $A$ and directly prove Cayley-Hamilton Theorem by saying that $p(A) = p(\lambda) = \det(\lambda I - A) = \det(AI - A) = 0$?


So here's the problem - I have 3 COC accounts on 3 devices (iPhone 4 and 2 iPads). All use different Apple IDs. My main base is on the iPhone and it always said welcome back 'username' - which I assumed meant it was linked to that Game Center account. So I was out the other day and our clan was warring - I logged out of my account and signed in on one of my other accounts (Note: I have never done this before but I figured it'd be alright since all three were under different Apple IDs and linked to their respective game centers). Once I signed out of the second account and logged back in under my main account, it did not give me the option to load my main base back in. Even though it still shows my Game Center as my main account, it loads the base from the other accounts. I am lost! I've spent 2 years on my main account and it is a high level TH10. Can anyone give me guidance on how to fix this?

I unintentionally and stupidly wiped my Clash of Clans game data. I went to Application Manager on my Android and clicked 'Clear data'. (I used this for fixes before and it never started a new game.)   Now, my level 60 or so base has been wiped as if was to start a new game. Have I doomed myself to starting again or is there a way in which I can retrieve my old game save? Maybe by contacting Supercell? I have a snapshot of my base.


All major English dictionaries say that consesnsus is uncountable, but right under this warning they provide example sentences like the following:"We reached a consesnsus." How come?

"Mornings came and cast a blinding sunlight over everything, and he felt like nothing worthwhile could be accomplished."  For some reason, I feel like "a blinding light" is ok, but if its sunlight, then I should drop the "a" and write "cast blinding sunlight", but I'm not sure why I feel this way.   Can anyone offer some enlightenment?  edit - alternate phrasing, closer to being a literal translation: "Mornings came without warning, flooding the day with a strong sun, and he felt like nothing worthwhile could be accomplished."   I would still like an answer to the technical question of whether I should drop the "a", but would also appreciate knowing if anyone thinks option #2 is a better choice.


I want to upgrade to 14.04 from 13.10. The software Updater shows that 14.04 is available.     But when I click on the "Upgrade" button, nothing happens. The software updater exits on clicking Upgrade.

Recently I have installed an older version of Ubuntu on my old machine. Whenever I try to install any software, I get an error saying it couldn't be found:  $ sudo apt-get install vlc Reading package lists... Done                Building dependency tree        Reading state information... Done     E: Couldn't find package vlc


On my rooted Nexus 5, when I open any file manager the sdcard shows empty. Some apps however are able to read from it and I can see it is intact when I connect it to my PC. This means I can't access the files on my sdcard (virtual sdcard in the case of N5) and also evernote fails to sync as it can't create a database.   I have tried chmod777 on the sdcard through recovery to try to set permissions right which failed. Restarting the device also fails. Clearing the dalvic cache also fails.   Any help would be appreciated!

Yesterday I upgraded my Samsung Galaxy S4 to Android 4.4 KitKat and had the bad surprise that it cannot write to my SD card anymore... I know this problem is widely documented everywhere, but has any workaround been found for it yet? (Other than removing the card physically from the phone and opening it on my PC) Also, because of the KNOX flag I can't downgrade to 4.3...  (PS: Rooted or not, it makes no difference)


In Ubuntu and derivatives (specifically Linux Mint 17.2), is there a setting in a config file somewhere to run "fsck -y" on boot?  I lost power, and the computer successfully rebooted, but I just want to run fsck to take care of any potential issues before they actually cause trouble.

How to check my two disks at startup (they're in BIOS RAID 1)?  I am on Linux Mint 17.2.  computer user # blkid /dev/sda1: UUID="6042-870C" TYPE="vfat"  /dev/sda2: UUID="2ef42e6f-4987-46e5-aca9-872fd70a9f9e" TYPE="ext2"  /dev/sda3: UUID="Oz0elc-zUuh-BAK1-i19b-RZZU-YREm-DxVaNi" TYPE="LVM2_member"  /dev/sdb1: UUID="6042-870C" TYPE="vfat"  /dev/sdb2: UUID="2ef42e6f-4987-46e5-aca9-872fd70a9f9e" TYPE="ext2"  /dev/sdb3: UUID="Oz0elc-zUuh-BAK1-i19b-RZZU-YREm-DxVaNi" TYPE="LVM2_member"  /dev/mapper/mint--vg-root: UUID="98a7a4a2-6e71-4aa9-ab48-5c4fc619c321" TYPE="ext4"  /dev/mapper/mint--vg-swap_1: UUID="b62721cf-7b54-4400-92f0-f8f776566c99" TYPE="swap"


An application I'm working has unexpectedly deleted some data files from a folder.   Is it possible in windows 7 to pull up some kind of log for that folder, to see when the files were deleted, and what command deleted them?

Is there any logging mechanism in Windows XP to know whether a user has done a specific file operation (create/modify/delete)?


Let MAN be the category of differentiable manifolds with smooth maps as morphisms. Let LRS be the category of locally ringed spaces. Now I know that there exists a functor $\textbf{MAN}\to\textbf{LRS}$ that associates $$   M\mapsto(M, C^\infty) $$  where $ C^\infty$ is the sheaf of smooth functions  on $M$. My question is whether this functor is fully faithfull, that is, given a morphism of locally ringed spaces  $$   (M, C^\infty)\to(N, C^\infty) $$ then is the associated function $M\to N$ smooth? I know that we will have to use that the induced map at stalks is local at some point, but I can't see how.

Let $X$ be a differentiable manifold. Let $\mathcal{O}_X$ be the sheaf of $\mathcal{C}^\infty$ functions on $X$. Since every stalk of $\mathcal{O}_X$ is a local ring, $(X, \mathcal{O}_X)$ is a locally ringed space. Let $Y$ be another differentiable manifold. Let $f\colon X \rightarrow Y$ be a differentiable map. Let $U$ be an open subset of $Y$. For $h \in \Gamma(\mathcal{O}_Y, U)$, $h\circ f \in \Gamma(\mathcal{O}_X, f^{-1}(U))$. Hence we get an $\mathbb{R}$-morphism $\Gamma(\mathcal{O}_Y, U) \rightarrow \Gamma(\mathcal{O}_X, f^{-1}(U))$ of $\mathbb{R}$-algebras. Hence we get a morphism $f^{\#} \colon \mathcal{O}_Y \rightarrow f_*(\mathcal{O}_X)$ of sheaves of $\mathbb{R}$-algebras. It is easy to see that $(f, f^{\#})$ is a morphism of locally ringed spaces.  Conversely suppose $(f, \psi)\colon X \rightarrow Y$ is a morphism of locally ringed spaces, where $X$ and $Y$ are differentiable manifolds and $\psi\colon \mathcal{O}_Y \rightarrow f_*(\mathcal{O}_X)$is a morphism of sheaves of $\mathbb{R}$-algebras. Is $f$ a differentiable map and $\psi = f^{\#}$?


Since I was first learned English, I know that any number greater than 1 comes with s for plural (except for some exceptions like Mice and Feet). 6 Cars, 2 Trees, 3 Dogs, 9 Years  So if someone ask me how old are you I will say 6 years old  but when I read a report in news website I find they say a 6 year old boy (not years)  so when to remove the plural s?

1) a ten years old boy is sitting on the couch.      2) a ten year old boy is sitting on the couch.      3) a ten-years old boy is sitting on the couch.      4) a ten-year old boy is sitting on the couch.   Which is correct?


I’ve got a large design format to print. The original image resolution is about 3000 px - 4500 px & resolution is 300. I worry if we blow up the image to the truck size 590 x 200 CM, the resolution will be terrible. What is the correct resolution for thé truck size i mentioned? How can I find a high res image to suite that size.

For wall-sized graphics and large banners (e.g. 3m × 5m), what is an acceptable PPI for print? As I understand it 300 ppi is the typical for 'small' artworks (esp. for clean text resolution). However, for small artworks, the audience usually engages at a much closer distance. Therefore, in the interests of keeping a bitmap file down to a reasonable size, can you get away with a much-reduced PPI for a large format/banner print?


EDIT: This is actually a question on leetcode. So the benchmarking is performed by leetcode.  Somewhere in my program, I have to sort a list of Map.Entry<Character, Integer>. Originally, I used the traditional way to override the Comparator for the sort. Then, I also tried another approach with lambda expression.  However, the performance with the use of lambda expression is way worse than the original approach (4x ms vs 1x ms). All the codes in the two program are the same. The only difference is this one line.  Original Code:  list.sort(new Comparator<Map.Entry<Character,Integer>>()    {      @Override      public int compare(Map.Entry<Character,Integer> o1, Map.Entry<Character,Integer> o2) {        return o2.getValue().compareTo(o1.getValue());   } });   New Code:  list.sort((o1, o2) -> o2.getValue().compareTo(o1.getValue()));

How do you write (and run) a correct micro-benchmark in Java?  I'm looking for some code samples and comments illustrating various things to think about.  Example: Should the benchmark measure time/iteration or iterations/time, and why?  Related:


I want to do a few experiments on the btrfs file system, but I don't want to make any changes to my existing partitions, and I want full control over things like device size.  Is it possible to create a file that looks like a block device that I can mount and unmount, and that will act like a block device such as running out of space?

I am trying to perform a recovery operation on a btrfs image file that I have extracted using  # dd if=/dev/sda1 of=/mnt/sda1.img   The file seems to be properly extracted:  $ file sda1.img  sda1.img: DOS/MBR boot sector   Reading it with parted is a bit opaque though  $ sudo parted sda1.img GNU Parted 3.2 Using /run/media/robert/exthdd2/sda1.img Welcome to GNU Parted! Type 'help' to view a list of commands. (parted) p                                                                 Model:  (file) Disk /run/media/robert/exthdd2/sda1.img: 240GB Sector size (logical/physical): 512B/512B Partition Table: msdos Disk Flags:   Number  Start  End  Size  Type  File system  Flags   Trying to mount it results in an errors  $ sudo mount -o loop -t btrfs sda1.img /mnt/ mount: mount /dev/loop0 on /mnt failed: Operation not supported   However, I can run a btrfs check on the image file, so it's not broken ...  What can I do to mount such an image file?


Is there a bijection solution $\eta:\mathbb{R}\times \mathbb{R}\rightarrow \mathbb{R}$ (with an explicit formula, if it is possible)  for the inequality $$\min\{x,y\}\leq \eta(x,y)\leq \max\{x,y\}\;\; ; \;\; x\neq y?$$

Is there any bijection $\eta:\mathbb{R}\times \mathbb{R}\rightarrow \mathbb{R}$  with the property $\min\{x,y\}\leq \eta(x,y)\leq \max\{x,y\}$?


Let $k$ be a field which is not algebraically closed and $n>1$ be an integer . Then does there exist $f\in k[X_1,...,X_n]$ such that $Z(f) (:=\{(a_1,...,a_n)\in k^n : f(a_1,...,a_n)=0\}) =\{0\}$ ?  My Work : I was thinking like this : Considering $k$ as a sub-field of its algebraic closure $\bar k$, we have $k \subsetneq \bar k$ . Also, there is an irreducible polynomial $g(X) \in k[X]$ such that deg $g(X)>1$ . May be we could somehow apply Hilbert Nullstelensatz to $\bar k$, but I am not sure .   I can easily do it for a finite field $k$; in that case just take  $f(X_1,...,X_n)=\sum_{(y_1,...,y_n)\in k^n \setminus \{0\} } \prod_{i=1}^n (1-(X_i-y_i)^{q-1})$ , where $|k|=q$ .  I can also do it if $[\bar k : k] $ is finite and $n=2$ . By Artin-Schreier theorem () , we will have $[\bar k : k]=2$ . Let $u\in \bar k \setminus k$, then the minimal polynomial of $u$ over $k$ has degree 2, and let $\bar u$ be another root of the minimal polynomial of $u$ over $k$ . Then $f(X_1,X_2)=(X_1+uX_2)(X_1+\bar u X_2)$ satisfies our required condition . Even in this case when $\bar k$ is a finite extension over $k$, I don't know what happens if $n>2$ .  Please help . Thanks in advance

I am trying to prove the following statement.     If a field $K$ is not algebraically closed, then any $K$-variety $V\subset\mathbb{A}^n$ can be written as the zero set of a single polynomial in $K[X_1,X_2,...,X_n].$     Suppose $V=V(f_1,f_2,...,f_n)$, and I would want to find a polynomial $g\in K[X_1,X_2,...,X_n]$ such that $V=V(g)$.  I know that if I can find a polynomial $\phi\in K[X_1,X_2,...,X_n]$ whose only zero is $(0,0,...,0)$, then it is done, since we could take $g=\phi(f_1,f_2,...,f_n)$.  For $n=1$, then I would just choose $\phi=X$, but I do not even know how to proceed to the case $n=2$. Maybe we could choose an irreducible polynomial of degree $>1$.  Any help will be appreciated.


I am trying to upgrade Windows 7 Pro 64bit in my dell vostro 3460 to Windows 10, however when the instalation procedure is reboots the machine for the first time, it loads Windows 7 again and the setup program gives me the message     The installation failed in the SAFE_OS phase with an error during BOOT operation   and the error codes 0xC1900101 - 0x20017. I have searched the internet for solutions, like updating drivers on the dell website, but nothing works. I do not have an encrypted HDD or similar. I have also tried with a minimal boot and disabling all unnecessary devices in the BIOS (like USB devices and card readers, everything !!). Nothing works.   The only thing different is that i have a dual boot system, Windows 7 and Kubuntu, using Grub as boot loader, but according to the internet, that should not be a problem.  Any ideas on what else can i try to do to get the upgrade going?  UPDATE: This question is not answered by the suggested question in the duplicated tag. The problem was not other that GRUB. Windows 10 installation seems to have problems with grub being the boot loader. I used Windows recovery mode to uninstall grub from the MBR and reinstall Windows 7 boot loader and once i did that, Windows 10 installed flawlessly.

For days I tried several ways to install Windows 10 . With Windows Update I have always an error and with the media creation tool microsoft I have this message: " The installation failed in SAFE_OS phase with an error when BOOT operator " with this code : 0xC1900101 - 0x20017 Having tried everything I do not know what to do ... Can you help me please ? Thank you  PS: I migrated my OS with the software "Paragon migrate OS to SSD" from my hard disk to my SSD. Maybe I have this errors because I did this....


I came across this block of code when studying for my class. It was in my professor's presentation and I thought it was an error, so out of pure curiosity, I tried to compile it. To my surprise, it's actually a valid code. I tried looking it up online but couldn't find a clear answer as to why exactly does it work.  int n, num; scanf("%d", &n); vector<int> arr; arr.reserve(n);  while (n--)         scanf("%d", &num),         arr.push_back(num);  for (int i : arr) printf("%d ", i); printf("\n");   I expected the while-loop to cause a compilation error, but it runs smoothly. Is it standard or was that introduced recently?

How does the comma operator work in C++?  For instance, if I do:  a = b, c;     Does a end up equaling b or c?   (Yes, I know this is easy to test - just documenting on here for someone to find the answer quickly.)  Update:  This question has exposed a nuance when using the comma operator.  Just to document this:  a = b, c;    // a is set to the value of b!  a = (b, c);  // a is set to the value of c!   This question was actually inspired by a typo in code.  What was intended to be  a = b; c = d;   Turned into  a = b,    //  <-  Note comma typo! c = d;


Looking to prove  $ f(x) = e^x =f'(x) $ using the limit definition of the derivative. So far I have gotten to here:  $e^x * \lim\limits_{h \to 0} \frac{e^h-1}{h}$  Any hints on what I can do next to get that entire limit to $1$?  I can't use l'hopital's rule, otherwise that'd defeat the purpose.

I was wondering how we could use the limit definition   $$ \lim_{h \rightarrow 0} \frac{f(x+h)-f(x)}{h}$$  to find the derivative of $e^x$, I get to a point where I do not know how to simplify the indeterminate $\frac{0}{0}$. Below is what I have already done  $$\begin{align} &\lim_{h \rightarrow 0} \frac{f(x+h)-f(x)}{h} \\ &\lim_{h \rightarrow 0} \frac{e^{x+h}-e^x}{h} \\ &\lim_{h \rightarrow 0} \frac{e^x (e^h-1)}{h} \\ &e^x \cdot \lim_{h \rightarrow 0} \frac{e^h-1}{h} \end{align}$$  Where can I go from here? Because, the $\lim$ portion reduces to indeterminate when $0$ is subbed into $h$.


I develop an application in which I constantly get samples of heart pulse.  I defined an interval of $t$ seconds.  In each $t$ seconds I have $n$ samples.  In every interval, I want to calculate the tendency of those $n$ samples. For example, lets say I have $n = 5$, and I have samples with values $\{70, 88, 95, 103, 115\}$. I want to recognize I have a growth in the heart pulse, and I want to have some measure for the rate of grows/decrease/almost no change.  I thought on two approaches for solving this problem.   I calculate the linear approximation for the $n$ samples using linear regression by applying least squares implemented by the normal equations. (I treat each sample as two coordinates vector with $x$ coordinate as time and $y$ coordinate as heart pulse). I get from the normal equations a linear function of the form $y = mx+b$ and my measure for the tendency is the slope, i.e. the $m$ value. The second approach is to calculate the correlation (pearson's correlation) between vector $x$ and vector $y$ when $x$ is the time and $y$ is the heart pulse.   I'm asking which approach do you think is better for my problem (determining the tendency of heart pulses). Or, do you have a better algorithm for solving this problem?

I develop an application in which i constantly get samples of heart pulse.  I defined an interval of t seconds.  In each t seconds I have n samples.  In every interval, I want to calculate the tendency of those n samples. For example, lets say I have n = 5, and I have samples with values {70, 88, 95, 103, 115}. I want to recognize I have a growth in the heart pulse, and I want to have some measure for the rate of grows/decrease/almost no change.  I thought on two approaches for solving this problem.   I calculate the linear approximation for the n samples using linear regression by applying least squares implemented by the normal equations. (I treat each sample as two coordinates vector with x coordinate as time and y coordinate as heart pulse). I get from the normal equations a linear function of the form y = mx+b and my measure for the tendency is the slope, i.e. the m value. The second approach is to calculate the correlation (pearson's correlation) between vector x and vector y when x is the time and y is the heart pulse.   I'm asking which approach do you think is better for my problem (determining the tendency of heart pulses). Or, do you have a better algorithm for solving this problem?


Part A. a company is holding a dinner for working mothers with at   least on son. Ms. Smith, a moher of two children is invited. What is   the probability that both children are boys?   ANS：P(both boys | at least 1 boy ) = 1/3     Part B. Your new colleague Ms. Parker also have two children. You see   her walking with one of her children and that child is a boy. What is   the probability that both of them are boys?   ANS: P(both boys | one boy ) = 0.5  I don't understand Part B. If you know one of her children is a boy, does this implies that Ms. Parker has $\geq1$ boy? In mathematical terms, this means that Ms.Parker has at least one boy, true? How come it is different from Part A. Confuse!

I know this question is asked over and over, but I still can't understand anything.  Say I'm introduced to a random father of two and I want to know what's the probability that both his children are boys. Currently:   BB BG GB GG ⇢ 1/4   Where the first letter represents the younger sibling and the second letter represents the older sibling. So far so good.  (1) Now the father tells me that his youngest child is boy:   BB BG GB GG ⇢ 1/2   (2) If, instead, he told me that at least one of his children is a boy:   BB BG GB GG ⇢ 1/3   Makes sense, kind of.  (3) But if the father brought one of his children with him without telling whether he's the younger child or the older child and that child happened to be a boy, I think I could have still honestly arrived to the 50/50 probability:   BB BG GB GG ⇢ 1/2   Where the first letter represents the boy I've just seen and the second letter represents his sibling.  Now, say, the father first told me that he has at least 1 boy. That's the case (2).  Then the father called (one of) the boy(s) here, and somehow the situation turned into the case (3)!  What exactly has changed? What kind of new information did I just get? OK, I've seen (one of) the boy(s), but the only thing it tells me is that one of the children is a boy, which I already knew from the father's own words.  It seems to me that anything he could bring that has some kind of relationship to (one of) the boy(s) so as to allow me to uniquely identify him would work: a photo, a footprint on a beach, etc. Even if he simply told me that he has just thought about one of his children who is a boy, I think I could still have done this:   BB BG GB GG ⇢ 1/2   Where the first letter represents the boy the father has thought about at XX/XX/XXXX XX:XX:XX UTC, and the second letter represents his other child.  Is this magic? Or am I just stupid?  Can't I simply construct such a way of identification myself? For example, let the first letter represent the youngest boy (the only boy if there's just one), and let the other letter represent the other child. Since the father is not an abstract entity, this would uniquely identify some child.    I don't see how changing the representation changes things.  Say I saw one of the father's on a photo behind a thick blurry glass that doesn't let me see whether it's a girl or a boy. Therefore:   BB BG GB GG ⇢ 1/4   Where the first letter represents the child on the photo and the second letter represents the other child.  Now the glass is removed and I can see the photo clearly and it's indeed a boy:   BB BG GB GG ⇢ 1/2


'The antler dance', 'locking horns', 'butting heads': I don't think these are exactly the right way to describe what I'm thinking of.   What is it called when two men, both fairly dominant in their everyday lives, meet for the first time, maybe at a social event, maybe accompanied by their wives, and the men have a session of questioning and boasting to see which of them has higher status?   It's fairly subtle; nobody's raising his voice, losing his temper or swinging punches. Their wives probably notice what's going on (and 'hear the testosterone bubbling', as they say). The men may not even realize they're engaged in some sort of challenge or duel, and it may not stop the men becoming friends afterwards.  What's the right phrase for this?

Similar to pissing contest - but not in an aggressive manner. Just each guy attempting to out talk one another to show they are the leader / in charge.   Sample sentence:     Well, that meeting was more of a X than being productive with Greg trying to show he was in control.


In my apps I want to pass some string data from one class to another class using intent class .I use the Following putExtra to send data to another class named BusDetail .          @Override         public boolean onChildClick(ExpandableListView parent, View v, int groupPosition, int childPosition, long id)         {              if(groupPosition==0)             {                 if(childPosition == 0)                 {                     Intent child0Intent = new Intent(getBaseContext(), BusDetail.class);                     child0Intent.putExtra("ROOT",root_name[0]);                     startActivity(child0Intent);                 }              }              if(groupPosition==1)             {                 if(childPosition == 0)                 {                     Intent child0Intent = new Intent(getBaseContext(), BusDetail.class);                     child0Intent.putExtra("ROOT",root_name[0]);                     startActivity(child0Intent);                 }              }             return false;         }     }); }   The following is BusDetail class where I use getStringExtra to collect data from the above class . But my app crashes when I go to above class to following class    final Intent intent=getIntent(); //passedArg=in  final String id = intent.getStringExtra("ROOT");   Without using putExtra and getStringExtra, my app works .   this is my logcat  01-19 15:22:23.078  22686-22686/com.example.kuet.traveldirectory E/AndroidRuntime﹕ FATAL EXCEPTION: main Process: com.example.kuet.traveldirectory, PID: 22686 java.lang.RuntimeException: Unable to instantiate activity ComponentInfo{com.example.kuet.traveldirectory/com.example.kuet.traveldirectory.BusDetail}: java.lang.NullPointerException: Attempt to invoke virtual method 'android.os.Bundle android.content.Intent.getExtras()' on a null object reference         at android.app.ActivityThread.performLaunchActivity(ActivityThread.java:2236)         at android.app.ActivityThread.handleLaunchActivity(ActivityThread.java:2390)         at android.app.ActivityThread.access$800(ActivityThread.java:151)         at android.app.ActivityThread$H.handleMessage(ActivityThread.java:1303)         at android.os.Handler.dispatchMessage(Handler.java:102)         at android.os.Looper.loop(Looper.java:135)         at android.app.ActivityThread.main(ActivityThread.java:5257)         at java.lang.reflect.Method.invoke(Native Method)         at java.lang.reflect.Method.invoke(Method.java:372)         at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:903)         at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:698)  Caused by: java.lang.NullPointerException: Attempt to invoke virtual method 'android.os.Bundle android.content.Intent.getExtras()' on a null object reference         at com.example.kuet.traveldirectory.BusDetail.<init>(BusDetail.java:32)         at java.lang.reflect.Constructor.newInstance(Native Method)         at java.lang.Class.newInstance(Class.java:1606)         at android.app.Instrumentation.newActivity(Instrumentation.java:1066)         at android.app.ActivityThread.performLaunchActivity(ActivityThread.java:2226)

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?


Most expressions of  I have come across do not use lowercase delta, but a couple sites do.      I am confused.......    Check out page 21 of the June 23 issue of 'Science News' magazine. $$ \frac{d}{dt} \left(\sum_a \frac{δL}{δ\dfrac{dq_a}{dt}}δq_a\right) = 0. $$  References:   .

I have read the thread regarding , but it does not answer my question.  I am confused about the notation for change in Physics. In Mathematics, $\delta$ and $\Delta$ essentially refer to the same thing, i.e., change. This means that $\Delta x = x_1 - x_2 = \delta x$. The difference between $\delta$ and $d$ is also clear and distinct in differential calculus. We know that $\frac{dy}{dx}$ is always an operator and not a fraction, whereas $\frac{\delta y}{\delta x}$ is an infinitesimal change.   In Physics, however, the distinction is not as clear. Can anyone offer a clearer picture?


Saying an English sentence with a listing or sequence of several terms, there will always be a comma in between each term and it will end with an "and" before the last term.  My question is, should there be a comma before the "and" as well? That is, is this correct:     I have this, this, this, and this.   or is this correct:     I have this, this, this and this.   I have seen the first version with an ending comma often. This is very different from my native language (Danish, where the second sentence structure would always without exceptions be the only correct one.) Thus I am would like to have made clear what the grammatical rules are and if it must or can be included.  I am quite sure that there should be no comma before "and" in a sentence of just two terms, like:     I have this and this.   So, how is the correct use and rule of the last term in a sequence of several (more than two) terms in a sentence?

Should I put a comma before the last item in a list?     I would like crackers, cheese and some soda.   I would like crackers, cheese, and some soda.


Looking at the following image, which was posted on the internet:    Could someone tell me what is wrong? It seems true for the first 4 small images. But, when it comes to infinitesimal length, something must be wrong, i can feel it.

What is wrong with this proof?    Is $\pi=4?$


Will Windows 8.1 reset tool erase all the partitions or only the one on which windows 8.1 is located? In case if there is data on one partition and windows 8.1 is on the other partition? Thank you!

In Windows 8 I can reset everything and reinstall Windows. I assume this will clear my drive and start from scratch? Is that right? Does this create a Windows.old folder?  I see this dialog, but aren't my settings and preferences saved in the cloud? If I screw up my settings and reset like this, are my settings also refreshed back to defaults?  Since I use SkyDrive to sync my files, my personal files are safe, right?    Also, in Windows 8 I can refresh my PC without affecting files. Are my desktop and/or Windows store apps uninstalled when I refresh my PC?  I see this dialog, but I still am not sure. For example, when it says apps are "kept" does that mean I don't have to buy them again or are they installed after the refresh is over for me? I assume "from disk" means desktop apps? Or maybe corp apps?    What would motivate a user to choose between these two?


I am trying to understand the  for simulating random processes and have managed to completely confuse myself.  Consider a Poisson process whose conditional intensity is  $$\lambda(t) = \alpha e^{-t}$$   starting at time $t=0$ for some parameter $\alpha>0$.  To apply the inverse transform method I need to start with the cdf (called $F$ in the notes that I have linked to) and then compute its inverse. What is the relevant cdf $F$ for this process?  My overall goal is to be able to simulate the arrival times from this process.

Consider a Poisson process whose conditional intensity is  $$\lambda(t) = \alpha e^{-t}$$   starting at time $t=0$ for some parameter $\alpha>0$.  I would like to simulate arrival/event/failure times as efficiently as possible. (I am not sure what the standard term is for the times you get from a Poisson process.) Is there a fast way to do this?


I've seen the equation below for several times, which seems obvious, but I can't prove it seriously. Suppose $x_1, x_2, \cdots, x_n$ is a sample, $$F_n(x) = \frac{1}{n} \sum{I(x_i\le x)}$$ is EDF. How to prove that $\bar{x} = \int x\,\mathrm dF_n(x)$?

This is my first post so I will try to be as clear and concise as possible. I am doing a course in statistics and we define the true mean of a random gaussian variable to be as follows: $\mu$ = $\int_{R}xdF_{N(\mu, \sigma^2)}(x)$ As the Lesbesgue-Stieljes integral. In the notes we defined the empirical CDF as follows: ${F_{n}}$ = $\frac{1}{n}\sum_{i=1}^{n}\mathbb{1}_{\{X_{i} \le x \}}$ We then proceed to show that: $\mu$ = $\int_{R}xd(\frac{1}{n}\sum_{i=1}^{n}\mathbb{1}_{\{X_{i} \le x \}})$ = $\frac{1}{n}\sum_{i=1}^{n}X_{i}$ I am aware that this makes perfect sense as an empirical estimator for the mean, however I am quite confused as to how about deducing this from the integral. We are integrating with respect to a differential of the ECDF, and deduce that the expression is $X_{i}$? I am struggling to even deduce what the result of $\int_{R}\mathbb{1}_{\{Xi \le x\}}$ evaluates to. Any help on the above would be much appreciated.


I didn't get the memo regarding myopenid shutting down. As a consequence I cannot log in to my account anymore. Is there a way I can recover ? I tried doing it with this account, using the same email I had on myopenid but it didn't work. My myopenid url was jfoucher.myopenid.com  How can I log back in to my old account, or merge it with this new one ?

Is there any way to get my old account + metadata back if I have lost an account ties to MyOpenID?


I have been looking for 16-bit ICs for a project i`m working on. The project is to build a 16-bit computer from scratch, therefor i decided i nedded cgips that could handle high clock-frequensies. Durring my serch for an optimal IC type i decided that the FAST Advanced Schottky TTL. The problem is that the size of the connectors are to small to fit on a normal breadboard (1 in or 2.54mm).  Are there bigger versions of the same chip sets? If not, are there other IC that fit while still fulfilling the requirements i need for high frequencies?  eks:

I have just bought some 555 timers and they are timers for microelectronic circuits...could anyone tell me what I need to search for in order to get larger ones which will fit a breadboard? Thanks


I want to install pencil 0.4.4b, on an ubuntu machine that is not connected to the internet.  Is there a way I can copy all the source files or preferably a .deb file and any dependencies to a usb and then install from there?

I have a friend who has got a computer that is not connected to the Internet. Is there any way to install software offline easily?


I have a question about how to make a string safe to run in a query, generally.  I have a secure_input function, which drags all the $_POST and $_GET through a few PHP functions to make it safe, and it seems that re-formatting works, but I still get an error with singlequotes, even though they are properly escaped with backslash from mysqli_real_escape_string().  Here's how it runs:  // function which drives on every post and get function secureinput($link, $value) {     $value = htmlentities(stripslashes($value));     $value = str_ireplace("script", "blocked", $value);     $value = mysqli_real_escape_string($link, $value);     return $value; }  // then I got another function which performs all of the mysqli requests and it starts with converting all the post and get data if(isset($_POST)) {     foreach($_POST as $post) {         $post = secureinput($link, $post);         echo "post converted
" . $post . "

";     } } if(isset($_GET)) {     foreach($_GET as $get) {         $get = secureinput($link, $get);         echo "get converted
" . $get . "

";     } }   The output looks pretty fit for query, but the query is still broken:     "Some text that doesn\'t work"   How can it still fail?  I have a ckeditor implemented for some textareas, and it sends an alternative for singlequotes, which works perfectly in a query, ckeditor replaces them with S#39; (& instead of S).  Is there a function in PHP which can do the same, instead of backslashes? It would also be pretty good to have singlequotes formatted in the same way.

If user input is inserted without modification into an SQL query, then the application becomes vulnerable to , like in the following example:  $unsafe_variable = $_POST['user_input'];   mysql_query("INSERT INTO `table` (`column`) VALUES ('$unsafe_variable')");   That's because the user can input something like value'); DROP TABLE table;--, and the query becomes:  INSERT INTO `table` (`column`) VALUES('value'); DROP TABLE table;--')   What can be done to prevent this from happening?


var baseLayers = {   "Streets": streets,   "Grayscale": grayscale,   "Topography": topograph };  var overlays = {   "workplaces": workplaces };  L.control.layers(baseLayers, overlays,myIcon).addTo(map);

I'm using leaflet to display a map.  I have a control section that I'd like to be open by default, but I can't find a way to do it through the . Is there a way to do this?


I have been trying to animate my blender scene but it just turns out black. some screenshots. I've also made sure my compositor was connected properly.

A scene I made is not rendering, at all. This grey screen stays the same and nothing changes.  Here are my settings:  [


I was developing a personal website i wanna know this    or simply Hamburger is better

"Three horizontal lines" aka "hamburger icon" seems to be becoming a convention for the "main menu" button, especially on mobile sites:    Has anyone done any user testing of this convention, or got any A/B testing results? (i.e. is there an increase in bounce rate compared to using the word "Menu"?)  I did some quick user testing with wireframes featuring this icon for the main menu. 3 out of 6 people got it and used it. The others did not.  One person in particular had a lot of trouble "getting back to the top" (i.e. restarting their navigation from the top level of the site) as they didn't know about the convention, or that the logo would link to the home page.  I guess it will be different for different demographics - users of Facebook on mobile probably know it.  Anyone got any findings they can share?


If P a polynomial of degree n let M=Max |f(z)| if Z ∈ D(0,1) prove if |z|>1 then P(z)<=M.|Z|^n Maybe we can use the maximum modulus principle and consider 𝑞(𝑧)=𝑧^n P(1/𝑧)

Let $p(z)= \sum_{k=0}^n a_k z^k$ ,  $a_n \neq 0$ , be a polynomial of degree $n$ such that $|p(z)| \leq M$ for $|z| \leq 1$.  Show that $|p(z)| \leq M|z|^n$ for $|z| \geq 1$  This was an exam question. Part (a) of this question asked the converse: if $|p(z)| \leq M|z|^n$ and $|z|$ is sufficiently large, then $p(z)$ is a polynomial. This question came straight out of Ahlfors' Complex Analysis, which I solved by showing, using the Cauchy Estimate,  $|p^n (z)|  \leq \frac{n!M|z|^k}{R^n} = 0$ as $R \to \infty$.   I would like to work backwards with this.   May I do this, or similar:   $p(z) = \frac{1}{2\pi i} \int_{c} \frac{f(\zeta)d\zeta}{\zeta-z}$  $\Rightarrow  |p(z)| \leq \frac{2\pi M|z|^n}{1(2\pi)}= M|z|^n$


For example lets say I have a Car super class and a Honda sub class extending from Car. I understand I can create a Honda object by:  Honda accord = new Honda();   and I can also do:  Car accord = new Honda();   But what are the advantages to instantiating accord as a Car type?  I know if I want to search all Car subclasses I can use if (var instanceof Car), but aside from this are there any special cases?  I'm just having difficulty wrapping my head around this.  Thank You.

I have seen this mentioned a few times and I am not clear on what it means. When and why would you do this?   I know what interfaces do, but the fact I am not clear on this makes me think I am missing out on using them correctly.   Is it just so if you were to do:  IInterface classRef = new ObjectWhatever()   You could use any class that implements IInterface? When would you need to do that? The only thing I can think of is if you have a method and you are unsure of what object will be passed except for it implementing IInterface. I cannot think how often you would need to do that.   Also, how could you write a method that takes in an object that implements an interface? Is that possible?


I often search Google for programming-related questions I have, and rely heavily on the site:stackoverflow.com filter to restrict results to Stack Overflow posts, for example. In some cases, like working with Excel, multiple sites may have useful content (e.g. Stack Overflow and Superuser). Is there a way I can return results from two such sites at once, rather than having to run two separate site:-filtered searches? I have tried |, ,, ;, and OR, both with spaces and without, but have had no luck.

Say I wanted to search site:wordpress.com site:livejournal.com gelato. Doesn't work, because it tries to && those results instead of ||ing them. Say I want to do this for a number of sites such that it makes sense not to not restrict but also large enough so that it would be tedious to do this for every site (perhaps four or more specific site searches). How do I get the || of results for site:livejournal.com gelato and site:wordpress.com gelato?


I am a beginner using QGIS (1.8.0 Lisboa) on a Mac (OS X 10.6.8 Snow Leopard). I work on a file with two layers in the following sequence (top to bottom):    a vector polygon layer with a few outlines of various buildings in France and Italy (CRS: EPSG:4326 - WGS 84 - "on the fly" re projection is activated ) a Google satellite layer uploaded via open layer plugin.   Sometimes when changing the scale (scrolling in and out) the Google layer updates a little wrong in size or position compared to the polygon layer. But as soon as I "pan" the map everything reconstructs right. Now the problem I have concerns the print composer.  The result of any kind of export - pdf, or image or svg - of my map (vector layer + Google layer in the background) differs from what is shown in the preview of the print composer: the vector layer and the Google layer positions are mismatching and in a different scale. I can send some pictures showing screenshots of the print composer preview and the final results if required.  I tried almost everything:    new files with different CRS settings "cache" update preview "render" update preview different paper sizes,  different scales,   The problem appears only using an open layer map (Google, OpenStreetMap...). If I try the same using two vector layer (shapefile) - one with the buildings, another one with the city in background - everything works out great.  ...exasperating! Since it is a real important research project I would be very grateful for some help and tips.

I'm having trouble with the OpenLayers Plugin of Qgis and the map composer:  If I create an OSM-background layer and if I want to export this, the OSM-Layer looks perfectly all right in the normal qgis program window. But in the map composer and after export the layer has shifted relatively to my other shape layers (EPSG:32633 - WGS 84 / UTM zone 33N).  The second thing is that the output resolution of the exported osm-layer is very, very poor.   A really bad way of getting around this whole trouble would be to increase the screen resolution and make a screenshot of the map composition window of qgis. But I don't think this would be very professional. It also would cause a lot of pain :)   I'm using Qgis 1.8.0-Lisboa under Linux. The openlayers plugin is version 0.92.


Currently, SE employees are given diamonds wherever they need them. I agree with  on this to some degree, employees shouldn't be treated any different.  But... on meta, employees are different. They have the power to dole out official responses, and thus we should be able to differentiate between an employee and a normal user. Currently, only some employees have a diamond on MSO (see , ). This makes it confusing, especially when you see official-sounding posts like .  Now, giving diamonds to all employees on meta may not be the best solution to this. I don't think all employees want their precious inboxes spammed with all the suspensions that are doled out on meta, and other mod stuff. They won't really need the diamond powers either (though it wouldn't hurt).  So, I propose this:  Similar to how moderators have "Moderator" clearly on their profile    display "employee" on an employee's profile, along with the diamond if they have one. At least on meta.    It would imho be even better to display it on their usercards in some form, but that has already been shot down.  It would be even even better if non-MSO mods had greyed out diamonds, similar to , but that's just me wanting more shiny stuff ;-)

Starting today, all staff member accounts will have "Staff" next to their name on their user profile.  It looks like this:    For reference, it used to look like this:    We took our cue from the existing design of the "top n% overall" label which we've actually inverted for everyone (not just staff) to stand out from the others. Additionally, we've updated the moderator label from "(moderator)" to an actual label, so it's easier to see and stands out. Staff with diamonds will have both of the indicators.    Clearing up confusion to improve interactions  We've noticed a shared point of friction for users and staff alike - staff often need to post answers on meta sites to explain how a tool or feature works or to respond to bugs. This is a great opportunity for them to interact with the people asking the questions but, sometimes, not having an indicator for every employee makes these interactions more challenging than they already are.  You might say "But what about diamonds, that's used for staff"... and you'd be right, in some cases. The primary purpose of the diamond is to indicate the moderators on a site. These are non-staff users who have extra tools at their disposal and special access to information. While we gave these to staff in the past, we now only grant them to specific types of staff members who need access to these tools - generally community managers and developers.  As such, for the rest of our cohort, we have relied on them mentioning their status in their "about me" sections. This simply isn't a sustainable option both because it's easy to forget but also because it's not actually proof. Anyone can edit their profile to state they're staff.  Adding an indicator like this isn't an original idea. Y'all have been asking for a way to recognize us for years and we're so excited to be able to deliver this change:        Fortunately, we already indicate staff status at the account level, so we can use that information to add a marker to staff profile pages that anyone can see. So this update makes most of these requests !  We'll still encourage our staff to be more specific about their job title in their "about me" but this marker will let y'all quickly and easily know if the person supporting a feature or answering a bug report is staff.  I'm really excited about this change and I hope it helps smooth out interactions across the network a bit. Questions? Ask them in the answers.


Is c point to a or is c point to the same memory that a is pointing to? Why does the following code print "We are equal"? Thanks in advance     public static void main(String args[]) {         String a = "10";         String b = "10";         String c = a;                  if(c.equals(b)) {             System.out.println("We are equal ");         }         else {             System.out.println("Not equal! ");         }            }

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?


I have a function which expect a wchar_t**, I am allocating it:  wchar_t * * lFilterPatterns = malloc(aNumOfFilterPatterns*sizeof(wchar_t *)); for (i = 0; i < aNumOfFilterPatterns; i++) {     lFilterPatterns[i] = malloc(MAX_PATH_OR_CMD*sizeof(wchar_t)); }   is there a better/simpler way to make this allocation ?  edit: I would prefer to call malloc once only.  this has been proposed:  wchar_t (*lFilterPatterns)[MAX_PATH_OR_CMD] =          malloc(aNumOfFilterPatterns * sizeof * lFilterPatterns);   but then the function complains: warning C4047: 'function' :  'wchar_t * *' differs in levels of indirection from 'wchar_t (*)[1024]'   can I cast 'wchar_t (*)[1024]' into 'wchar_t * *' ?

I don't truly understand some basic things in C like dynamically allocating array of arrays. I know you can do:  int **m;   in order to declare a 2 dimensional array (which subsequently would be allocated using some *alloc function). Also it can be "easily" accessed by doing *(*(m + line) + column). But how should I assign a value to an element from that array? Using gcc the following statement m[line][column] = 12; fails with a segmentation fault.  Any article/docs will be appreciated. :-)


I want to set up a couple of URLs to point to my main site. For example, if I were an SEO expert in London, would it be a good idea to buy the domain seo-expert-london.com (which would then redirect to my main site) in order to try and gain more business from London?

Let's say I have a website called books.com where I sell books. I've read on  that it's not a bad idea to register another domain that does a 301 redirect to my website, like booksforsale.com.  Now, say I want to only target a specific category withing my website, like books.com/sci-fi/ so I register sci-fi-books.com and do a 301 redirect.  Would this improve my search rankings?  Thanks.


Here i want to add new textbox on click of button i.e btnAdd and and also want to remove those newly added textbox by clicking the button i.e btnRemove which is also added along with the new added textbox on a click of btnAdd .Now the problem is that as i click the add button i.e btnAdd new textbox along with remove button i.e btnRemove is also added as required but as i click on remove button i.e btnRemove the respective textbox and that respective remove button is not removed.Below is what i have done  <!DOCTYPE html> <html> <head> <title></title> <meta charset="utf-8" /> <script src="https://ajax.googleapis.com/ajax/libs/jquery/3.1.1/jquery.min.js"></script> </head> <body> <div id="a">     <input id="Text1" type="text" /> </div> <input id="btnAdd" type="button" value="Add" /> <script>     $(document).ready(function () {         $("#btnAdd").click(function () {             $("#a").append('<input type="text" id="Text1" value="" />'+'<input type="button" id="btnRemove" value="Remove"/>');         });         $('#btnRemove').click(function () {             $('#Text1').remove();             $(this).remove();         });     }); </script> </body> </html>

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.


I did not submit my tax refund copy this year until the deadline (earlier this month). I don't owe taxes, but I was getting some tax refunded to me. Is it possible to get the tax refund if you miss the deadline for sending the documents to HRS?  Att

Some people in the United States are not required to file an income tax return (e.g. their income is too low).  However, they could be entitled to a refund of wages withheld, or a credit such as the Earned Income tax credit.  They need to file a return in order to get the refund or credit.  If such a person does not file by April 15, do they forfeit their refund/credit?


I was rejected for a visitor visa for the USA when I was an Indian citizen. Now I am an Australian Citizen.  I applied for ESTA, which got denied, maybe due to my previous rejection. Since then I have travelled to the USA 4 times with valid visa. My visa will expire in 2020.  Should I renew my Visa again, or should I try applying for ESTA?  My visa has been renewed 2 times already.

I had applied for B1/B2 on my previous nationality but it got rejected Thrice.  I had planned on visiting my mother as she lives there. my last refusal was 3 years back. Now i have gained an European nationality and I am thinking of applying for ESTA so I can visit my mother. I have doubts if it will be accepted because I'll have to disclose about my previous refusals.  What should I do? because if I don't disclose my previous refusals I fear I might be rejected permanently.


This question is similar to the question "" but somewhat trickier, because the distinction here is, I think, more subtle than the distinction between using "God" as a proper name to refer to one particular monotheistic divine being and using "god" as a reference to one divine being among many.  Sometimes when people talk about natural philosophy or physics they use the word nature in the sense that "This equation is a law of Nature.", or "This is how Nature is.", or "As scientists, we hope to understand Nature."  But, capitalization of the word Nature when used in this sense does not seem to be entirely consistent and may have political or religious connotations.  Under what circumstances should the word "Nature" be capitalized (other, of course, than at the beginning of a sentence or as the proper name of a publication)?

Why is "Nature" usually spelt with an initial capital letter in scientific journals? I am mainly referring to life science here, in case this matters.  I am not talking about the obvious cases, like capitalisation in titles, at the beginning of a sentence, etc., but when it appears mid-sentence, where one would normally expect it to be lowercase.  I've heard some explanation that it gives the impression of Nature as a goddess (see comments on this post ) - but this is probably the last thing I would have expected in a scientific article...


1) I need to say the promotion will be invalid on December 6th and while we have not reached that date, the promotion will be valid. What should I say:     A) The promotion is valid up to December 5th.    B) The promotion is valid until December 5th.    C) The promotion is valid by December 5th.    I think only 'C' is correct here.   2) I need to say the promotion is valid from date ‘X’ to date ‘Y’. After the date ‘Y’ the promotion will be invalid. How shall I say it:     A) They have great promotion from January fifth, until January 8th up to 50% off.    B) They have great promotion from January fifth, up to January 8th up to 50% off.    For me both work here and have exactly identical meanings. Am I right?

I wonder if someone could tell me which choice works in the following sentence and why the others do not work: (From my point of view, all of these choices work in this context.)  They have great promotion till January 5th......50% off. a) up to; b) until; c) by


I was told many times that I'd better stick to some well-known fast-food restaurants rather than eat local food in China. Otherwise, I may spend my whole trip exploring the vast variety of chinese outhouses.    Is this the case for a soft, european belly? Why? If so, can I somehow prevent it from happening while still enjoying some exotic (at least for me) dishes?

Montezuma's revenge or Aztec two step in Central America, mummy's tummy, or Cairo two-step in Egypt, Kurtz Hurtz in Uzbekistan, Bombay belly or Delhi belly in India.  A case of the sh-- or Hershey Squirts or The McSh-- in North America, Down Under Butt Chunder in Australia, Karachi crouch in Pakistan, Suryavarman's Revenge in Cambodia.  Kabulitis in Afghanistan, holiday tummy in United Kingdom, Bali belly in Bali, or Taghazout Tummy in Taghazout or Kathmandu quickstep in Nepal.  Beaver fever in Canada, Thailand it's Thai-dal wave. Peacekeepers to Arabic-speaking countries have called it yalla yalla (Arabic for "fast, fast").  In Central Asia, it was ridiculous, with every second backpacker walking around with toilet paper on them, regularly having to make a 'run' for it. In Egypt, half my tour group got sick, by the time we'd converted into a mobile pharmacy!  Regardless of what it's called, what's the best way to try and prevent it?


If an answer is deleted while the close vote dialog is open on the parent question, the "This post has been deleted" banner overlaps the modal.  This also renders the dialog useless, as clicking on it will refresh the page.      Google Chrome Version 57.0.2987.98 (64-bit)  macOS Sierra Version 10.12.4 (16E195)

There is a little bug that becomes visible when a page contains realtime-post-deleted-notification banners (that's the CSS classname of these red banners appearing on answers which just got deleted, see screenshot below) and you try to open the flag dialogue above them:    Obviously, the dialogue appears below the banners, which it clearly should not do. It also has no input focus, trying to interact with the dialogue fails and either closes it (clicking outside of the red banners) or reloads the page (clicking on the red banners).  The cause for this is simply the z-index ordering in the site's CSS. Relevant CSS snippets:  .realtime-post-deleted-notification {     position: absolute;     text-align: center;     z-index: 100; }  .popup {     display: none;     padding: 15px;     position: absolute;     z-index: 10; }   So the fix for this minor bug would probably be to raise the z-index of the popup class to something greater than 100.


I'm looking for the name and some examples of functions $f$ with the following property  $$f\circ f=I$$  where $I$ is the identity. This means that $f=f^{-1}$; some examples are the functions $f(n)=-n$ and $g(n)=1/n$. What are other examples of functions that have this property and what is so special about them?

What are the functions that are their own inverse?  (thus functions where $ f(f(x)) = x $ for a large domain)  I always thought there were only 4:  $f(x) = x , f(x) = -x , f(x) = \frac {1}{x} $ and $ f(x) = \frac {-1}{x} $   Later I heard about a fifth one     $$f(x) = \ln\left(\frac {e^x+1}{e^x-1}\right) $$ (for $x > 0$)  This made me wonder are there more? What are conditions that apply to all these functions to get more, etc.


I created a new Google account to use YouTube with a while back. Thing is, whilst I remember the Username I used and the password, I cannot actually remember the email address I used.  Is there a way to recover the email address for a Google Account using the Username and password?

I have forgotten the password or username for my Google account, or I'm unable to access my account for other reasons.  How can I recover my account?  (This Q&A is meant as a general description for all Google and Gmail username/password questions. See: )


I am wondering how to prove $$\lim_{x\to \infty} \frac{e^x}{x^n}=\infty$$  I was thinking of using L'Hospital's rule? But then not sure how to do the summation for doing L'Hospital's rule n times on the denominator? Or whether it would be easier using longs like $\lim_{x\to \infty} \ln(e^x)-\ln(x^n)$?  Thank you!

In other words, how to prove:  For all real constants $a$ and $b$ such that $a > 1$, $$\lim_{n\to\infty}\frac{n^b}{a^n} = 0$$  I know the definition of limit but I feel that it's not enough to prove this theorem.


Some applications produce question marks for their subwindows in the unity menu instead of ordinary icons. What could cause this behaviour?

I'm having a problem with a couple of programs that have launchers in unity but then create a separate icon after launched.  Is is possible for the launcher to track the windows it spawns to organize better?  Or is this a bug in Unity itself?    It might not matter but this specific program is a mono program, and the icon spawned is listed as the panel.


I understand what has brought so much attention to GameStop's stock is someone noticed that it has strong finances but was being heavily shorted, i.e., other people took heavy bets that the stock price would go down.  I know how to look up financial statements from the  and  filings, but I can't find the "short position" in any of these.  Searching for "short" doesn't lead to any tables with numbers.  Googling for it just leads me to SEC rules in impenetrable lingo saying that this must be disclosed, but I'm looking for someone to show specifically where the number is so I can look it up for other companies I would consider personally investing in. Where in GME's 2019 public filings are there short-stock positions reported, and how can we know that the company was "heavily" shorted?

What I understand from the whole Game Stop soaring stock prices event is that Game Stop stocks were in essence shorted too heavily, there were more stocks borrowed/shorted than in existence. This enabled people from the WallstreetBet community and others to inflate the stock price massively by buying it. What I want to know is how/where the WallstreetBet community got the information that it was shorted so/too heavily. Were it just statements from big investors that they shorted heavily on Game Stop stocks? Or did/could they get information from other sources too about how much the stock was shorted?


I am on a task where I need to call an external webservice that takes the username and password in the request body, not as part of Authorization header. I did setup the username and password using Named Credentials, but I am having trouble accessing the actual username and password from the named credentials as merge fields. Below is my setup Identity Type : Named Principal Authentication Protocol : Password Authentication Username : {Service Account Username} Password : {Service Account Password}  Generate Authorization Header : Unchecked Allow merge fields in HTTP Header : Unchecked Allow merge fields in HTTP Body : Checked  I tried various options, but nothing seems to work. When I access the named credential via code using the merge fields {!$Credential.Username} and {!$Credential.Password} and assigning them to string variables, the debug log is only printing {!$Credential.Username} and {!$Credential.Password} only and not the actual username and password. Apparently, the HTTP send is throwing a ScriptThrownException when I make a callout to the external webservice with the above credentials. Also, if I have multiple named credentials in my salesforce org, how do I access the correct one using merge fields? Can someone help?

I am having an issue when attempting to reference the {!$Credential.UserName} and {!$Credential.Password} merge fields.    I created a named credential with the following configuration:   Identity Type: Named Principal Authentication Protocol: Password Authentication Generate Authorization Header: false Allow Merge Fields in HTTP Header: true Allow Merge Fields in HTTP Body: false   I also set the username and password as the credentials expected by our vendor's API.  I then define the Authorization Header keys in Apex and use the merge fields as reference.          req.setHeader('Authorization-UserName', '{!$Credential.UserName}');         req.setHeader('Authorization-Token', '{!$Credential.Password}');   I initially hard-coded the Authorization-UserName and Authorization-Token (which worked).  I am also using the same endpoint that was defined in Remote Site Settings.  But due to the fact that I plan to use Named Credentials, I disabled the end point in Remote Site Settings (see: ).  It appears that the {!$Credential.UserName} is not resolving to the defined username value.


Let $f(z)$ is analytic on $D = \{ z \in \mathbb{C}: \left| z\right| < 1\}$ and $\left| f \right| \leq \frac{1}{1- \left| z\right|}$ then show that $\left| f '(z) \right| \leq \frac{4}{(1 - \left|z\right|)^2}$.  I don't know what to do here, we know that the function is bounded by the series $\sum_k \left|z\right|^k$ and that it looks like we are taking the derivative at both sides of the inequality (I know that this is not correct). I tried to use Cauchy's integral formula without success.

$f$ is an analytical function on the unit disk $\mathbb{D}$ for which there is a $C > 0$ such that  $\forall z \in \mathbb{D} \colon |f(z)| \leq \dfrac{C}{1-|z|}$.  I know have to prove that    $\forall z \in \mathbb{D} \colon |f'(z)| \leq \dfrac{4C}{(1-|z|)^2}$.  I tried using the Cauchy integral formula but I can't find a fitting circle to get this result.