Is there a way to insert comments at the end of a line, within a block of TeX? For example, something like the following  $$\begin{align}  &(B \cap A) = (C \cap A) \\    'given  &(B \cap A) \cup (B  \cap \overline{A}) = (C \cap A) \cup (C  \cap \overline{A}) \\ 'substitution and distributive law \end{align}$$ &B = C    where ' would indicate a comment. It would be handy for justifying certain steps when writing proofs.

I've been using the align environment to line up equations in proofs/explanations/etc and I like to place parenthetical commentary for each step, similar to the code below:  \documentclass{article} \usepackage{amsmath} \begin{document}  \begin{align*}   f(ax + by) & = f(ax) + f(by) & (By Property 1) \\              & = af(x) + bf(y) & (By Property 2) \\ \end{align*}  \end{document}   The problem I have with this is that the commentary completely distorts the overall alignment of the equation area; far too much space is allocated to the column containing the commentary.  I would like, insofar as it is possible, for the equations themselves to be aligned in the center of the page and for the commentary to simply appear on the right without affecting the overall justification of the equations. What's the best way to achieve this?


I have a webpage with 2 tabs and a
 area which is updated. When you click a tab, jquery performs an AJAX call which retrieves the relevant data from the database and inserts it into the
. The content is generated with jquery, mostly using $("#content").append('whatever...'). This works fine.  The problem is when I try to click a button which was created from the original jquery call. It doesn't work. I'm assuming that this is because my jquery script was loaded before this html code was generated, right?  So, my question is, how do I get my generated content to work with my jquery script?  I'm guessing it would be possible for me to create 2 divs:   and then use jquery to hide/show the relevant div. Is this a possible solution or is there a more standard way?  Extra info:   Wordpress site $wpdb used for database interaction use wp_enqueue_script() to enqueue my jquery script   Thanks:)

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.


Would the voltage of a power source decrease if multiple loads / more load is added to it? I am researching battery types, and wanted to know, if I added enough load to a battery how much / would there be any voltage drop? Example: I have a 12 V set of batteries in series. The batteries' rated current is 48 A. I have four loads that each require 12 V and 13 A of electricity. Would there be any voltage drop, would the load have to be significantly higher to actually see a decrease, or would the voltage stay the same?

In one of the answers on this site, I found link to  project. That article mentions internal resistance of batteries and cells. Where can I find data about common ranges of internal resistances for batteries? I've always heard that it's low, but I couldn't find anywhere how low is low and common resistances for common battery types.


I'm new to Complex numbers, so I don't know a lot about them yet.  How do I plot this condition on the complex plane?  $$-\frac{\pi}{2} \leq \operatorname{Arg}\left(\frac{z}{\bar{z}}\right) \leq\frac{\pi}{2}$$

As part of an exercise, I was asked to plot this condition on the complex plane:  $$-\frac{\pi}{2} \leq \operatorname{Arg}\left(\frac{z}{\bar{z}}\right) \leq\frac{\pi}{2}$$  My question is:      What is the value of $\displaystyle\operatorname{Arg}\left(\frac{z}{\bar{z}}\right)$?


I just downloaded Ubuntu 16.04. Where is the desktop. I have been having trouble with all these distros; they come with no  desktop and no terminal. How can you run the program??

I would like to see a full how-to guide on how to install Ubuntu.


Here is Prob. 29, in the Additional Problems For Chapter 1, in the book Calculus With Analytic Geometry by George F. Simmons, 2nd edition:  A point moves in such a way that the ratio of its distances from two fixed points is a constant $k \neq 1$. Show that the locus is a circle.  My Attempt:  Let the two fixed points be $Q = (a, b)$ and $R = (c, d)$. If $P = (x, y)$ is any point such that $$ \frac{PQ}{PR} = k, $$ then upon squaring and multiplying out by the denominator we obtain $$ k^2 (x-c)^2 + k^2 (y-d)^2 = (x-a)^2 + (y-b)^2, $$ which we can also rewrite as $$ \left( k^2-1\right) x^2 + \left( k^2-1\right) y^2 - 2\left( k^2 c - a \right) x - 2 \left( k^2 d - b \right) y = a^2 + b^2 -  k^2 \left( c^2 + d^2 \right), $$ and since $k > 0$ and $k \neq 1$, therefore we have $k^2 -1 \neq 0$, and thus upon dividing both sides by $k^2-1$, we obtain $$ x^2 + y^2 - \frac{ 2\left( k^2 c - a \right)  }{ k^2 - 1} x - \frac{ 2 \left( k^2 d - b \right)  }{k^2-1} y = \frac{ a^2 + b^2 -  k^2 \left( c^2 + d^2 \right) }{ k^2-1},  $$ and upon collecting together the terms in $x$ and the terms in $y$, we get $$ x^2 - 2 \frac{ \left( k^2 c - a \right)  }{ k^2 - 1} x  + y^2 - 2 \frac{  \left( k^2 d - b \right)  }{k^2-1} y = \frac{ a^2 + b^2 -  k^2 \left( c^2 + d^2 \right) }{ k^2-1},  $$ and upon completing the two squares on the left-hand-side, we get $$ \begin{align}  & \ \ \ \left( x - \frac{ \left( k^2 c - a \right)  }{ k^2 - 1}  \right)^2 + \left( y - \frac{  \left( k^2 d - b \right)  }{k^2-1} \right)^2 \\  &= \frac{ \left( k^2 c - a \right)^2  }{ \left( k^2 - 1 \right)^2 }  + \frac{  \left( k^2 d - b \right)^2   }{ \left( k^2-1 \right)^2 } + \frac{ a^2 + b^2 -  k^2 \left( c^2 + d^2 \right) }{ k^2-1} \\ &= \frac{ \left( k^2 c - a \right)^2  +  \left( k^2 d - b \right)^2   + \left( k^2-1 \right) \left( a^2 + b^2 \right) -  k^2 \left( k^2-1 \right) \left( c^2 + d^2 \right)   }{ \left( k^2 - 1 \right)^2 } \\ &= \frac{  k^2 \left( 2c^2 + 2d^2 -ac - bd + a^2 + b^2  \right) - k^4 \left( c^2 + d^2 \right) }{ \left( k^2 - 1 \right)^2 } \\ &= \ldots. \end{align} $$ Now the locus of the point $P = (x, y)$ is a circle if and only if $$ \frac{  k^2 \left( 2c^2 + 2d^2 -ac - bd + a^2 + b^2  \right) - k^4 \left( c^2 + d^2 \right) }{ \left( k^2 - 1 \right)^2 } > 0, $$ which is the case if and only if $$ k^2 \left( 2c^2 + 2d^2 -ac - bd + a^2 + b^2  \right) - k^4 \left( c^2 + d^2 \right) > 0. $$  Is what I have done so far correct in each and every detail? If so, how can we show that the last inequality always holds? Or, can we show this for all possible $a, b, c, d, k \in \mathbb{R}$ such that (i) $(a, b) \neq (c, d)$,  and (ii) $k > 0$ and $k \neq 1$? Or, are there any exceptions?

Say I have two points. One at $A = (0, 0)$ and another at $B = (0, 10)$. I wish to derive an equation for a line that, for any point $P$ on the line, would equal a set ratio for the distance $P$ to $A$ and $P$ to $B$.  This is easy if the predetermined ratio for $A:B$ is $1:1$. I would create a line from $A$ to $B$, find its midpoint, then create an orthogonal line at the midpoint. Then at any $P$ on the line I know that the ratio distances from $P$ to $A$ and $B$ will be $1:1$.  But what if the ratio for $A:B$ is something like $11:18$?  This is for a positioning algorithm I am implementing - not for homework :)  EDIT: Note - If an exact formula is not possible, an approximation of the line out to $\pm 200$ from $A$ or $B$ is acceptable as values further from $A$ and $B$ will not be utilized anyway. A linear equation for the final result/approximation is ideal for speed in running multiple computations.


I have learned that ZFC has not been proven consistent, and that further more if one were to start from ZFC and prove ZFC consistent, this would imply that ZFC is not consistent, due to Gödel.  A few questions about what I just said: Does this mean there is a possibility that ZFC is inconsistent? Are there some really good (mathematical) arguments for why, even though ZFC might be inconsistent, it probably is consistent? (or at least that we should still use it even if we aren't sure it's consistent?) What would happen if somebody were to prove that ZFC were inconsistent? Would we have to throw out all of our old proofs? And lastly, does Gödel's work imply that, in order to prove ZFC consistent (without automatically proving ZFC inconsistent in the same stroke) we would need to make more assumptions outside of ZFC? In other words, is there hypothetically a way of proving ZFC consistent without making more assumptions?  I would appreciate answers to even one of these questions.

If, one fine day, someone found a contradiction in ZFC (or even ZF), what implications would such an event have for mathematicians? Is there currently any backup axiomatic system on par with ZFC that would enable mathematicians to continue pursuing mathematics, should the unthinkable occur?


Suppose I have this method:  1. public int sum(int a, int b){ 2.     int x = 0; 3.  4.     return x; 5. }   Is it possible to get a string x = a + b; and place in line 3 (during runtime), so that after this string is inserted, the code now does the sum of a and b?  I wanna write some code in a text input field, so when I press a button, all that code (that is a string) should be able to go inside some part of some existing code. The sum above is just an example but it can be anything.

I can do an eval("something()"); to execute the code dynamically in JavaScript. Is there a way for me to do the same thing in C#?  An example of what I am trying to do is: I have an integer variable (say i) and I have multiple properties by the names: "Property1", "Property2", "Property3", etc. Now, I want to perform some operations on the " Propertyi " property depending on the value of i.   This is really simple with Javascript. Is there any way to do this with C#?


I tried installing pypy3 after installing pypy through the regular Ubuntu 18.04 repo:   E: Unable to locate package pypy3   Okay, so it's not available in the regular repos. I added the official  as suggested on the :  E: Unable to locate package pypy3   Again, pypy3 is not available. Is there really no pypy3 package available for Ubuntu, or am I missing something that should be obvious?

I want to install pypy3 in Ubuntu. I have read the answer for this question "How to install PyPy3 (2.1, beta) on Ubuntu?" and still have no idea what to do. Could some kind soul please explain it so that even I can understand it :)  Here's what I have done so far:  Went    Read that I had to go   Downloaded: pypy3-2.1-beta-linux_x86_64-portable.tar.bz2  Opened it with the Archive manager (because it seemed like a reasonable thing to do)  Extracted it to desktop/PYPY3  Then desperately tried all the shell commands I came across last night. I will not be able to give a clear account of what I tried and what errors came back, as it is kind of a blur to me at this point.  But I can tell you that I got the Tar thing unpacked at one point and that I have tried running the pypy executable from the command line from the folder containing it, but got this:   bash: /usr/bin/pypy: No such file or directory   Could someone please tell me what to do. (have read the readme, the install docs at pypy.org and lots of posts)


I want to express a certain kind of quotient with a double-bar. The solution to the question this is a duplicate of () works for me, but I'd like to tinker with it a bit regarding    the spaces between numerator/demominator and bars the spaces between the two bars the width of the bars   to achieve an aesthetic closer to the rest of my document.  What parameters can I modify?

Is there a way to make the fraction line look like the equality (=) sign, i.e., to have two parallel horizontal lines with a little gap in between? Many thanks!


I'm looking for a kids space travel science fiction series. It featured green aliens, there were at least 3 books in the series, and they were very old, with the first book published in the 60's.  Two more crucial details - mushrooms play a crucial role in the books, and the alien leader is known as 'The Great Ta'.

I'm talking about at least two juvenile sci-fi novels, read between second and fourth  public grades (U.S.A.) which for me places them around 1956-9.  The protagonists are a brother and sister, presumably my (then) age. They are friends  with a single man, a scientist who has built a rocket ship. The scientist is little fey,  physically; a (relatively) large, round head, balding, short in stature and striking long,  thin hands and fingers.  The rocket ship's final preparation is to slop a viscous, clear gloop over EVERYTHING, inside and out from a pail with a paintbrush. In flight, there is an encounter with the moon, and a very small planet with (non-threatening) inhabitants not physically unlike the fey rocket scientist. The planet orbits either the moon or the earth, not the sun, and strangely, some kind of mushroom(!) theme runs through the books. Really.  That's it. That's all I got (I was nine at the most, fer chrissake). My recollection tells me there was concealment from parents, a particular name for the planet and people  and flight through a spatial fog. I mention these things separately because I am less sure  of them than the previous two paragraphs. The author was blissfully unrepentant of the laws  of physics:  Earth gravity on a micro-planet, fog in space and super-gloop to ready the  ricketiest rocket. Worked for me.  I'm guessing even Richard, my previous mentor/savior might not be familiar with these.  Anybody? Author, titles? Or do you just recognize one of these?


I have been working on a MVC5 project using Visual Studio Community Edition on Windows 10. One fine morning, when I started Visual Studio to resume work and run the webapp I got the following error     Could not load file or assembly 'System.Web.Mvc' or one of its   dependencies.    What really happened all of a sudden, I have absolutely no clue. . It's my personal machine. Can anyone please help me out? What happened to my dear Visual Studio? Is it sick or something?  I have tried all the things that are mentioned in a similar question asked on SO. In that question the OP compiled his own version of ASP.NET from its sources. I have not performed any such thing. Those Jks. who have been finding similarity in that question should read the 2 questions fully before declaring that they are exact duplicates.

My new ASP.NET MVC Web Application works on my development workstation, but does not run on my web server...    Server Error in '/' Application.    Configuration Error  Description: An error occurred during the processing of a configuration file required to service this request. Please review the specific error details below and modify your configuration file appropriately.     Parser Error Message: Could not load file or assembly 'System.Web.Mvc, Version=1.0.0.0, Culture=neutral, PublicKeyToken=31bf3856ad364e35' or one of its dependencies. The system cannot find the file specified.    Source Error:    Line 44:         <add assembly="System.Web.Abstractions, Version=3.5.0.0, Culture=neutral, PublicKeyToken=31BF3856AD364E35"/> Line 45:         <add assembly="System.Web.Routing, Version=3.5.0.0, Culture=neutral, PublicKeyToken=31BF3856AD364E35"/> Line 46:         <add assembly="System.Web.Mvc, Version=1.0.0.0, Culture=neutral, PublicKeyToken=31BF3856AD364E35"/> Line 47:         <add assembly="System.Data.DataSetExtensions, Version=3.5.0.0, Culture=neutral, PublicKeyToken=B77A5C561934E089"/> Line 48:         <add assembly="System.Xml.Linq, Version=3.5.0.0, Culture=neutral, PublicKeyToken=B77A5C561934E089"/>   Source File: C:\inetpub\www.example.org\web.config    Line: 46    Assembly Load Trace: The following information can be helpful to determine why the assembly 'System.Web.Mvc, Version=1.0.0.0, Culture=neutral, PublicKeyToken=31bf3856ad364e35' could not be loaded.     WRN: Assembly binding logging is turned OFF. To enable assembly bind failure logging, set the registry value [HKLM\Software\Microsoft\Fusion!EnableLog] (DWORD) to 1. Note: There is some performance penalty associated with assembly bind failure logging. To turn this feature off, remove the registry value [HKLM\Software\Microsoft\Fusion!EnableLog].     Version Information: Microsoft .NET Framework Version:2.0.50727.3053; ASP.NET Version:2.0.50727.3053    Do I need to install the AspNetMVCBeta-setup.msi on the server?  Or is there a different installer for servers?


Does Linux need anti-virus? I searched & some sites are providing free antivirus for Ubuntu and Linux. When does it needs anti-virus?

I thought that there was no need to scan for viruses either in Ubuntu or any Linux distros until I found virus scanner packages clamtk and klamav in Ubuntu software center yesterday.  This leads to the following questions:   How do viruses differ between Linux and Windows? How do the strategies for protection differ between Linux and Windows? Should a virus scanner package be installed on my system? If so, which would be a better option?


I am trying to make a function that will be able to access a variable from outside the function. However, this variable needs to be defined in a class.  I'll define a simplified function of what I am trying to do in code for clarity.  class Stuff():      def __init__(self):          print("Initialized")       def forward(self,x):          y=4          x=func(x)          return x    def func(x):    global y    return x+y  stuff = Stuff() print(stuff.forward(4))   So, I am trying to make func(x) use the y defined in the "forward" method, but when I run this code, I get the error "global name y is not defined". Any help is much appreciated.

How can I create or use a global variable in a function?  If I create a global variable in one function, how can I use that global variable in another function? Do I need to store the global variable in a local variable of the function which needs its access?


I had a bounty on one of my questions. It got zero answers. I found an answer and posted it and accepted it. Why didn't the bounty end at that moment?  Now it has expired. Why now there's a grace period starting? Do I need to take further steps?  If this is to solicit new or more answers, why? I already accepted an answer.  Relevant question:

I've read the FAQ, the blog post announcing the decoupling of bounty from answer accepting, and many of the questions here relating to bounty, but I still haven't figured out why this bounty system works so non-intuitively.  Here's what happened recently:   I asked a question on StackOverflow Having received no answers, I added a bounty. Someone provided an answer. I accepted an answer   Why would I not expect that in my accepting of that answer that my bounty would automatically be awarded? Luckily, the answerer notified me that the bounty would expire and only give him half (!?).  I understand that:   Others can now offer bounty on a question they didn't ask – it makes sense that bounty would have to be manually in those cases. Bounty can be auto-awarded when it expires.   However, I don't understand why with what seems like the most common scenario, we wouldn't auto-award the bounty to the answerer of the actual accepted answer. What is the purpose of making it more difficult to do what is obviously intended?  Note: I didn't notice  or maybe just didn't realize that the bounty system had changed since I had last used it. This popup should make it clear that "you haven't awarded your bounty to this answer" which is not intuitively obvious, which should lead us to question why awarding the bounty is a separate step.


I saw a couple of men walking out of the store.  Is it ok to interpret the phrase a couple of men to be 3 or 4 men, instead of only two? OR Does it only mean two, I mean, two man only here?  I think it means two to five, which means it does not mean two only. Could you help me clarify it?  Thank you always.

Today I said some event was a couple of weeks away. A native speaker from Australia corrected me and said, no it's at least three weeks away. What followed was a discussion as to whether a couple always means two, or if it can mean more than two.  What does a couple, in particular a couple of weeks, mean to a native speaker?  According to :        Two partners in a romantic or sexual relationship.   Two of the same kind connected or considered together.   (informal) A small number.      According to :        two people or things of the same sort considered together:   'a couple of girls were playing marbles'   [treated as singular or plural] two people who are married or otherwise closely associated romantically or sexually:   'in three weeks the couple fell in love and became engaged'   'a honeymoon couple'   [informal] An indefinite small number      Yet my colleague — a native speaker — insists that a couple never means three, although there can be a small error bar on the two. We asked one other native speaker who agrees with him, yet three non-native speakers point at the above-mentioned sources to claim they're wrong. But it's a bit tricky for non-native speakers to claim native speakers are wrong. Note that both native-speakers are from Australia/New Zealand.


I recently came across this command in bash:  cat > filename << EOF   I do not understand the << EOF part. Googling the << operator, I only came across regular shift arithmetic left. Playing around with it gave me no insight either.  Any explanation would be appreciated!

I often see tutorials online that connect various commands with different symbols. For example:  command1 |  command2 command1 &  command2 command1 || command2     command1 && command2   Others seem to be connecting commands to files:  command1  > file1 command1  >> file1   What are these things? What are they called? What do they do? Are there more of them?    .


I wanted to place a data inside a variable inside an IF statement based on an output of my get class, but it doesn't reflect on the variable when printed. It only says 0.   Code:   ProcessBuilder builder = new ProcessBuilder("python3", "/home/pi/Desktop/ML/scripts/image-label.py");     Process rt = builder.start();     int exitCode = rt.waitFor();     BufferedReader in = new BufferedReader(new InputStreamReader(rt.getInputStream()));     BufferedReader err = new BufferedReader(new InputStreamReader(rt.getErrorStream()));      //JOptionPane.showMessageDialog(null, "Python file output:");     String line;     int type = 0;     BufferedReader reader;     if (exitCode != 0) {         reader = err;     } else {         reader = in;     }     while ((line = reader.readLine()) != null) {         JOptionPane.showMessageDialog(null, "Classifying Successful. Result is " + line);         if (line == "nhigh plow ksufficient ph cpr 5 4")         {             type = 1;         } else if (line == "nmedium plow kdefficient ph cpr 5 8")          {             type = 2;         } else if (line == "nmedium plow kdefficient ph cpr 5 4")         {             type = 3;         } else if (line == "nmedium pmedium kdefficient ph bcg 5 2")         {             type = 4;         }     }   I have initialized the variable "type".  Am i doing something wrong? Any help is appreciated!

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?


given the following sequence $$ p_{n} = \frac{1}{n-1} $$ I am tempted to say that for n=1 the sequence assumes an infinite (and thus unbounded) value but still the sequence converges to zero as n increases. I am of course wrong because this contradicts theorem 3.2c of Baby Rudin which states that "if a sequence is convergent in a metric space then it's bounded". What am I missing? Maybe 1/0 is not a mathematical defined value? I would be greatly thankful for an answer. Erma

For the sequence 1/(n-1): x1 is undefined. I think that makes the sequence unbounded. However I can prove from definition that the sequence is convergent. And there is the theorem that all convergent sequences are bounded. So what am I missing?


My laptop was closed in sleep mode, and the screen was blank (dark) when I opened it this morning. I rebooted it, and I get the POST, then the 'Ubuntu' boot-up window, then about a minute later the screen goes to a terminal mode and the following is what the screen displays:   'BusyBox v1.27.2 (Ubuntu 1:1.27.2-2ubuntu3.2) built-in shell (ash)' /nl (initramfs)  and a blinking cursor. Have done reboots and restarts from a total halt, and no change. What can/should I do at this point? What should I download if anything? Need to get it to where, at a minimum, I can extract the data. Thank in advance for any help.

I am running an HP pavilion dv6000 dual boot win7 and Ubuntu 12.04. (well, up until today).  After a reboot, the boot process drops to the BusyBox shell and I end up at the prompt:  BusyBox v1.18.5 (Ubuntu 1:1.18.5-1ubuntu4) built-in shell (ash) Enter 'help' for a list of built-in commands.  (initramfs)   I've been researching others who have had this same problem, but haven't been able to find any of those solutions to work for me.  I tried the method described , and after the final command   mount -t ntfs-3g /dev/sda1 /root -o force   it does nothing and gives me another (initramfs) prompt.  I can boot to a live CD (USB) and get to a terminal, but it doesn't seem to do much good, as I can see the /dev/sda1 in the ls command, but it doesn't recognize it when I try to cd to it.  One more question: using the command fdisk -l how can I tell which mount point (sda1/sda2) is my windows partition and which one is Ubuntu?


I have been learning javaScript lately but I got confused in understanding the concept of closures.How does JavaScript closures actually work ?

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


How can we show that charges should go to the surface of a conductor, assuming that system should minimize its energy? (With no additional assumptions and maybe using variation method!)

I’ve been told that coulomb repulsion pushes excess electrons to the surface of a conductor (i.e. sphere) electrostatic equilibrium, and this symmetry causes the net electric field inside to be zero. However, why can’t excess charges just be evenly distributed throughout the sphere? Would that symmetry not cancel the fields from each charge?  It would be helpful if anyone can provide a diagrammatic answer.


If there are two coprime numbers a and b, then are a^2 and  b^2 also coprime ?

So, if $\gcd(a,b)=1$, then $\gcd(a^2,b^2)=1$ means $1=ax+by$, and want to show $a^2x+b^2y=1$. By squaring $1=ax+by$ both sides, I get, $1=(ax)^2+b(2axby+by^2)$. It doesn't help my proof. Please help me with this proof.


My friend set up Pokemon Go on my phone using his own Google account details. He now wants to open a Pokemon game for himself, using those same details. Is there any way I can 'switch' my Pokemon game to a different Google account set up in my name (I'm on Level 22 and couldn't face starting again!)?

I've been playing the game a while now and have ranked up considerably. I'm wondering if there is any way to change to a different Google account and still keep all of my Pokemon/items etc, as I stupidly used my university gmail account when I first downloaded the app (which will be automatically deleted in September).   Is there any way to transfer my trainer/Pokemon/items etc to a different Google account?


I play Minecraft on my Xbox360. I want to add mods on my Xbox360 but how do I do that? I would like to play the Pixelmon mod on my Xbox360 because I like Pokemon, but I don't know how.

I'm a huge fan of visual mods but I often only see mods done by PC gamers and not console gamers.   I've heard that in order to mod a console game all you need to do is download the mod onto a USB and stick that into your console. Is it really that easy?  I ask if it is difficult because i've never seen Xbox gamers use visual mods that make the game look cool/more interesting. I've only seen players mod or hack the game for online purposes.   Which brings me to my next question,   If modding isn't (or even if it is) difficult to do on an Xbox 360 can it be dangerous to the game or the system itself?


Suppose I have two independent samples. How can I test if the two samples have been drawn from the same distribution using a permutation test? The sample sizes are equal. The population distributions are unknown.

If you want to test whether two variables follow the same distribution, would it be a good test to simply sort both variables, and then check their correlation? If it is high (at least 0.9?), then the variables most likely come from the same distribution.  With distribution here I mean "normal", "chi-square", "gamma" etc.


I installed Windows 10 preview but now I want to re-install Windows 8 or Windows 8.1 How can I get my license key back so that I can do this? The computer was supplied with Windows 8 pre-installed.

As I understand it, OEM computers that come with Windows 8 preinstalled has the license/product key stored in the BIOS/on the motherboard somewhere.   If you do a clean install (*) of Windows 8 (for example with an ISO from MSDN) on an computer which came preinstalled with Windows 8, will it recognize that it already has a license? Or will it require you to purchase a new Windows 8 license to activate it?  (And excuse me if I have the terms confused, hopefully the meaning comes across.)    (*) Wiping the drive, perhaps because it has been corrupted in some way and ordinary recovery/repair is impossible.


I have an old Minolta Maxxum 7000 camera and 50mm lens (photos below). I would like to mount the lens on my Canon 5D Mark II. Is  the one I need?

I just recently bought my first DSLR, a Canon Rebel t2i/550d. I use it mostly for video and it works wonderfully. I bought the kit lens with it, but I am looking to expand my lens collection. I found a set of old Minolta lenses from my dad, and I was wondering if I could use them on my new camera. The lenses are: a Sigma UC zoom 28-105 f4-5.6, a Minolta Maxxum zoom 70-210mm, a Minolta Maxxum zoom 28-58mm and a Kalimar 500mm lens. I know about the crop factor and that the auto focus won't work, but that does not bother me. Is there an adapter for Minolta AF/Sony to Canon EF mount? Any help is appreciated. Thanks!


I want to know is there any way to detect that the current server i am using is physical box or Hyper V Virtual machine.  Is there any thing in windows that could tell me about it? Any setting, registry key in windows ? Or any script that could tell me that?  I do not have physical access to server, only can logon to server.

Is it possible, from within a windows 2008 virtual private server, to tell if the image is hosted in Hyper-V or some other virtualization technology? For example, are there any guest-os extensions that might be installed?  Background: I previously bought a VPS server from a company who offer VPS images hosted on either Virtuozzo or Hyper-V. I thought my original server was on Hyper-V, but it turned out I bought the wrong package. Now that the month is over I've ordered another server, and want to check I haven't made the same mistake.


I need to check a string is a valid SHA1 string, like    '418c1f073782a1c855890971ff18794f7a298f6d'   I didn't know the rules for that, for example whether a number and a letter is a must? or how many number or letters are minimum?  Could anybody advise any regex for matching in python?

I'm trying to match SHA1's in generic text with a regular expression.  Ideally I want to avoid matching words.   It's safe to say that full SHA1's have a distinctive pattern (they're long and a consistent length) - so I can match these reliably - but what about abbreviated SHA1's?  Can I rely on the presence of numbers?  Looking at the SHA1's in my commit log - numbers always appear in the first 3 characters. But is this too short? How many characters of SHA1 do I need to consider before I can assume a number would have appeared?    This does not have to be 100% accurate - I just need to match an abbreviated SHA1 99% of the time.


I am trying to vertically align a button within a row (bootstrap). I can't get it to work out... any tips?

         <input class="form-control" name="new-project" value="" placeholder="Type project name"></input>

         <button type="button" class="btn btn-sm" style="position: absolute; vertical-align: middle">Save</button>

I have a div with two images and an h1. All of them need to be vertically aligned within the div, next to each other. One of the images needs to be absolute positioned within the div. What is the CSS needed for this to work on all common browsers?

testing...


I've been reading up on druid spells for future use and was quite interested in the  crowd-control abilities of both Transmute Rock and Wall of Thorns, especially since  Transmute Rock doesn't require concentration.  Both of the spells have a similar clause   (PHB, p. 287):     A creature can move through the wall, albeit slowly and painfully. For every 1 foot a creature moves through the wall, it must spend 4 feet of movement.    (XGtE, p. 169):     The ground in the spell’s area becomes muddy enough that creatures can sink into it. Each foot that a creature moves through the mud costs 4 feet of movement,   So my question is, if they were cast together, would a single feet of movement costs 8 feet of movement(or possibly 16) instead of 4? One could argue that WoT mentions solid ground, but you could make the mud only 5-10 feet deep while the thorns are 10-20 feet high.  I also have a side-question to this, if they did work together, would you rule it to be difficult terrain or would there be the need for a third spell like  to turn the terrain difficult? Or would the mud already be considered the terrain and therefore it wouldn't be possible to actually turn the terrain any more difficult.

Looking into  prompted this inquiry:  What happens when you move through a wall of sand on difficult terrain?  This involves the understanding that wall of sand changes the cost of moving 1 foot to 3 feet and that difficult terrain typically changes the cost of moving 1 foot to 2 feet.


I think Markdown google-code-prettify has some incorrect lexical rules for Java (and possibly other languages).  It correctly identifies this code block from  as being written in Java:  Gl.glLoadIdentity(); float tamaño = texto.Tamaño; double tan = texto.Orientacion.Y / texto.Orientacion.X;   but as you can see, the syntax highlighting of one of the identifiers is messed up.  I am guessing that it does not consider the non-ASCII character 'ñ' to be part of an identifier, whereas Java itself does consider it to be part of the identifier.

I noticed that sometimes my code gets highlighted in different colors when rendered.   What is syntax highlighting? How does it work? Why isn't my code being highlighted correctly? How do I report a bug or request a new language? How do I use syntax highlighting? What languages are currently available on Stack Exchange?


I just installed Ubuntu 16.04 but the wifi does not seem to work. I have run the following code and  :  wget -N -t 5 -T 10 https://github.com/UbuntuForums/wireless-info/raw/master/wireless-info && chmod +x wireless-info && ./wireless-info

This issue happens only on UEFI systems with enabled Secure Boot.  When I try to install DKMS modules like VirtualBox, Nvidia, or Broadcom drivers, they do not install and I get Required key not available when I try to modprobe them.  VirtualBox complains that vboxdrv is not loaded.  Broadcom wl driver is shown in lspci -k as a kernel module but is not in use. sudo modprobe wl throws Required key not available.  Also this issue may happen when I install some kernel modules from git sources.  This issue may appear after a kernel update as disabled wireless adapter, black screen after a reboot, etc.   How can I fix it?


t  is a simple script What is different between two case below :  $ .  t   and  $ ./t

What's the difference between executing a script like this:  ./test.sh  and executing a script like this:  . test.sh?  I tried a simple, two-line script to see if I could find if there was a difference:  #!/bin/bash ls   But both . test.sh and ./test.sh returned the same information.


Is there a formula that allows me to calculate the following:-  I have an investment balance of P growing at annual rate of r, what is the monthly withdrawal so that at the end of T years the balance is 0.

As a follow-up to this , what is the minimum size of a nest egg to support 30 years of $5,583.33 monthly distributions? I want the $5,583.33 to increase with inflation each month.   The present value of the first payment should be $5,583.33.  First withdrawal will be in 20 years: $5,583.33*(1 + 0.0033)^240 = $12,310.86   Here is what I've pieced together from this :  Total withdrawals:          n = (30 years)(12 months) = 360 payments Inflation per period:       i = 4.0% per year / 12 = 0.3333% per period) Return per period:          m = 8.0% per year / 12 = 0.6666% per period) Periods until 1st payment:  o = (20 years)(12 months) = 240 periods First payment amount:       w = $67,000 / 12 = $5,583.33 (today's dollars)  p = ([(1 + i)^o]*[(1 + m)^-n]*((1 + i)^n - (1 + m)^n)*w)/(i - m)   p = ([(1 + 0.0033)^240]*[(1 + 0.00667)^-360]*((1 + 0.0033)^360 - (1 + 0.00667)^360)*5583.33)/(0.00333 - 0.00667) p = $2,594,790.06  where  n is the number of payments to be received o is the number of the period at the end of which the first payment is received w is the payment amount m is the pension fund's periodic rate of return i is the periodic inflation rate   Is this the right equation? From what I could find on Google, this calculation is called the . Is this correct?    Is it correct to say that $2.5 million is the nest egg balance 20 years from now on the day the first withdrawal is made? And that $2.5 million is not in today's dollars but in equivalent dollars 20 years from now?


Given $h_n(x) = \sqrt{x^2+\frac{1}{n}}$, I'm asked to first compute the pointwise limit of $h_n$ and then prove that it converges uniformly on $\mathbb{R}$. For pointwise convergence, I think that I'm supposed to fix $x \in \mathbb{R}$ and consider the $lim_{n\rightarrow \infty} \ h_n(x) = lim_{n\rightarrow \infty} \sqrt{x^2+\frac{1}{n}} = lim_{n\rightarrow \infty} \sqrt{x^2} = |x|$, so I say that $h_n \rightarrow h$ pointwise where $h:\mathbb{R} \rightarrow\mathbb{R}$, $h(x) = |x|$.   I'm having trouble showing that $h_n\rightarrow h$ uniformly. Given the definition of uniform convergence $\forall \epsilon > 0, \exists N(\epsilon)\in\mathbb{N}; |h_n(x)-h(x)|<\epsilon$ it seems that I would need to produce an $N(\epsilon)$ such that this inequality holds. However, I'm not having any luck with manipulating this inequality in order to find an appropriate $N(\epsilon)$. Is there another way to do it or a trick I'm not seeing? Thanks for the help!

$f_n(x) = \sqrt{x^2 + \frac{1}{n^2}}$ converges pointwise in a set $E = [0, \infty)$ to $f(x) = x$.   This problem reminds me a lot of how $\frac{x}{n}$ fails to converge uniformly to $f=0$ on $[0,\infty]$, but does converge uniformly on $[0,a]$. However, when we proved that we used the definition of uniform convergence. I do not wish to do that here.  I wish to use the Weierstrass test here. And that is where I'm stuck. I cannot find $M_n = \sup\limits_{x \in E} |f_n(x)-f(x)|$. Can someone help me out here?


I am scaling images to fit within a div and I want to center them with letterboxes by using positions, but when I try to get the width of the element with .width() immediately after setting the height, .width() returns 0. For example: $(image).css("height", "100%"); console.log($(image).width());  This echoes 0 to the console, but if I call $(image).width() from the console sometime later, the correct value is given. How can I get the width of the <img> element immediately after I change it's height? Edit: So my code goes something like this: $(window).load(function(){     cSCMH(); });  function cSCMH() {     //Some other code     for(var i = 0; i < $("sc mh im img").length; i++)     {         var image = $("sc mh im img")[i];                  //More code         $(image).css("height", "100%");         console.log($(image).width());     } }  The console still receives 0  Edit 2: Okay so I think I know what the root of the problem is. The images don't appear to load into the page until they are made visible on the screen (I have them in a tab div where the display is set to none onload). Is there any way to force the images to load even though they are not visible?  I have confirmed this is the issue. The images are not loaded until the div's display is set to block. How can I make the images load in onpageload instead?

I am creating a jQuery plugin.  How do I get the real image width and height with Javascript in Safari?  The following works with Firefox 3, IE7 and Opera 9:  var pic = $("img")  // need to remove these in of case img-element has set width and height pic.removeAttr("width");  pic.removeAttr("height");  var pic_real_width = pic.width(); var pic_real_height = pic.height();   But in Webkit browsers like Safari and Google Chrome values are 0.


I want to install ubuntu 18.04 LTS on my computer. But I am a little worried about system requirements. I can find 'Recommended' System Requirements on ubuntu website. But I am unaware of 'Minimum System Requirements' as they have been discontinued for publishing on the ubuntu website after the release of version 12. I have 512MB of RAM, 1GHz Processor and 8 GB of storage. I doubt that I might be able to run it as I saw my friend running version 16 on a age-old computer a few months back. Would I be able to run ubuntu on my system. I don't want to try any other OS or Linux disro.

For a given hardware configuration, how do I find out if Ubuntu will run on it? What considerations should I take into account when choosing an Ubuntu version and  such as:    with a lighter desktop than the usual Gnome and Unity  with the even lighter LXDE desktop   Obviously Ubuntu does not run on some processor architectures. So how do I go about choosing the right version and derivate. How can I find out the minmal system requirements?


What is appropriate to use here, who or which?       There are around 50 companies who/which deliver scanning services to private and business consumers.

What is the correct relative pronoun for "government"? Which of the following phrases is correct? I am writing for an American [English] audience.     The Queensland Government, who licenses several casinos, ...   or     The Queensland Government, which licenses several casinos, ...


That's my partitions. I'm trying to dual boot Windows 8.1 and ubuntu 14.04, and I've disabled secureboot, fastboot, and all that crap. I'm trying to install it with UEFI.  What do I need to do in this box to install it? Are there too many partitions? What can I do? If you know the answer, please tell me what to do. Thanks.

I would like to see a full how-to guide on how to install Ubuntu.


At short wavelengths, our light detectors tend to be photon counters (e.g. CCD light sensor). At longer wavelengths, we use antennas and bolometers that tend to add up energy instead of counting photons. What is the longest wavelength at which we have "single isolated photon" type detection? Or, at least low number of discrete photons counted directly?

says that a photon of  to $10^{-62}$ kg has been detected:     10×10−62 kg   Mass equivalent of the energy of the lightest photon   detected [citation needed]   This equates ($mc^2=E=hf=h\frac{c}{\lambda}$) to a wavelength of $\lambda=2.2\times 10^{20}$ m (roughly a million ly)! Can anyone provide a citation for this measurement? And how can such a large wavelength/low energy photon be detected?  Edit  Apart from the quotation (true/false un/reliable un/documented ....), I'd like to learn about the lightest photon detected, or about the instrumental limit: what is the lower limit of energy that can be registerd by an intrument (or the greatest wavelength), and how it is done? For example, can you detect a radiowave of 1 Hz?


Im trying to make lines of code where it checks if a file with a name like "text1.txt" exists in a directory. If it exists it will proceed to run the program, if it doesnt it will do something else.

How do I check whether a file exists or not, without using the  statement?


Let $p$ be prime. If a group has more than $p-1$ elements of order $p$, why can't the group be cyclic?  Can I assume that the group must be finite group since there is at least one element with finite order?   And I am wondering now if all cyclic groups are finite, or all finite groups are cyclic?

I need help to prove the following result   Let $p$ be a prime. If a group has more than $p − 1$ elements         of order $p$, why can’t the group be cyclic?   Thanks for the help.


If I brought a card with altered art, but nothing else changed on it such as this one:  to Friday Night Magic would I be allowed to use it?

Just out of curiosity, what can I do to the card, so it's still legal to play it in official tournaments?   Can I draw something over ruling texts?  Can I draw something over artwork? Can I draw something over mana cost? Can I draw something over its name?   I'll be glad to see some official rulings about it. :)


Let $G$ a graph on $n$ vertices. Prove that $$\chi(G)+\chi(G^c)\leq n+1,$$ where $chi$ denote the minimum vertex coloring such that no two adjacent vertex has that same color.   My proof (which is doesn't work):  By induction, for $n=0$, there is nothing to prove. Suppose the assumption true. Let $G$ a graph on $n+1$ vertices $\{v_1,...,v_{n+1}\}$ and let $\tilde G=G\backslash \{v_{n+1}\}$. By hypothesis,  $$\chi(\tilde G)+\chi\big(\tilde G^c\backslash \{v_{n+1}\}\big)\leq n+1.$$  Suppose that $\deg_G v_{n+1}=m\leq n$, then $$\chi(G)= \chi(\tilde G)+m+1.$$ Moreover, $\deg_{G^c}v_{n+1}=n-m$ and thus $$\chi(G^c)=\chi\big(\tilde G^c\backslash \{v_{n+1}\}\big)+n-m.$$  We conclude that  $$\chi(G)+\chi(G^c)\leq \chi(\tilde G)+\chi\big(\tilde G^c\backslash \{v_{n+1}\}\big)+n+n-m\leq n+1+2n-m=3n+1-n$$  and thus it doesn't work.  Question : How can I prove he claim ? (any proof is welcome, but I need an induction proof).

How to prove, that the sum of chromatic numbers of graph and it's complement is smaller then the number of vertices incremented by one?  $\chi(G)+\chi(G')\leq n+1$  The notes from my classes say to color the first graph using sequential algorithm with vertices ordered by their degrees (the ones with lowest appear first). We would get $k_1$ colors, then we color the graph $G'$ in the backwards order and get $k_2$ colors, and the sum $k_1+k_2$ in my notes is magically smaller than $n+1$, but I just don't see why...


I have a problem because I want the nether portal to teleport me to a portal I made on the roof of the nether, and for that I went to the nether, destroyed the nether portal and created the new portal on the roof. and I teleported to where I wanted, but I went back and instead of teleporting to the portal that creates teleport me to a new one Thanks for the help

I have recently build a platform above my house at y=250. As my house is at ground level, I would prefer not to have to build a tower every time I wish to get up there, and ideally I would like to not have a tower visible between the platform and my house.  With this in mind, I decided that nether portals would be the way to go. I have a nether portal in my house at y=57 and one on my platform at y=250, I also have portals in the same places at y=70 and y=115 in the nether.  Unfortunately, the portal at y=155 in the nether sends me back to the portal in my house. I understand that this is because the house portal is closer. Is there any possible way for me to travel to my platform using nether portals? Or failing that, any way to travel there without building something between my house and the platform?


I need to write a program that continuously asked for the input from a user. However, when the user inputs "None", the program should stop asking for the input and print out everything that was input before "None" was input. (EXCLUDING "None").   I am using an array list. However, when I input "None" the program still asks for user input.  Here is my code:   import java.util.ArrayList; import java.util.List; import java.util.Scanner;  public class ShoppingList {  public static void main(String[] args) {      List<String> Items = new ArrayList<String>();      Scanner keyboard = new Scanner(System.in);     System.out.println ("Enter name of item: ");      String item;      while(keyboard.hasNextLine()) {         item = keyboard.nextLine();          if (item != "None") {             System.out.println("Item added: " + item);             Items.add(item);     }       else        break;     }      System.out.println("End of list");     System.out.println();      for (String i : Items) {         System.out.println(i);          }      }  }

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?


If I search for views:1..1, I get numerous results. Most of them have far more views than just one, however. Like 27 views sometimes.  You might assume caching causes newer questions to stay in the list, but none of the results are new at all (well, some may be new, but not most). I get a lot of stuff from 2015, for example.  While  would explain some of the results, it utterly fails to account for questions like this one: . It has a number of views in addition to two answers (one of which is a self answer). Or this question:  which has four up votes.  I didn't see the connection when I first asked this question, but these questions were all migrated from another site.    Here are searches for three big sites, which have enough migrations that just slip through the cracks:        It's a bit sad to know that numerous questions were migrated just to be ignored on another site...

On Travel-SE, there are currently  awarded. However, when one uses the search interface with views:2500, . The two numbers should be equal, and it's difficult to explain the difference with caching issues.   As the number of views is ever-increasing (as we all know, it's impossible to un-see things, unfortunately), this seems like a bug. Or perhaps I'm doing something wrong?  Also, some questions which should qualify don't appear on the search page. See , for example.  None of these questions are closed or deleted: views:2500 closed:yes and views:2500 deleted:yes return 0 results.  Eeeek?


im fairly new to neural networks. I want to ask what exactly does the activation output, is it the probability the combined summation of inputs and weights lead to a match for the next neuron? Thanks

I have studied the activation function types for neural networks. The functions themselves are quite straightforward, but the application difference is not entirely clear.  It's reasonable that one differentiates between logical and linear type functions, depending on the desired binary/continuous output but what is the advantage of sigmoid function over the simple linear one?  ReLU is especially difficult to understand for me, for instance: what is the point to use a function that behaves like linear in case of positive inputs but is "flat" in case of negatives? What is the intuition behind this? Or is it just a simple trial-error thing, nothing more?


I'm an engineer who recently became a member of a county Grand Jury in California.  For those who don't know what that means, it's a body of 19 people who - for a year - have the responsibility to investigate various aspects of the county and the cities and special districts, etc., in the county.  The object of an investigation is to create a report containing research, findings, recommendations and such which is then provided to the entity or entities mentioned in the report who then must respond.  The set of all reports during the year is then included in the full report of the Grand Jury. OK, that's the background.  In reading past reports (which are online) I have found pretty much all of them to be profoundly uninteresting as far as layout and design are concerned.  What I expect has occurred in the past is some juror starts using Microsoft Word pretty much straight out of the box with no eye towards the niceties of layout and design - probably due to not having any background (or, in my case, talent) for layout and design. I do, however, understand the need of separating layout and design from content - something Microsoft Word doesn't do well.  I admit I have no particular skill at graphic design but would still like to produce a product at the end of our service which not only has properly formatted citations, an index, good typography and excellent content, but which also looks good.  Can anyone offer advice as to where I might find help along these lines?  That is, is there (for example) a Graphic Design class that might wish to give us a design (and get it published by the County) that I can use?  I don't know that I have any actual budget for this but someone might want to do it for the publicity. Is there a significant possibility that I might succeed in getting some help?

Thanks to the internet, graphic design and programming are becoming increasingly overlapping fields.   As a programmer, I constantly find myself needing basic knowledge of Graphic Design, but have trouble locating thorough yet concise graphic design learning resources, and instead usually find bits and pieces of knowledge applicable to the task at hand.  Can you guys offer some tips or recommend some good books, tutorials, blogs, and websites which provide a beginner level overview of web design that have been, in your experience, effective and high quality learning materials. I'm not looking for tips on how to use image editing tools, but assuming a basic grasp of those, which resources and advice will best help a new designer create professional looking designs?


I have a set of data that has $n$ samples described by $m$ variables. I do a PCA to reduce it to just 2 dimensions so I can make a nice 2D plot of the data. I understand that the $x,y$ coordinates (i.e., the PCA scores) for the plot are calculated by basically summing the products of the original data (after centering) by the loadings for each variable, so:  $$\mathrm{PC}_1 = X_1L_1 + X_2L_2 + ... + X_mL_m.$$  My question is, if I pick an arbitrary point in the PCA space (i.e. a value for $\mathrm{PC}_1$ and $\mathrm{PC}_2$, or $x$ and $y$ in my plot), is there a convenient way to translate that back to a set of the original values (i.e., $X_1,X_2,\dots,X_m$)?    Note 100% reversal is obviously not expected (since I'm only using 2 PCs), so a decent approximation is fine.

Principal component analysis (PCA) can be used for dimensionality reduction. After such dimensionality reduction is performed, how can one approximately reconstruct the original variables/features from a small number of principal components?  Alternatively, how can one remove or discard several principal components from the data?  In other words, how to reverse PCA?    Given that PCA is closely related to singular value decomposition (SVD), the same question can be asked as follows: how to reverse SVD?


I purchased a Pyle 9" TFT monitor for use in an automobile with back-up camera. The wiring is designed to connect directly into the car's harness. I have no info on the electrical requirements other than, of course, 12V from the car.  I plan to use this monitor inside to make my nephew a headboard with digital photo/video/netflix frame. I've wired some indoor 12V lighting before, but probably just got lucky. I want to know if a similar power supply will work here? I'm looking at a DC 12V 2A Power Supply Adapter for 110V-240V AC 50/60hZ (whatever that means?). Does that sound like that will work? Should I get the 3A version to be sure since I read on this website the whole "amps are like apples" analogy?

Power supplies are available in a wide range of voltage and current ratings.  If I have a device that has specific voltage and current ratings, how do those relate to the power ratings I need to specify?  What if I don't know the device's specs, but am replacing a previous power supply with particular ratings?  Is it OK to go lower voltage, or should it always be higher?  What about current?  I don't want a 10 A supply to damage my 1 A device.


I wan to know how this letter O with a vertical line for operator null in maths. Thanks.

I know what my symbol or character looks like, but I don't know what the command is or which math alphabet it came from. How do I go about finding this out?


I have downloaded 8-day MODIS LST products (MOD11A2) for the whole year of 2011  and is there any method in R to extract those pixels in clear sky conditions with  emissivity error < 0.01 and LST error < 1 K and average LST values for each pixel to generate only one raster map for 2011? My current code is not complete as below.      lst <- lapply(list.files("D:/LST2011/Surf_Temp_8Days_1Km_v6/LST_Day_1km",                       pattern = "LST_Day_1km", full.names = T), raster)     csd <- lapply(list.files("D:/LST2011/Surf_Temp_8Days_1Km_v6/Days_Clear",                       pattern = "Days_Clear", full.names = T), raster)     mean_lst <- temporalComposite(lst, csd, fun = function(x) mean(x, na.rm = TRUE))

Does anyone know how to handle MOD09A1 Quality flags (QC) in in R?  I was trying to use  package but unable to unlock the QC band.


So I started a project and it mainly revolves around a manhole and a street, and it's raining, but I can't get the manhole to look wet.  One thing I tried was to mix 2 noise textures (one with a low scale and one with a high scale), and mix that with the gloss texture, however that barely changes anything.  The Road has puddles on it, ripples, etc. and practically looks pretty wet, however the manhole looks pretty dry, and I can't seem to figure out what to do to fix it.  I thought about making the ripples (made following Gleb Alexandrov's tutorial) affect the manhole too, however I don't know how to make it in a way that looks realistic, as the manhole has a displacement texture, so adding ripples on it wont really fit.  You can see the material for the manhole below, but the node system is huge, so I color-coded everything.  Dark-Blue: Texture Coordinates, Mapping, and Color Ramps  Bright Red: Mix Shader  Dark Red: Overlay Maps (although I don't think they're having much of an effect, so you can ignore them).  Green: Diffuse Stuff (The two textures are the diffuse and the AO map)  White: Reflection  Cyan (sort of): Gloss

I am trying to recreate a wet road with lights reflecting off of it. I started by making the object glossy but this did not give a very realistic look  I think I need to increase the specularity of the reflection to make it look more real but I can't find this option anywhere in cycles. Also what other techniques can I use to make a surface look wet in blender? I can link directly due to licening but  is what I am trying to recreate.


I want to get first file extension in string using php.  now i use this code.  <?php $string = "aaa.jpgbbb.pngccc.jpg"; if( strpos( $string, $needle ) !== false ) {     list($string) = explode('.png',$string);     echo $string.".jpg"; } ?>   My code only check file extension in string. but can not get first file extension. How can i do ?  . .  For this string first file extension is jpg.  $string = "aaa.jpgbbb.pngccc.jpg";   . .  For this string first file extension is gif.  $string = "aaa.gifbbb.pngccc.jpg";   . .  For this string first file extension is png.  $string = "aaa.pngbbb.pngccc.jpg";

This is a question you can read everywhere on the web with various answers:  $ext = end(explode('.', $filename)); $ext = substr(strrchr($filename, '.'), 1); $ext = substr($filename, strrpos($filename, '.') + 1); $ext = preg_replace('/^.*\.([^.]+)$/D', '$1', $filename);  $exts = split("[/\\.]", $filename); $n    = count($exts)-1; $ext  = $exts[$n];   etc.  However, there is always "the best way" and it should be on Stack Overflow.


I'm running the Storm King's Thunder campaign in dnd 5e, and we are at the portion where the PCs get an airship to travel around in. There are approximately 5-6 lvl 7 PCs, and they have 3 or 4 hard encounters a day. There are two wizards, a warlock, ranger, paladin, blood hunter, sorcerer, and fighter. For the most part, they have had fun with the different weapons and enemies they have faced; however, I find that one or two spellcasting PCs have been using spells such as mind sliver, polymorph, and hypnotic pattern to defeat more challenging encounters, such as one with a roc and wyvern. They make the creature make saving throws with hypnotic pattern and cause the enemy to fall to its death, and using mind sliver makes it even harder, especially on low wisdom creatures like rocs. Or with the polymorph spell, they cause the enemy to become a fish or chicken and throw it off the edge, and since the damage carries over, it kills the monster. I realize it was legal and made fights funnier, but it does get annoying when it's happening in almost every fight. Are there any suggestions on how to keep them on track without them making every encounter easy? I thought of giving the monsters immunity to these effects, but it sounds like a lame excuse for me not being prepared.

I'm running the Storm King's Thunder campaign, and we are at the portion where the PCs get an airship to travel around in, the airship is about 1000ft in the air. There are approximately 5-6 lvl 7 PCs, and they have 3 or 4 hard encounters a day. There are two wizards, a warlock, ranger, paladin, blood hunter, sorcerer, and fighter. For the most part, they have had fun with the different weapons and enemies they have faced; however, I find that one or two spellcasting PCs have been using spells such as mind sliver, polymorph, and hypnotic pattern to defeat more challenging encounters, such as one with a roc and wyvern. They make the creature make saving throws with hypnotic pattern and cause the enemy to fall to its death, and using mind sliver makes it even harder, especially on low wisdom creatures like rocs. Or with the polymorph spell, they cause the enemy to become a fish or chicken and throw it off the edge, and since the damage carries over, it kills the monster. I realize it was legal and made fights funnier, but it does get annoying when it's happening in almost every fight. Are there any suggestions on how to keep them on track without them making every encounter easy? I thought of giving the monsters immunity to these effects, but it just sounds like a bad excuse for me not being prepared.


I've completed all my daily quests for Hearthstone, and I'm now seeing a message telling me to come back tomorrow.    When is tomorrow exactly? I don't see any sort of countdown to be able to tell which timezone is being used as a baseline, nor whether daylight savings time is in effect.

In hearthstone, you receive one quest per day, barring unique quests. What I'm wondering is when exactly does a new day start? I assume it's at a specific global time, so I'm looking for a time in GMT or UTC.  I did find out you need to exit the game and come back to receive new quests, but I'm hoping someone actually knows when i have to do that.


I encounter the situation as follows: My system sometimes gets default two specific errors and display to user's screen. But now, my users would like to display these kind of error messages in a friendly way, not default ones. The two types of message are:     1. Allowed memory size of...      2. Maximum execution time of...   I've already tried to use set_error_handler("someFunction"), but it doesn't handle these kinds of errors. Please note that they are 'Fatal Error(s)' types.  I'd appreciate it if you help me out.  Thanks a great deal!

I can use set_error_handler() to catch most PHP errors, but it doesn't work for fatal (E_ERROR) errors, such as calling a function that doesn't exist. Is there another way to catch these errors?  I am trying to call mail() for all errors and am running PHP 5.2.3.


For any system performing any kind of motion with $n$ degrees of freedom, are $2n-1$ integrals of motion and also $2n$ constants of motion always present? If yes, then is there always a symmetry for each constant? Can the initial conditions be thought as those constants? There are related questions but all have heavy mathematical explanation which I am not aware of yet. Need a theoretical answer

Since the equation of mechanics are of second order in time, we know that for $N$ degrees of freedom we have to specify $2N$ initial conditions. One of them is the initial time $t_0$ and the rest of them, $2N-1$ are initial positions and velocity. Any function of these initial condition is a constant of motion, by definition. Also, there should be exactly $2N-1$ algebraically independent constants of motion.  On the other hand, Noether's procedure gives us integrals of motion as a result of variational symmetries of the action. These integrals of motion are also conserved but they are not always $2N-1$ in number. In consequence, we classify the system by their integrability.  So, what is the difference between the  and ? Why do non- have less integrals of motion when they should always have $2N-1$ constants of motion?


When defining a function, what is the difference between these 2 ways:      function t1() {}     var t2 = function() {}    Is t1 a function itself and t2 a reference to function?

I've recently started maintaining someone else's JavaScript code. I'm fixing bugs, adding features and also trying to tidy up the code and make it more consistent.  The previous developer used two ways of declaring functions and I can't work out if there is a reason behind it or not.  The two ways are:  var functionOne = function() {     // Some code };     function functionTwo() {     // Some code }   What are the reasons for using these two different methods and what are the pros and cons of each? Is there anything that can be done with one method that can't be done with the other?


$$\lim_{x\to0} |x|^{\frac{3}{2}}\ln|x|$$  I don't understand why this limit is equal to 0. What can I use on this limit to get rid of the $0\cdot-\infty$ form?

$$f(x)=\begin{cases} 0 &:& x=0\\[1ex]x^{\frac{2}{3}} \log x&:&\text{otherwise}\end{cases}$$  My thoughts: $\log x$ behaves weird in $(0;1)$ and will not be bounded for any $ x \in V_{\delta} (0) , \delta >0 $  Now is $ x^{\frac{2}{3}}$ small enough to keep $\log x$ in control? How can I show this? Please help. I'm looking for a proof using the definition of continuity.


If it's flat then how a volume can be flat? And I've read that it's actually not flat .....it's a "Poincaré dodecahedral space". Any suggestions for books posts or articles are highly appreciated.

General relativity says that spacetime is a Lorentzian 4-manifold $M$ whose metric satisfies Einstein's field equations.  I have two questions:   What topological restrictions do Einstein's equations put on the manifold?  For instance, the existence of a Lorentz metric implies some topological things, like the Euler characteristic vanishing. Are there any experiments being done or even any hypothetical experiments that can give information on the topology?  E.g. is there a group of graduate students out there trying to contract loops to discover the fundamental group of the universe?


Compute $\displaystyle\lim_{ (x,y)\to (0,0)}\dfrac{x^ny^m}{x^2+y^2}$   Determine with the conditions on $n$ and $m$ for which this limit exists and conditions for which this limit does not exist.   I found that when $x$ approaches $0$ the limit approaches $0$ and as $y$ approaches $0$ the limit also approaches $0$. As $x$ and $y$ approaches $x$ it seems like there are no conditions for $m$ and $n$ which will make the limit exist.

I have some trouble with this: Show that if $a, b \ge 0$, $c, d > 0$ and $\frac{a}{c} + \frac{b}{d} > 1$ then   $$\lim_{(x,y)\rightarrow (0,0)}\frac{\left|x\right|^a\left|y\right|^b}{\left|x\right|^c + \left|y\right|^d} = 0$$  we were not really shown how to evaluate multivariable limits other than trying different paths, which wouldn't work when the limit exists, or by applying the squeeze theorem which is my initial plan. Unfortunately I cannot find a proper bound for the denominator and so I am quite lost right now. Any help would be appreciated.


Having trouble with the Ubuntu GUI. I can log in just fine (see )... everything looks normal there. But as soon as I put in my password, I get . I tried a few different troubleshooting keyboard commands (ctrl+alt+t, crtl+alt+delete), and only the latter worked. I can interact with that window just fine, except I am unable to resize or move it.  The first time I logged in, I got a dialog box that said, "Ubuntu has experienced an internal error. Send error report?" Doesn't say anything now.  Yes I tried restarting it.   Thanks a bunch,  Michael  EDIT: Trying to start a guest session leads to the same problem.

When I login, nothing happens.   I am presented with my desktop wallpaper.    No Dash, no Launcher, nothing.


I've installed ubuntu on a Asus 1015 netbook. Everything worked out of the box except for the Wireless adapter, which i had to install with the Additional Drivers application.  It apparently installed fine and connects to our wireless network, but it only works at a "funny" speed range that goes from 367Bytes to a peak of 3Kb in its best moments. I know for sure the problem is neither the network nor the hardware. Network speeds are normal under windows on this laptop and in other computers with ubuntu aswell.  lspci says the card is a BCM4313 model, but the Addittional Drivers Manager says   these packecege contains Broadcom  802.11 Linux STA wireless driverfor use with Broadcom's BCM4311-, BCM4312-, BCM4321-, and BCM4322 based hardware   seems like it installed the wrong driver... Is there anything I can do? I'm not concerned about compiling the driver or stuff like that, but I'm not sure on where to start... any help or guidance will be very, very appreciated.

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


I've just looked at  with the StackExchange Android App. It looks like this:    When you look at "Original Solution", you can see a code block that has a very long line. Currently, there is no possibility to read this line. When I click on this block, it pops up, but I still can't read the whole line.  I think there should be horizontal scroll bars when the content can't be displayed. Or at least I should be able to "drag" the text so that I can read the rest.

Steps to reproduce:   Find a question/answer with a code block that, when expanded needs to be scrolled horizontally, but doesn't fill the popup vertically. Try and scroll by dragging the area below the code text, but within the code block popup. Be sad that it doesn't scroll horizontally.   I'd like it to be draggable by dragging anywhere within the popup, not just where the popup text is.    Here is a nice code block to test:  public foo() {     return "Very long string! Very long string! Very long string! Very long string! Very long string! Very long string! Very long string! Very long string! Very long string! "; }


I have a Compaq Presario CQ60 with 3 GB ram and 32 bit Operating System and i don't if i should 32 bit since it say 2 GB or less ram. So should i pic 32 bit or 64 Bit.

What is the difference between 32-bit and 64-bit Ubuntu? I've heard the 64-bit platform performs better and can detect more than 4GB of RAM. Also, while some apps haven't ported to 64-bit yet, ia32-libs lets a 64-bit machine run them.  If so, why not promote 64-bit over 32-bit?


I just earned my first 1000 rep on SO. The FAQ says that with 1000 rep you can     Show total up and down vote counts   But I can't figure out how/where I can do that. I don't see any total up/down vote count on questions, nor on answers, nor on users...

Possible Duplicate:        I'm supposed to be able to see the total up/down votes, but I'm way above 1K rep and I still don't see any of .  So how do I see the breakup of votes?


I'm confused about how to correctly punctuate these two. Can someone elaborate? Here's an example:  She said that the pain was 100/10 – i.e. above the top of the scale. She said that the pain was 100/10 – i.e., above the top of the scale.  I think that the first example is correct, but is it?!

It seems that "e.g." is always followed by a comma but "i.e." is not. Why is that?


I am trying to write a mathematical formula for the ARIMA model with order (1,1,0) with drift. Ar1= -0.2923 Drift= 0.0186 How will be the mathematical formula created for this. Is it Ur=0.0186+Yt-1+0.2923*(Y(t-1)-Y(t-2))

What is the equation for an ARIMA(1, 1, 0) Model?    Please note that I fit the model to a time series in R and received an "ar1" coefficient of 0.6017 and that was the only coefficient estimate provided by R.


it came with the driver on the CD, as my computer has no reader, I put it on another computer and copied it to a USB stick, I couldn't use the automatic installer and tried to install it manually, went into the folder and ran the 'make' command and the following error:  make ARCH=x86_64 CROSS_COMPILE= -C /lib/modules/4.15.0-72-generic/build M=/home/mariana/Downloads/rtl88x2bu-driver-master  modules make[1]: Entering directory '/usr/src/linux-headers-4.15.0-72-generic'   CC [M]  /home/mariana/Downloads/rtl88x2bu-driver-master/os_dep/linux/os_intfs.o /home/mariana/Downloads/rtl88x2bu-driver-master/os_dep/linux/os_intfs.c:1433:22: error: initialization from incompatible pointer type [-Werror=incompatible-pointer-types]   .ndo_select_queue = rtw_select_queue,                       ^~~~~~~~~~~~~~~~ /home/mariana/Downloads/rtl88x2bu-driver-master/os_dep/linux/os_intfs.c:1433:22: note: (near initialization for ‘rtw_netdev_ops.ndo_select_queue’) cc1: some warnings being treated as errors scripts/Makefile.build:330: recipe for target '/home/mariana/Downloads/rtl88x2bu-driver-master/os_dep/linux/os_intfs.o' failed make[2]: *** [/home/mariana/Downloads/rtl88x2bu-driver-master/os_dep/linux/os_intfs.o] Error 1 Makefile:1577: recipe for target '_module_/home/mariana/Downloads/rtl88x2bu-driver-master' failed make[1]: *** [_module_/home/mariana/Downloads/rtl88x2bu-driver-master] Error 2 make[1]: Leaving directory '/usr/src/linux-headers-4.15.0-72-generic' Makefile:1986: recipe for target 'modules' failed make: *** [modules] Error 2   i use ubuntu 18.04.3 LTS kernel 4.15.0-72-generic

So I've been experimenting with Ubuntu on and off for a while, but I honestly have no idea what the hell I'm doing. So I have a realtek RTL8812bu WiFi dongle that I'm hoping to get working. I did some research, and came across  that a couple people across two threads said worked for them:  At the bottom it said there is a new version . So somewhere it said it was confirmed to work on kernels up to 4.16, so I checked and I'm on 4.15.0. But the problem I'm having, is what am I supposed to do? There is some installation guide at the bottom that is about as clear as mud to me since I don't know much.


The order of the ${\rm Aut}(G)$, where $G$ is a $p$-group is divisible by $p$.   I saw that this claim is commonly used in many papers but was wondering what the proof for this comes from?

Suppose $G$ is a finite $p$-group (where $p$ is prime), so that $|G|=p^n$ for some positive integer $n\ge 2$.      How can we prove that $|\text{Aut}(G)|$ is divisible by $p$?   Here $\text{Aut}(G)$ is the group of all automorphisms of $G$. I know how to prove this when $G$ is non-abelian. In this case, we look at the action of group on itself by conjugation, i.e. we consider the map $\phi: G\to \text{Aut}(G)$ defined by $\phi(g)=\tau_g$ where $\tau_g: G\to G$ given by $\tau_g(x)=gxg^{-1}$ for each $x\in G$. The kernel of $\phi$ is then $Z(G)$, the center of the group. By First Isomorphism Theorem, we get that $G/Z(G)$ is isomorphically embedded in $\text{Aut}(G)$. Since $Z(G)$ is proper subgroup of $G$ (because $G$ is non-abelian), we see that $p$ divides $\left|G/Z(G)\right|$, so by Lagrange's Theorem, $\text{Aut}(G)$ is divisible by $p$.   But what happens when $G$ is abelian? The above homomorphism $\phi$ is no longer of use, since $\phi$ becomes the trivial map [i.e. $G=Z(G)=\text{ker}(\phi)$].  Thanks for your time :)


When I run the program, it does not tell me in which line I have a nullPointerException, and I have been trying to work this out for hours. Could someone please take a look and possibly fix the code? I am pretty new to Java so I am just getting started here. Please don't mark this as a duplicate, I have already seen the nullpointerException and it doesn't really help, because when I run the program, it doesn't tell me which line the null pointer is in.   Exception in thread "main" java.lang.NullPointerException at Scheduler.executeProcesses(Scheduler.java:13) at Scheduler.main(Scheduler.java:38)   Code:  import java.util.LinkedList;  public class PriorityQueue implements Queue {  Node head = new Node(null);  class Node {     Process process;     Node next;       Node(Process p) {         this.process = p;         this.next = null;      } } Node first; @Override public void offer(Process p) {     Node newNode = new Node(p);     Node previous = null;     Node current = first;      while (current != null) {         previous = current;         current = current.next;     }     if (previous == null) {         newNode.next = first;         first = newNode;     }     else {         previous.next = newNode;         newNode.next = current;     } }  @Override public Process poll() {     Node previous = null;     Node current = first;     //Node temp = current;      while (current.next != null) {         previous = current;         current = current.next;     }     previous.next=null;      return null; }  @Override public boolean isEmpty() {     return first == null;  }   Scheduler class:  import java.util.List;  public class Scheduler {  static double idleTime = 0; static Queue queue = new PriorityQueue();  public static void executeProcesses() {     double currentTime = 0;     System.out.println("Simulation starts with default parameters.");     while (!queue.isEmpty()) {         Process process = queue.poll();         if (process.getArrivalTime() > currentTime) {             idleTime = process.getArrivalTime() - currentTime;             currentTime = process.getArrivalTime();         }         System.out.printf("process %d with priority %d started at time %f.\n", process.getId(),                 process.getPriority(), currentTime);         do {             double currentBurstTime = process.getNextBurstTime();             System.out.printf("process %d has CPU burst %f.\n", process.getId(), currentBurstTime);             currentTime += currentBurstTime;         } while (process.hasMoreBurst());         System.out.printf("process %d with priority %d completes and terminates at %f.\n", process.getId(),                 process.getPriority(), currentTime);     }      System.out.println("Simulation summary");     System.out.printf("CPU idle time: %f\n", idleTime);     System.out.printf("CPU utilization percentage: %f\n", (currentTime - idleTime) / currentTime);     System.out.println("Signature name: " + queue.getSignature()); }  public static void main(String[] args) {     ProcessFactory factory = new ProcessFactory();     List<Process> processList = factory.batchGenerate();     processList.forEach(p -> queue.offer(p));     executeProcesses(); } }

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 have a polygon that I made using the buffer tool on a layer. The problem is, I can't figure out how to send this polygon to the layer I would like it to be on. The yellow polyon is the one I'm trying to move, and I'm trying to move it to the red layer. How can I do this using ArcGIS 10.1 for desktop?

I do a lot of editing, in this case areas. Sometimes I add an area to one shapefile, only to realise a bit later that it should have been in another.   Is there an easy way of copying only that polygon into the proper shapefile? Something along the lines of rightclick the row in attribute table, copy and then paste in the next attribute table.   I do know that I can select the polygon and use , but this seem unnecessary complicated?


I am trying to finish my thesis which will be printed two sided.  Here is the core of my latex document:  \begin{document} \include{garde} \frontmatter \selectlanguage{french} \include{remerciements} \selectlanguage{english} \include{introduction} \mainmatter \include{chapter1} \include{chapter2} ... \end{document}   The problem I have is the fact that the title page (named "garde") and the acknowledgments (named "remerciements") are on the same page. Thus I would like to insert a single page to be the back of the title page. But all the attempts I have made, based on \newpage or other related commands have as result the addition of two pages. Thus the "remerciements" and the introduction begin both on a back page.  Could you provide me help on that topic ? Thanks

I get a blank page between “Acknowledgement” and “Table of contents”. How can I remove it? I used a template from somewhere. The preamble is as follows:  \documentclass[openany,12pt]{ubthesis} \usepackage{amssymb} \usepackage{amsfonts} \usepackage{srcltx} \usepackage{graphicx} \usepackage{amsmath} \usepackage{epsfig} \usepackage{dsfont} \usepackage{url} \usepackage{color, soul} \usepackage{natbib} \usepackage{lscape} \usepackage{subfigure} \usepackage{amsthm} \usepackage{indentfirst} \usepackage[subfigure]{graphfig} \usepackage{float} \floatstyle{plaintop} \restylefloat{table}  \usepackage{setspace} \usepackage{booktabs} \usepackage{tikz}  \usepackage[export]{adjustbox}  \usepackage[titletoc]{appendix} \usepackage{listings}  \usepackage{color}  \definecolor{mygreen}{RGB}{28,172,0}  \definecolor{mylilas}{RGB}{170,55,241} \input{gams.tex}%newly added 0803  \pagestyle{plain} \setulcolor{red} \bibpunct[, ]{(}{)}{;}{a}{,}{,} \def\bibfont{\small} \def\bibsep{\smallskipamount} \def\bibhang{24pt} \def\newblock{\ } \def\BIBand{and}  \widowpenalty=10000 \clubpenalty=10000 \raggedbottom  \newtheorem{theorem}{Theorem}[chapter] \renewcommand{\thetheorem}{\arabic{chapter}.\arabic{theorem}}   \newtheorem{acknowledgment}[theorem]{Acknowledgment} \newtheorem{algorithm}[theorem]{Algorithm} \newtheorem{axiom}[theorem]{Axiom} \newtheorem{case}[theorem]{Case} \newtheorem{claim}[theorem]{Claim} \newtheorem{conclusion}[theorem]{Conclusion} \newtheorem{conjecture}[theorem]{Conjecture} \newtheorem{corollary}[theorem]{Corollary} \renewcommand{\thecorollary}{\arabic{chapter}.\arabic{corollary}} \newtheorem{criterion}[theorem]{Criterion} \newtheorem{definition}[theorem]{Definition} \newtheorem{example}[theorem]{Example} \newtheorem{exercise}[theorem]{Exercise} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{notation}[theorem]{Notation} \newtheorem{problem}[theorem]{Problem} \newtheorem{prop}{Proposition}[chapter] \newtheorem{remark}[theorem]{Remark} \newtheorem{solution}[theorem]{Solution} \newtheorem{summary}[theorem]{Summary} \renewenvironment{proof}{\bf Proof:}{}


Why I get incorrect result.(for example n=3.83 I expect temp=0.83 but when trace my code temp=0.83000000000000007) notice:temp,m and n are double.   n = double.Parse(Console.ReadLine());         m = Math.Floor(n);         Console.WriteLine(m);         temp = n - m;

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


I have been looking to buy a Canon 760D because of its amazing features that it offers in comparison to the currently available list of DSLR's out there. I have previously owned a 550D and had a great experience with that. However the city where I am trying to buy it from is Dammam and they do not have the 760D model available. The only model they have is either Canon 750D (which seems like a bit of a downgrade to me) or Canon 70D. I don't intend to buy the 750D because I feel 760D would be a better choice but because of its non-availability, I was considering going for the 70D. I know the fact that its the lens that counts when it comes to DSLR's:)  I have checked out the reviews and differences  between 760D and 70D however because its a bit more pricier than the 760D, I would like to know if there are that many significant differences worth paying the extra money for. Could the users of these two models comment on what their experience has been with these two models?  Cheers.  Update:  Apart from the weight, battery life and megapixel differences, I see that the NFC feature is not included in the 70D model. Would that mean that I cannot use the 70D to touch and send my pictures to another device? WiFi is included in both but how would not having NFC work out?  Usage:  I usually use my DSLR for food photography, portraits and landscapes at times. I already have a 50 mm f/1.8 lens with me.

I basically decided on a whim (from reading this site, talking to some friends, and always admiring great photos) that I want to get into photography.  Are there disadvantages to starting out with a prosumer camera like the Nikon D7000? I know stuff will be more expensive, but will there also be greater frustration or complexity?  (I am the kind of person who tries to find reasons to justify the extra cost even when I know deep down that it's not necessary...)


how to transpose rows and columns in lightning created by data Table in sfdc  ({     fetchAc : function(component, event, helper) {         component.set('v.mycolumns', [             {label: 'Account Name', fieldName: 'Name', type: 'text'},                 {label: 'Industry', fieldName: 'Industry', type: 'text'},                 {label: 'Phone', fieldName: 'Phone', type: 'Phone'},                 {label: 'Website', fieldName: 'Website', type: 'url '}             ]);         var action = component.get("c.fetchAccounts");         action.setParams({         });         action.setCallback(this, function(response){             var state = response.getState();             if (state === "SUCCESS") {                 component.set("v.acctList", response.getReturnValue());             }         });         $A.enqueueAction(action);     } })

Canonical Question  I want to do <some really cool thing> with a lightning:datatable, but I can't seem to figure out how to do it. I checked the , but I did not see a way to implement <this really cool feature I need>.  Perhaps I want to provide tooltips, or a pick list, or alter the behavior of the menus, or display images, or show a custom component I created, or define a new row-level click behavior, or alter the keyboard event handlers, etc.  Can I somehow do this?


Installation of Unity-tweak-tool is stuck at 0% and showing nothing. I've to press CTRL+C to stop. I've checked internet connection and it is working fine.

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


Is voltage divider is a good option for supply voltage to an IC ?  I am working with a 555 timer, MAX232 ,an Inverter SN74LVC and with a 12V relay.  I heard that voltage devider is not a best way to step down 12v to 5V  for supply voltage.

When would you use a voltage regulator vs a resistor voltage divider?  Are there any uses for which a resistor divider is particularly bad?


I'm creating this array:  A=itertools.combinations(range(6),2)   and I have to manipulate this array with numpy, like:  A.reshape(..   If the dimensions is A is high, the command list(A) is too slow.  How can I "convert" an itertools array into a numpy array?  Update 1: I've tried the solution of hpaulj, in this specific situation is a little bit slower, any idea?  start=time.clock()  A=it.combinations(range(495),3) A=np.array(list(A)) print A  stop=time.clock() print stop-start start=time.clock()  A=np.fromiter(it.chain(*it.combinations(range(495),3)),dtype=int).reshape (-1,3) print A  stop=time.clock() print stop-start   Results:  [[  0   1   2]  [  0   1   3]  [  0   1   4]  ...,   [491 492 494]  [491 493 494]  [492 493 494]] 10.323822 [[  0   1   2]  [  0   1   3]  [  0   1   4]  ...,   [491 492 494]  [491 493 494]  [492 493 494]] 12.289898

How can I build a numpy array out of a generator object?  Let me illustrate the problem:  >>> import numpy >>> def gimme(): ...   for x in xrange(10): ...     yield x ... >>> gimme() <generator object at 0x28a1758> >>> list(gimme()) [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] >>> numpy.array(xrange(10)) array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9]) >>> numpy.array(gimme()) array(<generator object at 0x28a1758>, dtype=object) >>> numpy.array(list(gimme())) array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])   In this instance, gimme() is the generator whose output I'd like to turn into an array. However, the array constructor does not iterate over the generator, it simply stores the generator itself. The behaviour I desire is that from numpy.array(list(gimme())), but I don't want to pay the memory overhead of having the intermediate list and the final array in memory at the same time. Is there a more space-efficient way?


I would like to build an ensemble classifier (possibly boosting) on a huge training dataset (>> 1e7 examples) where the proportion of positive examples is around 5%. And what I am interested in are recall and precision of positive class.  If I train on the whole dataset, does the small proportion of positive examples affect the performance of the classifier? I'm not sure because the absolute number of positive examples is big. Do I need to randomly select number of negative examples so the number of positive examples is around the same as the negative examples?

This is a question in general, not specific to any method or data set. How do we deal with a class imbalance problem in Supervised Machine learning where the number of 0 is around 90% and number of 1 is around 10% in your dataset.How do we optimally train the classifier.  One of the ways which I follow is sampling to make the dataset balanced and then train the classifier and repeat this for multiple samples.   I feel this is random, Is there any framework to approach these kind of problems.


For the sake of contradiction, we assume $n$ is a factor of $n+1$. Then by definition of divisibility, $nk = n+1$ where $k\in\mathbb{N}$. Case $1$: $k = 1$. Then $n = n+1$ which is a contradiction. Case $2$: $k>1$. I am stuck on how to approach a contradiction in Case $2$.

I have a question.  I have been given this proof: "For any $n$ in the integers where $n>2$, show there are at least $2$ elements in $U(n)$ that satisfy $x^2=1$."  I have gone through and actually proved this, (that the numbers are $1$ and $n-1$) but i didn't' know how to prove that $n-1$ is in fact in the set $U(n)$. Is it because two consecutive numbers are always relatively prime?


I am performing an update and its failing on the following:  The repository 'http://ppa.launchpad.net/izx/askubuntu/ubuntu xenial Release' does not have a Release file..   Running a local Ubuntu server 16.04

When updating, I get the following error message:   W: The repository 'http://ppa.launchpad.net/mc3man/trusty-media/ubuntu xenial Release' does not have a Release file.   Here, I find another statement on this error:   This recommends removing certain PPAs; and, I'm not sure if I should do that since it might mean not getting the updates that I need.    Is this what I should do?


How do you find $65^{3903}$ $(\text{mod }81)$? I found that $65^{3903} \equiv 2 \ \text{ (mod } 3)$ with Fermat's Little Theorem. Is that the right first step? I don't know how I would apply the Chinese remainder theorem here.

How do I efficiently compute $a^b\bmod c$:  When $b$ is huge, for instance $5^{844325}\bmod 21$? When $b$ is less than $c$ but it would still be a lot of work to multiply $a$ by itself $b$ times, for instance $5^{69}\bmod 101$? When $(a,c)\ne1$, for instance $6^{103}\bmod 14$?  Are there any other tricks for evaluating exponents in modular arithmetic?  This is being asked in an effort to cut down on duplicates, see  and .


What is the name of the event when the user clicks the X button at the upper right corner of the window? How will I override that function?

How do I handle the window close event (user clicking the 'X' button) in a Python Tkinter program?


Here are two examples of the word "lest":  They should fill in the hole on that playground lest anyone fall into it.  She was not ready and was worried lest anyone see her naked.   I'm wondering why there are no "s'-s added to the verbs even though the subjective is anyone, which as far as I know do require an s .  Thank you for your help! :)

eg. 1 I have to be sharp and clever lest I go hungry? (infinitive)  eg. 2 John and his friends feared lest the inquiry promised into the extent of the hated forest areas would be carried out too rigorously? (past tense?).  Are both examples acceptable? I've read somewhere that the clause after 'lest' is usually in subjunctive mood and therefore the tense should be an infinitive? Are there other possibilities?  Thank you very much!


My requirement is, we have completed our package installation and tested in another org. in that org Feed Tracking is not enabled for some of custom objects.  How can we enable feed tracking for the objects from our package in the install org ?

Is there any way to enable Chatter Feed Tracking programatically for a object in salesforce.com? If not, it is possible to detect if an object is chatter enabled?


I did a little test on a 74HC595 shift register as follows:  I tied OE (pin 13) to ground to enable outputs. I tied MR (pin 10) to VCC (+5VDC/logic high) to prevent a reset. I connected SCK, RCK, and DS (pins 14, 11, and 12) to individual I/O lines of an uninitialized AT89C2051 microcontroller and connected 10K pull-up resistors to each line. I connected the lowest bit output (pin 15) to a LED through a 1K resistor to see what's going on.  The AT89C2051 doesn't ground any I/O lines when it is initialized with no code, and even with an accidental reset on the AT89C2051, the I/O lines would remain unchanged.  I also used several 2.2uF decoupling capacitors.  Once I powered it up, the LED immediately turned on. I tested every output pin of the 74HC595 and they all were logic high instead of logic low.  Why does this happen?   I have verified that the 74HC595 works by replacing the AT89C2051 with an empty 20 pin socket and applying logic levels to the appropriate pins but I don't understand why it (74HC595) would start up with logic high outputs instead of logic low.

I've gone through the complete , searched SE and on google, but I cant seem to find this information: Whats the output Voltage of QA..QH just after power-up when G (Output enable) is pulled low, but no data have been clocked into the shift register?


I need to change the values of a tif file. Values less than 1.5 must be changed to zero. How can I do?

How could I convert values of 32767 to 0 using raster calculator in QGIS?


I submitted an article 10 days ago. First at the dashboard, they put under review. After one week, the dashboard put Awaiting EIC Decision. Is that bad?

What steps does a manuscript typically go through from submission to publication (or rejection) in a typical journal? How are these steps referred to, in particular by editorial systems, and how long do they each typically take?  Note that this question is about the typical situation and hence not about:   Journals with an atypical workflow, e.g. those that allow for an instantaneous reviewer–author interaction. Exceptional steps or rare occurrences such as withdrawal or .   This is a canonical question on this topic as per . Due to its nature, it is rather broad and not exemplary for a regular question on this site. Please feel free to improve this question.


I have been using linux for a like a month and I have felt in love with it, so I as wondering if we can make shortcuts like in windows?

I am installing p4v in /opt, but /usr/bin is on my path.  Is it possible to create a soft or symbolic link for p4v from /opt to /usr/bin, so I can just type "p4v" since /usr/bin is in my path?