I am using arcpy and while running the script it is unable to find RasterCalculator() method? Even after imporiting arpy module  >>> RasterCalculator("IDSI_2002.img + IDSI_2007.img","D:/PythonScripts/test.img") Runtime error  Traceback (most recent call last):   File "<string>", line 1, in <module> NameError: name 'RasterCalculator' is not defined   Calculator' is not defined

I am trying to loop through multiple rasters and extract cells that are above 0.1 The code I am trying to use is:  import arcpy  arcpy.CheckOutExtension('Spatial') arcpy.env.workspace=r'F:\Sheyenne\Atmospherically Corrected Landsat\Indices\Main\NDWI\main_master' #pathway to all rasters in workspace directory rasters = arcpy.ListRasters('*.tif*') for raster in rasters:      #give new file a name      outraster = raster.replace('.tif','_water.tif')      arcpy.gp.RasterCalculator_sa("""raster >= 0.1""",outraster) print('Done Processing')   For some reason I can't copy and paste the error (python actually shuts down when I run this code) but here is a screen shot of part of it.    EDIT: My parameters have changed and I now need everything >=-0.4 and but !=0.00.  I am trying to use:  import arcpy  from arcpy.sa import * arcpy.CheckOutExtension('Spatial') arcpy.env.workspace=r'D:\Sheyenne\Atmospherically Corrected Landsat\Indices\Main\NDWI\main_master' #pathway to all rasters in workspace directory rasters = arcpy.ListRasters('*.tif*') for raster in rasters:     #Save temp raster to disk with new name     ras = Raster(raster)     outraster = Con(ras >= -0.4 & ras !=0.00, ras)     outraster.save(raster.replace('.tif','_water.tif')) print('Done Processing')   but this returns:  ValueError: The truth value of a raster is ambiguous. Invalid use of raster with Boolean operator or function. Check the use of parentheses where applicable.   EDIT:  I think I just needed to change this line:   outraster = Con((ras >= -0.4) & (ras !=0.00), ras)


I'm working on a little project that makes installing from source easier and one of those parts is getting the project to compile to a certain directory /usr/src/pkgname, so that all the files in there correspond to where they would be if I compile to /. But in order to get the files to be available to the user, they need to be symlinked to their corresponding directory in /. For instance installing neofetch would put the files like this: /usr/src/neofetch └── usr     ├── bin     │   └── neofetch     └── share         └── man             └── man1                 └── neofetch.1  But I want them to be symlinked to / like this: / └── usr     ├── bin     │   └── neofetch     └── share         └── man             └── man1                 └── neofetch.1  and they should create the directories if they don't exist yet

When I install a simple program it often uses make && make install and doesn't often even have an uninstall target.  If I wish to upgrade a program, is it standard protocol to assume it just rewrites seamlessly over the old program?  How do I keep track of these programs; do most people just 'fire and forget' and if no uninstall target is given do I have to manually delete everything?


I'm just looking to prove that there is a isomorphism between the groups $C_2\times C_3$ and $C_6$ but I am struggling with the basics.  I know that $C_2$ consists of $e, x$ so I'm just wondering what the elements of $C_2 \times C_3$  are.  Thanks

Given that $C_n$ is a cyclic group of order $n$, what conditions must integers $n$ and $m$ satisfy such that the group $C_n \times C_m$ is isomorphic to C$_{mn}$?   So I attempted to investigate a few lower-order cyclic groups to find a pattern. In particular, I looked at $C_2 \times C_3$ and compared it to $C_6$. Here are a couple of diagrams:  $C_2 \times C_3$ -   $C_6$ -   They Cayley tables look pretty different (identity elements are all over the place for $C_2 \times C_3$) so I concluded that they are not isomorphic.  I did the same for $C_2 \times C_4$ and $C_8$:  $C_2 \times C_4$ -   $C_8$ -   Again, I arrived at the conclusion that the 2 groups are not isomorphic due to their Cayley table structure.  It seems I'm stuck now. Are my conclusions wrong for the examples I examined? If so, how do I find the conditions for the general case of comparing $C_m \times C_n$ with $C_{mn}$?


I will travel from India to Canada via Zurich, I have a layover of 3 hr 45 minute in Zurich, I have valid Canada immigrant visa, I am an Indian citizen, I hold valid Indian passport.  Do I need transit visa for changing plane in Zurich? I will not go out from Zurich airport.

I am travelling from US to India, with an Indian passport but expired F1 visa and going there to get my H1B visa stamping. I have a stop at Zurich for 2 hours while flying to India. Do I need a transit visa for my trip?


on Apache's docs site:    They say that the hash of the password used for Digest Authentication created with the htdigest utility:  $ htdigest -c ./.htdigest "A Realm" user Adding password for user in realm A Realm. New password: Re-type new password: $ cat ./.htdigest user:A Realm:879af2190fce9012039001fecbb23412   879af2190fce9012039001fecbb23412 = md5(user:A Realm:password). However, if I type:  $ echo "user:A Realm:password" | md5sum e77ed25bc7d1fe5ffe9f827346b2cd7b    -   I get another hash, which is not the one inside ./.htdigest.  How then Apache computes the MD5 hash inside ./.htdigest when I create the file with htdigest?

I'm trying to write some code to work with an htdigest password file. The documentation I can find seems to claim that the format of that file is:  user:realm:MD5(user:realm:pass)   If that is the case, then why doesn't this work for me? I created a file with the command line htdigest thus:  htdigest -c test b a   When prompted for a password I entered 'c'. This creates a file with the contents:  a:b:02cc8f08398a4f3113b554e8105ebe4c   However if I try to derive this hash I can't,  echo a:b:c | md5   gives me "49d6ea7ca1facf323ca1928995420354". Is there something obvious that I'm missing here?  Thanks


My regular expression matches the string in the last occurrence of VALUE. How do I tweak my RegEx to match the string only in the first occurrence after a certain string?  Regex: NAME="var1".+VALUE="(.+)" Text:  <INPUT TYPE="HIDDEN" NAME="var1" VALUE="value that i want to be captured"/><INPUT TYPE="HIDDEN" NAME="var2" VALUE="value2"/><INPUT TYPE="SUBMIT" VALUE="value that is captured, but i don't want to be captured" />   My current RegEx captures the value: "value that is captured, but i don't want to be captured"

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


Does anybody have experience with riding with a big (60-70 pound) dog? I took a look at , but there doesn't seem to be much experience with big dogs reflected there.  What I'm hoping for is a bike setup that would be practical (e.g., easy to set up and go) for errands around town and short rides (30-50 km). It would be a bonus if the bike also worked well for "non-extreme" touring (with dog). I don't think I want to ride with the dog running alongside – there is too much traffic for me to feel like that is safe for dog or rider. The  looks like a possibility, although I'm not sure that it would work with such a big dog on the platform.  I'm open to considering a trailer, but the one's I've seen and used don't seem to practical for use in a (sub)urban environment. I've seen a bike with a  and a biggish (maybe 40 pound) dog "surfing" on the platform, but it seems too risky for the dog without some modification to the trailer.

Over the years I have seen a few people transport a dog on a bike.  What options have you seen?   Please include a photo in your answer if possible.


In a Simpsons episode of season 25 the dialoge   Monsarno Rep: Say hello to our chief scientist. Everyone: Augh! Sideshow Bob! Sideshow Bob: Dr. Sideshow Bob. Homer: Real doctor or PhD? Sideshow Bob: PhD.   takes place. In my country there is only a doctor and I thought a PhD would be exactly that in Anglo-Saxon countries. I would like to know is there a difference in the USA between a PhD and a doctor?  Especially: What did they mean in the dialogue?  Edit: In hindsight this may be a duplicate, but originally it wasn't because I did not know that the "doctor" of the dialogue was about a medical doctor.

Reading the question posted  left me with a more general question:  Given the professional title and name: Dr. (First Name)(Last Name), is there some way to differentiate between the holder of a philosophical doctorate and a medical doctor? Wouldn't it be more appropriate for a PhD holder to have the title (First Name)(Last Name), PhD?


I ran a stupid command: sudo chown -R ngoclb:ngoclb /usr. Then I couldn't use sudo command and login to Ubuntu. To fix this issue, I using recovery mode to chown /usr to root (sudo chown -R root:root /usr) and can logged in to Ubuntu, but now, the GUI of Ubuntu is not like default (it's same like Windows classic for some component: scrollbar, menu...) and I cannot access to System Settings/User Account. How can i fix this ?

I accidently ran  sudo chmod 755 -R /   instead of  sudo chmod 755 -R ./   I stopped it after few seconds, but now there is some problems such as  sudo: must be setuid root   How can I revert permissions back?


I tried reinstalling bcmwl-kernel-source but my Broadcom wireless adapter 14e4:4365 rev01 is still not working

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.


macOS now has a few newer voices that can be chosen in VoiceOver Utility > Speech. I quite like the Siri Male (United States) voice, but neither the command say nor using Automator will let me select this or any other Siri voices to use, only the older voices are supported. So far I can only use the voice with the hotkey to read out loud selected text. Is there a way to use those new voices to render text to audio files?

I notice that on Sierra, Siri's voice is much superior to the selection of system voices you can select in System Preferences → Accessibility → Speech. In fact, I suspect they use a different system entirely as the command say -v ? doesn't seem to list any voices which are used with Siri.  I have a key command set up to speak the select text. Is there no way I can get it to use Siri's voice to do it?  Edit: To be specific, I'm after the Siri voice: 'British (Male)'


In 5th edition combat, does a character using a ranged weapon like a bow or crossbow get to add their dexterity to their damage? Such as a rogue with a 15 Dexterity using a light crossbow, would they deal 1d8+2 damage?

My long-term RPG instinct is to say "clearly they don't". (Pathfinder, 3.5, AD&D, etc.)  Looking at some NPCs seems to be back this up. The Veteran (MM 350) deals a straight 1d10 with their Heavy Crossbow, despite having Dex+1, and the Scout (MM 349) deals 1d8+Dex with their Longbow.  However, I cannot actually find where this is detailed in the PHB...   Section on Dexterity (PHB 176) does not have any exception for the crossbow.     You add your Dexterity modifier to your attack roll and your damage roll when attacking with a ranged weapon, such as a sling or longbow.  Crossbow features are Ammunition and Loading, but neither of these seem to address damage. (PHB 146-9]) The sections on "Making an attack" (PHB 196-8) don't mention anything about damage modifiers at all.   Also, I cannot find any mention in the  (Oct 2015).  Does anyone else have a RAW for "crossbows don't add Dex to damage?".    UPDATE: the MM has a few other examples that are not consistent with "Dex on damage", but in general, most are accurate. The answer below seems to back my findings, crossbows do add Dex modifier to damage.    UPDATE 2: the  (2015-12) corrects the Veteran example.


I have two classes named Manager and Worker. Each Worker has a Manager and each Manager has a Worker to manage. I am defining the classes at separately header files.  manager.h  #include "worker.h"  class Manager{     private:         Worker* worker;     public:         /* methods etc */ };   worker.h  #include "manager.h"  class Worker{     private:         Manager* manager;     public:         /* methods etc */ };   main.cpp  #include "worker.h" #include "manager.h"  int main(void){     /* code code */ }   Ok until now it seems to be everything ok, but when I try to compile it gives lots of lines with the names of the headers. First I thought that it created a kind of loop and was including the headers endless. I then searched about it and tried to use #ifndef #define #endif in each header file. Turns out that now the problem is that the class Worker doesn't see the class Manager and vice-versa, meaning that the errors now are "'Worker' does not name a type" etc etc etc.

I'm a C++ newbie, but I wasn't able to find the answer to this (most likely trivial) question online.  I am having some trouble compiling some code where two classes include each other.  To begin, should my #include statements go inside or outside of my macros?  In practice, this hasn't seemed to matter.  However, in this particular case, I am having trouble.  Putting the #include statements outside of the macros causes the compiler to recurse and gives me "#include nested too deeply" errors.  This seems to makes sense to me since neither class has been fully defined before #include has been invoked.  However, strangely, when I try to put them inside, I am unable to declare a type of one of the classes, for it is not recognized.  Here is, in essence, what I'm trying to compile:  A.h  #ifndef A_H_ #define A_H_  #include "B.h"  class A {     private:         B b;      public:         A() : b(*this) {} };  #endif /*A_H_*/   B.h  #ifndef B_H_ #define B_H_  #include "A.h"  class B {     private:             A& a;      public:         B(A& a) : a(a) {}  };  #endif /*B_H_*/   main.cpp  #include "A.h"  int main() {     A a; }   If it makes a difference, I am using g++ 4.3.2.  And just to be clear, in general, where should #include statements go?  I have always seen them go outside of the macros, but the scenario I described clearly seems to break this principle.  Thanks to any helpers in advance!  Please allow me to clarify my intent if I have made any silly mistakes!


It is known that any prime greater than 2 is odd.  How do I show the combinations of all primes greater than 2 is also odd, $2k+1$?  I tried using induction, but what is appropriate for $prime_n$?   $3 \cdot 5 \cdot 7 \cdot 11 \cdot 2k + 1 = 2k + 1$?   Can we use $2k + 1$ to replace $prime_n$ since we know it will be odd?

I am extremely poor at proofs and logical manipulation so I am stuck on a lot of these questions especially induction.   The question below I have been stuck at for a little over 1 hour and I can't get it, I have tried various substitutions and forms but I am stuck..  Using mathematical induction: An integer is odd if it can be written as $n=2k+1$. Use induction to prove that the product of $m$ many odd integers is odd for every $m \geq 2$.  I have tried doing $(2k+1)(2(k+1)+1)$ and substituting $k=1$ for my basis step after that I am lost.


I am using dataSnapshot to get a value from my Firebase Database, but I keep getting a null reference error. The path to my firebase is correct and I have Datasnapshot defined, so I am not too sure why this error is coming up.   Here is the snippit that is giving me issues      User user = new User();     String username;     username = (String) datasnapshot.child("Users").child(uid).child("userName").getValue();     user.setusername(username);     navuserName.setText(username);   and this is the error that it is giving me.  java.lang.NullPointerException: Attempt to invoke virtual method 'com.google.firebase.database.DataSnapshot com.google.firebase.database.DataSnapshot.child(java.lang.String)' on a null object reference   I have Datasnapshot dataSnapshot; defined in the class but the error is being thrown. Any suggestions?

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


When operating in the linux terminal I can enter the following: command   ''' awk 'FNR==1 {print$5}' SNextractedstats.txt '''  To display the value in the first row and fifth column of a text file.   I would like to be able to save this value as a variable in a bash script to be able to do sums and call using Echo, how would I go about doing this? Thank you

Is there a way to assign a value to a variable, that value which we get in terminal by writing any command?  Example command: sensors  From that we get CPU temperature. How can I assign this value to a temp_cpu variable?


How can an electron revolve in a circular orbit because circular motion is an accelerated motion and  acc. charged particle is a source of E.M. Wave. So,it should radiate out energy and hence would loose energy; so from where does it get energy from?

I'm having trouble understanding the simple "planetary" model of the atom that I'm being taught in my basic chemistry course.   In particular,    I can't see how a negatively charged electron can stay in "orbit" around a positively charged nucleus. Even if the electron actually orbits the nucleus, wouldn't that orbit eventually decay?  I can't reconcile the rapidly moving electrons required by the planetary model with the way atoms are described as forming bonds. If electrons are zooming around in orbits, how do they suddenly "stop" to form bonds.     I understand that certain aspects of quantum mechanics  to address these problems, and that there are  of atoms. My question here is whether the planetary model itself addresses these concerns in some way (that I'm missing) and whether I'm right to be uncomfortable with it.


Prove that, for each $R > 0$, there exists $N(R) \in \mathbb N$, such that, for all $n \geq N(R)$, the function $$f_n(z) = \sum_{k=0}^{k=n} \frac {z^k}{k!}$$ has exactly $n$ zeros in $|z| < R$.    This question is asked after Rouche's theorem, so I assume I have to apply the theorem to prove this.    Rouche's theorem : If $f$ and $h$ are each functions that are analytic inside and on a simple closed contour $C$ and if the strict inequality $|h(z)|<|f(z)|$ holds at each point on $C$, then $f$ and $f+h$ must have the same total number of zeros inside C.    I would like to get some hint on how to prove this.

this is a question from a Temple prelim exam, and i'm trapped in it! We have $p_n(z)=\sum_{k=0}^n\frac{z^k}{k!}$ and we have to prove that $\forall r>0 \quad \exists N\in\mathbb{N}$ s.t. $p_n(z)$ has no zeros in $B_r(0)$ for $n>N$.  I tried to use Rouche's theorem observing that $1+\frac{z^n}{n!}$ has the nth roots of $n!$ as complex zeros, which are outside a fixed ball for n sufficiently large, but i'm having trouble proving that $|1+\frac{z^n}{n!}|>|z+\cdots+\frac{z^{n-1}}{(n-1)!}|$ in $|z|=r$ (if this is true). If anyone could help..


Is this toilet:    Or maybe this (room):    Or should I just use "a toilet" and "the toilet".   I found  but it doesn't answer my question.

I've always been confused by the terms washroom, restroom, bathroom, lavatory, toilet and toilet room. My impression is that Canadians would rather say washroom while Americans would probably say bathroom or Saint John's in the same situation.  I guess the difference here is not only in different kinds of English, but also in whether one is referring to a room in their house or in some public place.  Which do you usually use? Please specify the difference if you use more than two from those six with different meanings, and also where you are from (i.e. what type of English you speak).


I have searched this but haven't found any answers at all really.  I want to know if the time a user spends on your site increase your ranking in Google.  My company wants to build it's own webinar software that will aim to increase traffic (as well as other marketing benefits).  At the moment the process is as follows:  User receives a link 1hr before the webinar starts The link takes them to our site, giving us 1 hit, and then gets them to download some desktop webinar software (GoToMeeting in our case). This means that the user is no longer on our site for the remainder of the webinar. If we were to iframe (or directly) make the webinar on our domain such that the user never leaves to use the desktop software, will this count to increase our ranking because users are on the site for considerably longer (now 1hr + per user per webinar).  Is the effort to develop our own webinar software going to increase our google ranking?

What will result in better Page Ranking in search results?   More page views & less time spent per page    Less page views & more time spent per page     Note: The website that is being made has over 10,000 pages.


I'm trying to do a basic service area network analysis in ArcGIS 10.0.  But I have two cost attributes I want to act as the network impedance-- one apportioned along the edges of each line feature, the other a constant.  To be specific, I'm trying to model transit travel.  I have travel time (in minutes) as the primary cost attribute (which is apportioned along the line), but I also want to be able to factor in a constant wait time which is expended at the facility.  The wait time will vary depending on the transit line's frequency.  Because the wait time varies from line to line, I can't just subtract the wait time from the default break values I put into the analysis settings.  For instance, if I want to find out the extent of travel in 20 min and 30 min, and I had only one transit line (with a wait time of 5 min), I could just specify 15/25 as my break values.  But I have multiple transit lines, so I can't specify break values for every line.  Is there any way around this?

Can anyone tell me whether Network analyst can consider multiple cost attributes? I am looking for most ecologic route (not shortest), therefore I have assigned a value of pollution to each road segment. I have 2 layers in my analysis road and cycle layer, both have these pollution values for each segment (cycle routes have mostly lower values) and I selected this pollution attribute as a default cost attribute but would also like to consider another attribute in the best route analysis.   Can this be done or does network analyst always consider just one cost attribute?


Can Quantum Entangled particles convey information faster than speed of light. If they don't what was wrong with John Bells experiment?

It is often stated, particularly in popular physics articles and videos, that if one measures a particle A that is entangled with some other particle B, then this measurement will immediately affect the state of the entangled partner.  For example, if Alice and Bob share an entangled pair of electrons and Alice measures her spin in the $x$ direction, then Bob's spin will also end up spinning in that direction, and similarly if she measures in the $z$ direction. Moreover, the effect will be instantaneous, regardless of the spatial distance between the two particles, which seems at odds with special relativity.  Can I use a scheme like this to communicate faster than light?


I'm new to Ubuntu and Linux in general.  I'm currently out of town and the dorm I am living in has terrible internet connection. It won't be another 2-3 weeks before I can go home and have proper internet connection.  So my question is whether or not I can install Ubuntu 13.10 in my laptop without the internet and then do the updates once I go home?  Also, I'm attempting to do a dual boot with my Lenovo G505s which was pre-installed with Windows 8. Hopefully I can pull this off.  I already did the necessary things (I think and hope so) prior to installation:   Disable secure boot Enable legacy and boot UEFI first Create partition Put installer in my pen drive   As I am quite new to this, any advice would be of great help. Thanks in advance!  EDIT: I tried yesterday. The installation asked me to connect to the internet, so I used my crappy dorm internet. When it reached the downloading/installtion of Ubuntu One, it just stopped and went on forever. So I had to stop it.

I´m going to install Ubuntu 12.04 on my laptop, and I don’t have internet at home.   I know that I can install it without internet, but , does it work?


I read that you could put 50k urls in a sitemap. Problem : in an image sitemap, you got the page url, and a url for each image provided. Does the limit apply to the number of pages, of images, or the total ?  Thanks

I am working on adding the image:url tags inside the loc tag in our sitemaps. The documentation from Google says I can include up to 1000, image:url inside a loc tag.  There is no mention if this 1000 per loc is counted towards the 50,000 URL per sitemap file limit. Does anyone have any reference to any official documentation regarding this? my research did not yield any official response.


When I try to run it from the command line, I receive an error:  ** (nm-applet:2403): WARNING **: Could not initialize NMClient /org/freedesktop/NetworkManager: The name org.freedesktop.NetworkManager was not provided by any .service files  (nm-applet:2403): nm-applet-WARNING **: Error connecting to ModemManager: Error calling StartServiceByName for org.freedesktop.ModemManager1: GDBus.Error:org.freedesktop.DBus.Error.Spawn.ExecFailed: Cannot launch daemon, file not found or permissions invalid  (nm-applet:2403): nm-applet-WARNING **: Could not find ShellVersion property on org.gnome.Shell after 5 tries  (nm-applet:2403): nm-applet-WARNING **: Failed to register as an agent: (2) The name org.freedesktop.NetworkManager was not provided by any .service files

While upgrading today, something caused my wireless network manager to disappear. Not even connecting via wired connection.  This error is being shown by files:  **(nm-applet:2716): WARNING **: Could not initialize NMClient /org/freedesktop/NetworkManager: The name org.freedesktop.NetworkManager was not provided by any .service files   (nm-applet:2716): nm-applet-WARNING **: Error connecting to ModemManager: Error calling StartServiceByName for org.freedesktop.ModemManager1: GDBus.Error:org.freedesktop.DBus.Error.Spawn.ExecFailed: Cannot launch daemon, file not found or permissions invalid   (nm-applet:2716): nm-applet-WARNING **: Could not find ShellVersion property on org.gnome.Shell after 5 tries   (nm-applet:2716): nm-applet-WARNING **: Failed to register as an agent: (2) The name org.freedesktop.NetworkManager was not provided by any .service files    Is there a patch I can download through windows and send through to my ubuntu, or is it a case of having to reload everything? I tried running two versions back but still no internet access.


I have googled it but couldn't find any working solution; As a below example  the position:absolute does not set the footer at the bottom of page    .footer {   position: absolute;   left: 0;   bottom: 0;   width: 100%;   background-color: red;   color: white;   text-align: center; } <!DOCTYPE html>      <meta name="viewport" content="width=device-width, initial-scale=1">
Fixed/Sticky Footer Example

The footer is placed at the bottom of the page.

Fixed/Sticky Footer Example

The footer is placed at the bottom of the page.

Fixed/Sticky Footer Example

The footer is placed at the bottom of the page.

Fixed/Sticky Footer Example

The footer is placed at the bottom of the page.

Fixed/Sticky Footer Example

The footer is placed at the bottom of the page.

Fixed/Sticky Footer Example

The footer is placed at the bottom of the page.

Fixed/Sticky Footer Example

The footer is placed at the bottom of the page.

Fixed/Sticky Footer Example

The footer is placed at the bottom of the page.

Fixed/Sticky Footer Example

The footer is placed at the bottom of the page.

Fixed/Sticky Footer Example

The footer is placed at the bottom of the page.

Fixed/Sticky Footer Example

The footer is placed at the bottom of the page.

Fixed/Sticky Footer Example

The footer is placed at the bottom of the page.

Fixed/Sticky Footer Example

The footer is placed at the bottom of the page.

Footer

         If I scroll it, I will get:    I want the footer get pinned at the bottom of the page, who can I do this?

I have a simple 2-column layout with a footer that clears both the right and left div in my markup.  My problem is that I can't get the footer to stay at the bottom of the page in all browsers.  It works if the content pushes the footer down, but that's not always the case.


I posted a similar question yesterday and got some helpful responses but the problem I am having now is slightly different. When the user changes the type on the UI, classes are added to the html elements (this simply adds a blue border around the element). I'm not receiving any error messages but it's just not doing anything.    document.querySelector(DOM.inputType).addEventListener('change', function() {   if (usersInput.type === "Health") {     document.querySelector('.input_type').className += " blue";     document.querySelector('.input_activity').className += " blue";     document.querySelector('.input_time').className += " blue";     document.querySelector('.input_end').className += " blue";     document.querySelector('.input_btn').className += " blue_btn";   } }); .blue {   border: 2px solid blue !important; }  .blue_btn {   color: blue; } <div class="input">   <select class="input_type" id="input_type" name="input_type" style="height:36px" placeholder="Type" required>   </select>   <input class="input_activity" type="text" name="activity" placeholder="What do you need to do?" size="60" style="height:32px" required>   <select class="input_time" name="Time" style="height:36px" required>     <option value="Start">Start</option>   </select>   <select class="input_end" name="end" style="height:36px" required>     <option value="End">End</option>   </select>   <input class="input_btn" type="button" value="Submit!"> </div>     Here is where usersInput comes from:  var usersInput = UICtrl.getInput();   Here is where 'getInpu't comes from:  return {     getInput: function() {         return {             type: document.querySelector(DOMstrings.inputType).value,             activity: document.querySelector(DOMstrings.inputActivity).value,             startTime: document.querySelector(DOMstrings.inputStart).value,             endTime: document.querySelector(DOMstrings.inputEnd).value         };     }, },   These are the options to select from the 'type' drop down menu:  <select class="input_type" id="input_type" name="input_type" style="height:36px" placeholder="Type" required>     <option value="">Type</option>     <option value="health">Health</option>     <option value="work">Work</option>     <option value="leisure">Leisure</option> </select>   Please note, I have checked similar questions on the forum but none that I have found have really answered my question. Thanks in advance for your support!

I have an element that already has a class: <div class="someclass">     <img ... id="image1" name="image1" /> </div>  Now, I want to create a JavaScript function that will add a class to the div (not replace, but add). How can I do that?


To help better understand my question, I'm referring to a topic discussed in the book "The C++ Programming Language 4th edition" chapter 27 section 2.1.  The author is talking about the danger of polymorphic types and built-in arrays. He gives the following example:  void maul(Shape∗ p, int n) // Danger! {     for (int i=0; i!=n; ++i)         p[i].draw(); //looks innocent; it is not }  void user() {     Circle image[10]; // an image is composed of 10 Circles     // ...     maul(image,10); // ‘‘maul’’ 10 Circles     // ... }   We're told that Shape is an abstract size of size 4 and Circle inherit Shape and add an extra 2 members, center and radius which adds to the type size, hence, sizeof(Circle)>sizeof(Shape). Now the author explains that given the following view for example:  user() view: image[0] image[1] image[2] image[3]<br/> maul() view: p[0] p[1] p[2] p[3]   The call of p[1].draw() (emphasis on p[1], for p[0] it will call the right function) will fail because there's no virtual function pointer where it's expected.  Now I know how virtual function tables works, but I don't understand how the size of the type or its layout affect a virtual function call? When the compiler see a call to a virtual function doesn't it replace it with something similar to:  p[1]._vfptr->draw_impl();   Assuming I'm right, how is the size of the derived object/its layout broke the call for it.

Someone mentioned it in the IRC as the slicing problem.


I have a microprocessor with two lines, /RESET and /HALT, which are independently pulled to +5V DC.  To reset the processor, both of these lines must be grounded for at least 100 ms -- they may not be wired together and treated as one line.  How do I create a circuit such that, when a single DPDT reset button (debounced) is pressed, both of these independent lines are grounded, and when it is released, they stay grounded for at least 100 ms?

I have a line pulled to +5V. When a button is pressed, it should ground the line after a 100ms delay. How would I implement such a delay?


I'm quite new to programming and have looked on many answers to similar questions but they don't produce the desired result for me. Is it possible for any of you guys to help me? example code:  shapes = ["tri", "angle"]  groupedShapes = "triangle"

This has always confused me. It seems like this would be nicer:  my_list = ["Hello", "world"] print(my_list.join("-")) # Produce: "Hello-world"   Than this:  my_list = ["Hello", "world"] print("-".join(my_list)) # Produce: "Hello-world"   Is there a specific reason it is like this?


I am having an issue with preferred networks in WiFi settings. There are few networks I want to delete - when I do so, the disappear temporarily, but will eventually come back. I believe is to do with iCloud saving passwords.   Let's say I delete network from my iPhone (also on my macbook), after day or two I will notice my iPhone or Macbook connecting to the same hotspot again (shared, so this is a security issue), and I will go in to preferred network settings and will see all the networks I have already deleted.   Do any of you have a similar issue?  Because of security issue I had to enable password protection for network switching on my macbook, and keep wifi disabled when unused on my iPhone.  I have also submitted bug report to Apple, but did not get any response or comments back.

How do I delete a network from my Mac?  I removed it from network preferences in the advanced pane but it still appears connected in my list.   I also tried looking for it in Keychain Access but it's not there and I'm still connected.


The inscription on Mjolnir says "Whosoever holds this hammer, if he be worthy, shall possess the power of Thor"; which is what exactly?   In other words, does Thor have any powers other than that given to him by wielding the hammer?

In the film Thor, Odin casts a spell on Mjolnir and strips Thor of his power.  He then banishes Thor to Midgard (Earth).  On Earth, Thor is seemingly just a strong and durable human.  Later in the film, he becomes worthy, and regains control of Mjolnir.  This then grants him his full power set and control over Mjolnir.  My question is, prior to this, could Thor control lightning all on his own?  Or is this purely an ability of Mjolnir?


The body text is outside the box in the Android application.  For example:    I use a Samsung Galaxy S5 SM-G900A with Android 4.4.2.

The placeholder for the body field (the word "Body") is strangely placed in the Android app, seems a bit too high:    Could reproduce using:   Samsung Galaxy 4a.  Android version 4.4.2  App version 1.0.54 Moto X (2013), Android 4.4.4 App version 1.0.60


The task is: Does the function  $$ f_n(x)= \frac{2nx}{(1+n^2x^2)}  $$  convergence uniformly in the interval [0,1]? And in (1, +infinity)?

Test the sequence of functions for uniform convergence       $$f_n(x)=\frac{nx}{1+n^2x^2}$$      $a) \text{on} \ [0,1]$      $b) \text{on} \ [1,{\infty})$   a)  If we differentiate this with respect to x we get the following :  $$(\frac{nx}{1+n^2x^2})'=\frac{n(1-n^2x^2)}{(1+n^2x^2)^2}$$  This is equal to $0$ for $x=^{+}_{-}\frac{1}{n}$  From here we can either check these two values in the original function and take the larger one as the supremum or we can find the second derivative and check whether it's negative. In either case we find that for $x=\frac{1}{n}$ we get the value $f_n(x)=\frac{1}{2}$ and for $x=-\frac{1}{n}$ we get $f_n(x)=-\frac{1}{2}$. Note that $x=-\frac{1}{n}$ doesn't even belong in our interval. Now we can finish the problem.  $$\lim_{n\to \infty}{\frac{nx}{1+n^2x^2}}=0$$  So it is piecewise converging to $f(x)=0$  $$\lim_{n\to \infty}\sup{\left \lvert{f_n(x)-f(x)}\right \rvert}=\lim_{n\to \infty}{\frac{n\frac{1}{n}}{1+n^2 \frac{1}{n^2}}}=\frac{1}{2}$$  So $f_n(x)$ does not convergence uniformly on $[0,1]$ to $f(x)=0$  b)  Now we need to test the on the interval $[1,\infty)$.From the first derivative we notice that if $x\in [1,\infty)$ then the numerator seems to be negative for all $x>1$. So $f_n(x)$ is monotonically decreasing. That means that the supremum will be at the first point of the interval or $x=1$. Taking the limit :  $$\lim_{n\to \infty}{\frac{n}{1+n^2}}=0$$  We can see that the function convergences uniformly on this interval.  Is there something wrong with either of these solutions?  I'm having doubts mostly about the second interval since $x=\frac{1}{n}$ is a supremum but only for $n=1$. However I believe that we need to have the supremum that's satisfied for all $n \in N$. Pointing even the tiniest mistake in my solutions would be very helpful. Thank you.


I have tried to find the answer to this question by searching the books and was unable to find anything in the regular rules.  Attempting to search here only threw up similar questions relating to older versions of the game (1e) or pathfinder, so how does it work for 5e?  Is the damage negated by falling into water, if you were to fall from a great height, for example 800 ft? Or, is it reduced like resistance?

Just realized that in DMing 5e I have unconsciously used a falling-in-water rule-of-thumb that I inherited from somewhere (maybe 2e or AD&D or maybe even Pathfinder). The ruling I've been using is as follows:   No damage for 20 feet of falling. Half-damage next 20 feet. Normal damage beyond that.   Realizing there should be a Strength (Athletics) for "swimming" (in context, "diving") to take even less damage with a proper dive in sufficiently deep water, I started to look for specifics on that. Am I just missing it somewhere? (Also didn't find it searching this stack.)  Are there clear 5e rules for both jumping and diving in water of various depths?


I have changed my Google account, now I want to sync my contacts to the new Google account. How can I do this?

I have an iPhone that is already synced with my iMac, but I am away on leave and am using a Windows 7 computer. I need to send the contacts I've created on my iPhone to my Gmail account online, because I am going to update my iPhone's operating system and want to be sure I do not lose the contacts on my phone. I know I will probably lose my music, but that's okay.


I'm an Indian residing in the UK. I have multiple entry short term Schengen visa which I have used multiple times to visit many Schengen countries as tourist. Is it possible for me to use the same visa to visit a Schengen country for attending a conference? Should I carry any specific documents?

Let's say I already have a tourist Schengen visa which will be valid at the time of the conference, so getting another visa is not exactly desirable. I plan to pay for the conference myself and the subject of the conference is connected to my job only indirectly. However since my activity in the country could not be exactly described as a tourism, I'm curious is it really fine?  Also to expand questions further, by quick googling I couldn't find what are exact regulations of what you can and can not do with certain type of Schengen visa (most of my findings are about the requirements of getting the visa), so some useful links would be appreciated.


Hello I do not understand why tikz can not find the intersection of the curve and the right? thank you  \documentclass[border=5mm]{standalone} \usepackage{tikz}  \usetikzlibrary{calc,intersections}  [![enter image description here][1]][1] \begin{document} \begin{tikzpicture}[xscale=0.015,yscale=0.01]  \draw[domain=0:500,samples=1000,variable=\x,name path=A] plot ({\x},{475.-712.*exp(-0.133e-2*\x*10)+238.*exp(-0.400e-2*\x*10)}); \draw[-latex] (0,0)coordinate(O)-- (500,0) node[above]{$t$}; \draw[-latex] (O) -- (0,500) node[right]{$\theta_s(t)$};  \draw[dashed,thick,name path=S100] (0,{475}) --  (500,{475});  \draw[dashed,thick,name path=S95] (0,{475*0.95}) --  (500,{475*0.95}); \path[name intersections={of=S95 and A,by=E}];   \draw (E) |- (O-|E);  \end{tikzpicture} \end{document}

Why doesn't TikZ find all intersections. They are obviously there …    \documentclass[border=10mm]{standalone}  \usepackage{tikz} \usetikzlibrary{intersections}  \begin{document} \begin{tikzpicture}[point/.style={fill=blue,minimum size=1mm,inner sep=0pt,circle}]     % Zoom (to prevent oveflow)     \def\yzoom{100}     % Plots     \foreach \T/\xmin/\a in {%         0.27/1.538/a,         0.28/1.590/b,         0.29/1.649/c     } {         \draw [thin,name path global/.expanded={kurve \a}]             plot [raw gnuplot] function {%                 set xrange [\xmin:10];                 set yrange [0:0.08*\yzoom];                 set samples 1000;                 f(x) = \yzoom*(\T/(x-1) - 1/(x**2));                 plot f(x);             };     }     % Lines     \foreach \p/\a in {%         %% T = 0.27         0.0231/a,         %% T = 0.28         0.02855/b,         %% T = 0.29         0.0338/c     }{         \draw [red,thin,name path global/.expanded={linie \a}]             (0,\p*\yzoom) -- (10,\p*\yzoom) node [fill=white,pos=0.1] {\a};     }     % Intersections points     \path [name intersections={of=kurve a and linie a,by={P1,P2,P3}}]         (P1) node [point] {} (P2) node [point] {} (P3) node [point] {};     \path [name intersections={of=kurve b and linie b,by={P1,P2,P3}}]         (P1) node [point] {} (P2) node [point] {} (P3) node [point] {};     \path [name intersections={of=kurve c and linie c,by={P1,P2,P3}}]         (P1) node [point] {} (P2) node [point] {} (P3) node [point] {}; \end{tikzpicture} \end{document}   There seems to be no problem with the names of the paths but TikZ is missing four intersection points.  Bonus question: Is it possible to solve the last part (adding blue points) with the second \foreach? I tried it but I get the error File ended while scanning use of \tikz@intersect@path@names@parse..


What should I do to get all the 1 with a minus sign (-) in front of them aligned with the other 1 and the 0 in those vectors?  \documentclass[a4paper, 12pt]{book} \usepackage{amsmath} \begin{document} $$ v_1 = \begin{bmatrix} 1 \\ -1 \\ 0 \\0 \end{bmatrix}, \quad v_2 = \begin{bmatrix} 1 \\ 0 \\ -1 \\0 \end{bmatrix}, \quad v_3 = \begin{bmatrix} 1 \\ 0 \\ 0 \\-1 \end{bmatrix}, $$ \end{document}

I'd like to left align the -1 entry in the following matrix so that the 1s line up. Is there a way to get matrices to ignore signs in that way?  \begin{matrix}     1 & 1  \\     1 & -1 \\ \end{matrix}   Using \flushright{-1} doesn't seem to work.


I have an unexpected behaviour- following snippet fail with 'unbound variable' error:  #!/bin/bash set -u <<EOF a=a b=$a EOF   Tested on:  GNU bash, version 4.4.12(1)-release  GNU bash, version 4.2.46(2)-release

I have a script that has to do many different things on many different remote machines.  I thought that a heredoc would work for this, but I am not able to use a variable defined elsewhere in the script and one defined in the heredoc. Here is some code: #!/bin/sh  FOO="foo" ssh some.remote.host << EOF   BAR="bar"   echo "FOO=$FOO"   echo "BAR=$BAR" EOF  This only prints the following:  FOO= BAR=bar  If, however, I quote the EOF line like this: ssh some.remote.host << "EOF" then it only prints the following:  FOO=foo BAR=  Any hints on how I can use both variables inside the heredoc? Thanks.


Which of the last three verb patterns apply to the verb 'recommend'?      I recommend that you wait. (present subjunctive, American usage)     I recommend that you should wait. (substitute for present subjunctive, British usage)     I recommend waiting. (subject of the gerund not mentioned)     I recommend you/your waiting (subject of the gerund mentioned)     I recommend to wait. (subject of the infinitive not mentioned)     I recommend you to wait. (subject of the infinitive mentioned)

I recommend you to define those parameters beforehand.   I recommend that you define those parameters beforehand.   Are both sentences grammatically correct? If yes, do they mean the same thing? If yes, which one should I use?


The old user profile showed the suggestions that were rejected, and the ones that were approved. Now the suggestion page just says "suggested," which is quite obvious, as I am seeing the suggestion page.    Could we not have an indication of which suggestions were approved, and which suggestions were rejected, in the same way it is visible in the review tab?

Issue 1: I find it a bit irritating that when I click the Improve button and further edit it, even if I mark it as helpful, only Community takes the credit for the approval. I know the topic itself will contain the link to the suggested edit, but my activity history only says that I made an edit, and not approved a suggested edit. The same holds true for marking one as unhelpful. The activity history should say I rejected an edit, and then made an additional edit. I know it's not often, but sometimes I do try to go back to a suggested edit I've rejected, but when I improved and rejected, it's not traceable for me as it doesn't show in my history or in the question's revision history. So if I don't remember what user suggested it, it's lost to me.  This issue also plagues the  which are awarded for approving and rejecting suggested edits, which essentially you have done, you're just not receiving credit for it. I suggest that when I mark an edit as helpful or not helpful, both me and Community be listed as the approvers or rejecters, unless another user is already listed in the appropriate place.  Update: Here is  of the confusion this causes.  Update 2: Also, when improving a post and marking it as "not helpful", it would be nice to be able to  along with it.    Issue 2: Expanding off the idea that users need more notice for suggested edits that get rejected, the activity history page is much too useless when it comes to listing the suggested edits a user has made. Literally all it does is list them. A user still has to click through to each one in order to find out if it was approved or rejected, or even if it's still pending. Take, for example, this screen shot of the suggested edit history:    Is it really necessary to say I suggested a suggested edit? Really? Of course I suggested it, it's a suggested edit. This isn't !  A good way to fix this would be to change the second "suggested" word into one of: pending, approved, or rejected. This would be a quick way to tell which edits have been approved or rejected and which ones are still pending. Users would be able to target out rejected edits and review them for the reasons. Something like this:


How many post edits can I do in a day? I think I have submitted less than 10 post edits today, but I am getting the following message:     Our edit queue is full, try again in a few minutes   What does this mean, and when can I start suggesting edits again? Have I done something wrong?

We know that Stack Overflow has a suggested edit queue, visible to the users who have the  privilege. Someone said the queue has a fixed size.  What's the fixed size of the suggested edit queue?  Is it often that the queue gets filled up and users can no longer suggest edits?


I've always seen Aronszajn trees being discussed on regular cardinals :      Let $\kappa$ be a regular infinite cardinal. A $\kappa$-Aronszajn tree is a tree on $\kappa$ of height $\kappa$, whose levels have all cardinality less than $\kappa$, and with no $\kappa$-branch.   Does this definition holds if $\kappa$ is singular? Do we have any reason for looking almost only at regular cardinals?

Why does the tree property hold for regular cardinals but not singular cardinals? (I.e. There exists a tree of height $\kappa$ with countable levels and no cofinal branch for $\kappa$ a singular cardinal)


I read somewhere that any finite number sequence must be found in $\pi$. For example, $0998975645455$ must be somewhere in the digits of $\pi$.  The reason for this was that $\pi$ is irrational, meaning it's infinite and irregular.  But $\sum_{k=0}^n \frac{1}{10^{k!}}$ is transcendental and its digits are composed of $0$ and $1$ only.  So irrationality does not guarantee the property I mentioned.  Is it really true that one can find any number sequence from $\pi$?

I came across the :    Which states:     $\pi$ Pi      Pi is an infinite, nonrepeating $($sic$)$ decimal - meaning that   every possible number combination exists somewhere in pi.  Converted   into ASCII text, somewhere in that infinite string of digits is the   name of every person you will ever love, the date, time and manner    of your death, and the answers to all the great questions of    the universe.   Is this true? Does it make any sense ?


I have this table:   ID     Value           -----------------       3       A1                       4       A2                       8       A20                    10      A10     I have to create only two rows with the name of the columns at the beginning, I think using the pivot, but I don't know how to do it:   ID        3    4    8    10    -----------------------------------      Value     A1   A2  A20   A10

My table is like this:  Sitecode    Month  Amount --------    -----  ------ XX          Jan     1000 XX          Jan     3000 XX          Apr     3000 XX          Apr     1000   What I want is, to show the result something like this:  Sitecode    MonthJAN   MonthAPR --------    --------   -------- XX          4000       4000


Does $$\sum_{k=1}^{\infty} \left(1-\cos\frac{1}{k}\right)$$ converge or diverge?

I'm having trouble determining the convergence of the series:  $$ \sum_{n=1}^{\infty}\left[1-\cos\left(1 \over n\right)\right]. $$  I have tried the root test:  $$\lim_{n\rightarrow\infty}\sqrt[n]{1-\cos\frac{1}{n}}=\lim_{n\rightarrow\infty}\left(1-\cos\frac{1}{n}\right)^{1/n}=\lim_{n\rightarrow\infty}\mathrm{e}^{\frac{\log(1-\cos\frac{1}{n})}{n}}=\mathrm{e}^{\lim_{n\rightarrow\infty}\frac{\log(1-\cos\frac{1}{n})}{n}}$$  Now by applying the , that upper limit is equal to:  \begin{align} \lim_{n\rightarrow\infty}\frac{\log(1-\cos\frac{1}{n+1})-\log(1-\cos\frac{1}{n})}{(n+1)-n}&=\lim_{n\rightarrow\infty}\left(\log(1-\cos\frac{1}{n+1})-\log(1-\cos\frac{1}{n})\right) \\&=\lim_{n\rightarrow\infty}\log{\frac{1-\cos{\frac{1}{n+1}}}{1-\cos{\frac{1}{n}}}} \end{align}  Now I'm totally stuck, unless that quotient is actually 1, in which case the limit would be 0, the Root test result would be $\mathrm{e}^0=1$ and all this would have been to no avail.  I'm not sure this method was the best idea, the series sure seems way simpler than that, so probably another method is more appropriate?


For all $n\geq 1$ we have a set $\begin{Bmatrix} 0,1 \end{Bmatrix}^n$  that only consists of $0$'s and $1$'s. Let $G_{n}$ be the set containing all elements except elements where two $1$'s are standing next to each other.    So e.g. $G_{3} = \begin{Bmatrix} (0,0,0),(1,0,0),(0,1,0),(0,0,1),(1,0,1) \end{Bmatrix}$ Now let $a_{n}$ be the amount of elements in $G_{n}$. So $a_{3} = 5$.     I have to prove that $a_{n} = a_{n-1} + a_{n-2}$ for all $n\geq 3$.  I know that each set contains $n-1$ elements ending with $1$ as its given that two $1$'s can't stand next to each other. Now  let $x$ be the elements ending with a $0$. We can define that $a_{n} = n-1+x$. But if I fill this in $a_{n-1}$ and $a_{n-2}$ it seems that I can't get anything out of it.

I am studying for an exam and I am having trouble with this practice question:  In this question, we consider finite bit strings that do not contain $00$. Examples of such bitstrings are $0101010101$ and $11110111$. For any integer $n\geq 2$, let $B_n$ be the number of bitstrings of length $n$ that do not contain $00$.   Determine $B_2$ and $B_3$. Prove that $B_n = B_{n-1} + B_{n-2}$ for each $n\geq 4$. For each $n\geq 2$, express $B_n$ in terms of a Fibonacci number.   Any help is greatly appreciated


$a, b$ and $c$ are the sides of right triangle where $c$ is the hypotenuse. Show that the inradius, $r$, of the right triangle satisfies $a+b+c=2r$. Circle is inscribed into the triangle.

Find the radius of the inscribed circle of a right triangle. The triangle's height is $\sqrt{6} + \sqrt{2}$ while the bisector of the right angle is 4.  This seemed like a generic similar triangles problem but it isn't that simple when I tried to solve it. Any help?  EDIT: Here is a picture of the problem


My mother and I recently both got visit visa refusal, although we have visited the UK 6-7 times and never got any refusal.  The refusal point for my mum was that:     in your previous application you have stated that you intend to stay   in UK for a period of one month, however you remained in the UK for   more than 4 months and you have not mentioned the reason why you   stayed for this long period.   The reason we stayed there for more than the intended period was that my brother was buying property and he wanted my mum and dad to receive the keys and step in the house first. They left the UK one week after he got the house keys and documents etc. Also, the EID festivals fell in the same dates, which we wanted to celebrate together.  My refusal point was that, in addition to the above mentioned point of length of stay, I provided employment letter and salary slips but my bank statement does not show the monthly salary. My company pays cash if the salary is less than Rupees 50,000/- so it's not showing in my bank statement.  How can I prove my employment? Can I add some office pictures, a letter from my employer that they are paying my in cash, pictures of some conferences and training I participate in? Any other ideas?

The UK Visas and Immigration Directorate publishes  that provides helpful tips that can result in successful visa applications. Section 2 of this guidance opens is entitled "other documents you may want to provide" (emphasis mine).  Section 2: other documents you may want to provide – all visitors This section provides guidance on the types of documents that you may want to provide to help us consider your application against the Immigration Rules. Previous travel documents/passports, which show previous travel. Financial documents showing that you have sufficient funds available.  These must clearly show that you have access to the funds, such as:  bank statements building society book proof of earnings such as a letter from employer confirming employment details (start date of employment, salary, role, company contact details) where a third party (who is either in the UK or will be legally in the UK at the time of your visit) is providing financial support to you e.g. a business, a friend or a relative, documents to show that they have sufficient resources to support you in addition to themselves and any dependant family should be provided   The first item is "bank statements" and this ties in with the , which says...  evidence that you can support yourself during your trip, eg bank statements or payslips from the last 6 months  (Note 'eg' is a Latin abbreviation meaning "for example"; this appears to be optional rather than a fixed requirement.) Question: How should someone interpret this such that the chances of success are maximized? How many statements should I submit? What are they looking for and what do my bank statements tell about me?


I read a question, thought it was interesting, voted it up. It needed some editing, so I started fixing all the grammar mistakes, added punctuation, improved sentence structure; I realized that the quality of this question was very low - it felt like the OP didn't put any effort into it at all - no evidence of research was provided, and a very unclear question was asked.   I changed my mind about the upvote, but I couldn't change my vote until the post was edited. In a couple of minutes my edit was accepted, and I was able to change it to a downvote.  Is it normal? It just seems weird that your own edit can let you change your vote on a question.

This is somewhat related to this question:    But relates more to the senario that when a vote has been locked for a particular post, the user can edit the post (by maybe just adding new line or something) and subsequently the user can then change the vote the that was previously locked.  It's a strange feature but essentially renders the functionality of locking votes useless for users with enough points to edit posts.


When I am running apt get update in Ubuntu mate 18.04 the following things happens   Err:10 https://repo.skype.com/deb stable/main amd64 Packages                    File has unexpected size (2248 != 2481). Mirror sync in progress? [IP: 104.89.123.202 443] Hashes of expected file:  - Filesize:2481 [weak]  - SHA512:97a1cc8c9c71d68e35b37c9ef33a85859bbabb482b482a71c70d657cc9464210fce0a1afda11dd5c8275071b60291324dac9b0a39979542cef326a14e09be5fc  - SHA256:27a18eb994515c58706b3516b1430d5cdb4a3030fc95fc4c17a6e712f00f808b  - SHA1:8dedefb9caea4b2f69fac16419494805e8c87a76 [weak]  - MD5Sum:67e1b981d511902b109dc6bfd54ce30d [weak] Release file created at: Mon, 24 Sep 2018 12:21:19 +0000   And the following when reading the packages.  Reading package lists... Done E: Failed to fetch https://repo.skype.com/deb/dists/stable/main/binary-amd64/Packages.bz2  File has unexpected size (2471 != 2457). Mirror sync in progress? [IP: 23.58.225.224 443]    Hashes of expected file:     - Filesize:2457 [weak]     - SHA512:58f0d8f3255a5cc7f28a3a1270ff655e187c9cae212391a570b6c3512c20852549a0f706c9df7ccd1be7cc3ce791547c2c6dcdf44021425756c1d824995be14a     - SHA256:bcd5e58ed12bf52cd8a16d947b9209f4292d339dc11898f8ebe501106b5dc311     - SHA1:d534917678932e9320d80da96c4f1b2c6dbf478c [weak]     - MD5Sum:2a9e2b845f1b29d8ee10ec10de46686d [weak]    Release file created at: Mon, 24 Sep 2018 11:56:19 +0000 E: Some index files failed to download. They have been ignored, or old ones used instead.   From here I can see the problem is in skypeforlinux package, but I can't find a way to solve it.

I want to install Skype, but I can't locate it in Software Center or by using Synaptic Package Manager. Can anyone help me?


Can we prove that $K_n$ is Hamiltonian for all $n\geq 3$ ? I was unable to prove it. Please help me with this.

I'm asked the following quesiton:       Show that if $n\geq 3$, the complete graph on $n$ vertices $K_n$ contains a Hamiltonian cycle.     This seems obvious since $K_n$ contains a subgraph which is a cycle graph hitting all $n$ vertices. What am I missing here?


First, I know what the right answer is, and I know how to solve it. What I'm trying to figure out is why I can't get the following process to work.  The probability that we get 2 consecutive heads with one flip is 0. The probability that we get 2 consecutive heads with 2 flips = 1/4. The probability of getting 2 consecutive heads with 3 flips = 1/6. The probability of getting 2 consecutive heads with 4 flips = 2/10 = 1/5. And the probability of getting 2 consecutive heads with 5 flips = 3/16.   Am I doing something wrong. I don't see any easy way to use these numbers to solve the original problem of finding the expected number of coin flips to get 2 consecutive heads.

Problem: This is problem 33 of section 2.6 (conditioning) in Bertsekas, Tsitsiklis intro to probability text.  We are given that a coin has probability of heads equal to p and tails equal to q and it is tossed successively and independently until a head comes twice in a row or a tail comes twice in a row. What isthe expected value of the number of tosses?  Solution:  Let $X$ be a random value that tracks the number of tosses. In addition, let $H_k, T_k$ be the event that a head or tail comes up on the kth flip respectively. The solution I am looking at involves using total expectation theorem.  I outline the following steps in the solution.  We can partition the sample space into $H_1$ and $T_1$, allowing us to invoke the total expectation theorem. Hence,  $E[X] = pE[X|H_1] + qE[X|T_1]$  Again by total expectation theorem, we can utilize another partition to obtain  $E[X|H_1] = pE[X|H_1,H_2] + qE[X|H_1,T_2] = 2p + q(1 + E[X|T_1])$  $E[X|T_1] = qE[X|T_1,T_2] + pE[X|T_1,H_2] = 2q + p(1+E[X|H_1])$  Stuck: The solution follows up by saying that we can combine the above two relations and use the fact that p+q = 1 to obtain  $E[X|T_1] = \frac{2+p^2}{1-pq} , E[X|H_1] = \frac{2+q^2}{1-pq}$  I have been staring at this for a while now, but I cannot seem to see the steps of the computation. I'd be very grateful if someone could fill in the details regarding the computation. Thank you.


The C++ language has specific rules about how you must free the memory to which a pointer points.  These rules require you to know how the memory was allocated in order to correctly free it.  For example,  int *p = new int(); std::free(p);   results in undefined behavior. ()  In modern C++, we like to use smart pointers where possible, but sometimes we may want to use libraries or functions that allocate raw pointers.  Suppose I want to use a function of the form:  char* NotMyFunction();   How do I properly manage the memory allocated by this function?

Consider:  char *p=NULL; free(p) // or delete p;   What will happen if I use free and delete on p? If a program takes a long time to execute, say 10 minutes, is there any way to reduce its running time to 5 minutes?


Recently the Duchess of Cambridge gave birth to a healthy baby boy. The announcement from Buckingham Palace said "The Duchess of Cambridge has been delivered of a son."  This struck me as a very odd grammatical structure that I don't quite understand. Of course I understand what is meant: "She gave birth to a male child" and I presume it is put this way for the purposes of delicacy. But I was wondering if someone could explain how this grammatical structure works.

With all the "Royal baby" craze comes something that really confuses me. All the news media used pretty much the same sentence to make the announcement:      The Duchess of Cambridge has been delivered of a son.   A couple of questions:   Why not "The Duchess of Cambridge gave birth to a son" or "delivered a baby", or something along those lines? Why is "of" used in this structure, and what purpose does it serve?   From a non-native English speaker's perspective, this sentence doesn't seem to make any sense at all to me.


I want to merge the pipe and the bottom part together so it looks like the pipe is welded to it. I tried merging using ALT + M but the result is not good. How can I do this?      Reference:

So in the image below there are two circles, how can I remove the internal vertices between them without messing up the outside shape. I'm working on a gun and this is just a simple way to illustrate the issue I'm dealing with. If I where to go in and delete the internal faces it would leave holes on the outside of the object, is there a fast way to get around this?


>git branch -a * master   remotes/origin/HEAD -> origin/master   remotes/origin/master   Are they both same, if yes then why do we have two.

When you run git branch -r why the blazes does it list origin/HEAD? For example, there's a remote repo on GitHub, say, with two branches: master and awesome-feature. If I do git clone to grab it and then go into my new directory and list the branches, I see this:  $ git branch -r origin/HEAD origin/master origin/awesome-feature   Or whatever order it would be in (alpha? I'm faking this example to keep the identity of an innocent repo secret). So what's the HEAD business? Is it what the last person to push had their HEAD pointed at when they pushed? Won't that always be whatever it was they pushed? HEADs move around... why do I care what someone's HEAD pointed at on another machine?  I'm just getting a handle on remote tracking and such, so this is one lingering confusion. Thanks!  EDIT: I was under the impression that dedicated remote repos (like GitHub where no one will ssh in and work on that code, but only pull or push, etc) didn't and shouldn't have a HEAD because there was, basically, no working copy. Not so?


This is my code structure: Flashtraining.h #ifndef Flashtraining_h #define Flashtraining_h  #include "Enhanced_SPIFlash_Marzogh\\SPIFlash.h"  class Flashtraining {    static SPIFlash myflash; //Should it be declared outside private/public? Does it matter?   public:     bool start_new_training();     bool stop_training();     /*Some more methods*/   private:     bool _Check_or_Initialize();                     };  Flashtraining.cpp #include "Flashtraining.h" SPIFlash Flashtraining::myflash;  bool Flashtraining::start_new_training(){ /*Do smth. with myflash object*/ }  bool Flashtraining::stop_training() {   /*Also do smth. with myflash object*/ }  main.cpp #include "Flashtraining.h"  Flashtraining training; //Create object of class Flashtraining  training.start_new_training(); //Ignoring the main funcion, return values etc.  SPIFlash has no constructor and only non-static members. If you need this file too, comment and I will provide it, but I am sure it is not the problem here. My problem: When executing this code, I get C:\Users\--\Flashtraining.cpp.o: In function `Flashtraining::_Check_or_Initialize()':  C:\Users\--\Flashtraining.cpp:265: undefined reference to `SPIFlash::begin(unsigned char, unsigned long)'  C:\Users\--\Flashtraining.cpp:268: undefined reference to `SPIFlash::getJEDECID()'  Note: _Check_or_Initialize() is one of the functions declared in the Flashtraining.cpp file. It is declared just like the other ones I have provided. The functions in SPIFlash are declared non-static and implemented correctly. What I don't understand: Because I use the static keyword, I can just declare an object(myflash of type SPIFlash) in the header file (Flashtraining.h) without initializing it, right? This also prevents redefinitions. Because of the One definition rule in c++, I initialize the variable once in Flashraining.cpp, where it is used. I then should be able to use (.) notation to access non-static members (the functions, like myflash.start_training()), or not? Why is this giving me an undefined reference and how can I fix it? I looked at  post and think that I changed my code accordingly, but it doesn't work. Additional information: This is .ino code, which is based on c++. Everything written in c++ works normally. Using -std=gnu++11.

Can anyone explain why following code won't compile? At least on g++ 4.2.4.  And more interesting, why it will compile when I cast MEMBER to int?  #include <vector>  class Foo {   public:       static const int MEMBER = 1;   };  int main(){       vector<int> v;       v.push_back( Foo::MEMBER );       // undefined reference to `Foo::MEMBER'     v.push_back( (int) Foo::MEMBER ); // OK       return 0; }


After reading the Silmarillion, I wondered why the Valar, being near-gods, don't do anything about Sauron. They certainly possess the power; without Morgoth, Sauron is just in his shadow. At least Eru should be able to do something. Sorry if this has been asked before, I'm just a bit curious.

At the end of ‘The Return of the King’, Bilbo, Frodo, Gandalf and others boarded a boat and left Middle-earth for Valinor.  Is there any canon explanation why they couldn’t just take the ring there in the first place and leave Middle-earth altogether? Would Sauron have gone after them? Couldn’t the elves living there safeguard it?  I do realize that without Frodo taking the ring to Mount Doom there would be no story at all, but I wonder whether or not there is any canon explanation for this.


I got an interesting differential equation: $(1+D+D^2+D^3+\cdot\cdot\cdot)y = f(y)$ where $D$ is the differentiation operator $\frac{d}{dx}$ and $y$ is a function of real variable $x$. In an attempt to solve this, I took the infinite sum as $\frac{1}{1-D}$. Then taking it to RHS I could solve the differential equation : $y=f(y) - \frac{df}{dy}\frac{dy}{dx}$ Is this a correct method of solving this problem? please suggest a proper method to solve this. EDIT : My rationale behind using the formula was: let $f$ be a trial function such that $$(1+D+D^2+\cdot\cdot)f=g$$ $$f+D( (1+D+D^2+\cdot\cdot)f) = g$$ $$f+D(g) = g$$ $$f=(1-D)g$$ $$\frac{1}{1-D}f = g$$ UPDATE An $n^{th}$ order ODE should have $n$ arbitrary constants. Here after simplification it has only 1. I think that is useful.

Consider, $$ S= \sum_{k=0}^{k=\infty} \frac{ k!}{x^{k}} (-1)^k$$ now this is, $$ S = ( 1 +D+D^2 +D^3...) ( \frac{1}{x})$$ using geometeric series $$ 1+D+D^2.. = \frac{1}{1-D}$$ So, $$ S= \frac{1}{1-D} \frac{1}{x}$$ $$ S = \frac{1}{x-1}$$ Therefore , for x<1 $$ S= \sum_{k=0}^{k=\infty}(-1)^k \frac{ k!}{x^{k}}=\frac{1}{x-1}$$ Is this proof correct? Can I find an expression for l.h.s for x>1 ?


I have computer A in which I run "xclock" program. I want to forward it's graphical interface to my pc, not directly but through computer B. Is it possible? I'm running xming on my pc.  Resuming: A runs xclock > A forwards to B > B forwards to my PC. Is it possible?

I have a machine running Ubuntu which I SSH to from my Fedora 14 machine. I want to forward X from the Ubuntu machine back to Fedora so I can run graphical programs remotely. Both machines are on a LAN.  I know that the -X option enables X11 forwarding in SSH, but I feel like I am missing some of the steps.  What are the required steps to forward X from a Ubuntu machine to Fedora over SSH?


After upgrading to iOS 14.4.2 my iphone keeps rebooting every 5 mins! I would like to restore my iphone to iOS 14.3.7. After finding signed firmware I tried using iTunes but kept getting error 9 . I found the solution in  stated that (in short) this is Apples way of giving trouble by removing signed firmware! However he suggested a solution that utilizes paid version of the software to flash earlier version of firmware (ISPW) into iphone, using Reiboot Now my iphone is completely unlocked, with my account signed in and everything is legit, yet if I restore earlier ISPW, then iTunes keep giving me error that I cant install old firmware! I need to know if there are any free tools online or Github project that can flash old firmware into iPhone? or anyway to check what is causing kernel panic. When I say old firmware i mean just one step earlier revision where my iphone didnt keep rebooting!  (update 1) iOS 14.4.2 is known to have heating issue which is perhaps why my iphone is rebooting -

I'm trying to downgrade my iPhone from the current iOS to an older one, as per .  But every time I try, I always receive this error:     The iPhone could not be restored. This device isn't eligible for the requested build.     I have tried many times with and without DFU mode. Any ideas regarding this?


I seem to get a non-stop flow of Raider Troubles, Ghoul Problems, and Kidnapping missions--there seems to always be one or two that want my attention. They're kind of irritating, and I was curious if there's any downside to just ignoring them and letting them fail.

My settlement was attacked by some Raiders and my defenses took care of them along with some of my NPC's. It seems like the Raiders didn't make it through to any of the buildings. What happens when they do?  Can you lose your items if you stored them in a house?  Can the NPC's die?  Do the enemies destroy your buildings?


Pattern subsetPattern = Pattern.compile("select(.*)from.*");   Pattern resourcePattern = Pattern.compile(".*from(.*)(where|limit|;).*");   Pattern filterPattern = Pattern.compile(".*where(.*)(limit|;).*");       public Query(String queryString) {          System.out.println(queryString);          // removes all the newlines in query.         queryString = queryString.replace("\n", "").replace("\r", "");         queryString = queryString.toLowerCase();          Matcher subsetMatcher = subsetPattern.matcher(queryString);         Matcher resourceMatcher = resourcePattern.matcher(queryString);         Matcher filterMatcher = filterPattern.matcher(queryString);          if (subsetMatcher.matches()) {           subset = subsetMatcher.group(1).trim();         }         if (resourceMatcher.matches()) {           resource = resourceMatcher.group(1).trim();         }         if (filterMatcher.matches()) {           filter = filterMatcher.group(1).trim();         }          System.out.println(subset + "\n" + resource + "\n" + filter + "\n" + limit);         System.out.println("===========");       }   Above code prints out the following output  SELECT col_x, col_y FROM table_name WHERE col_z = 'yello'  LIMIT k; col_x, col_y table_name where col_z = 'yello'  limit k col_z = 'yello'  limit k null ===========   why does the resource group matcher do not stop at the where ?

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


Is it possible to make something like in the picture below in Blender? I mean ortographic view with like back planes moved along one axis but without modyfying mesh. Is there a camera option for it? Is it even possible?

How can I get a camera to render with a ?  I know it is possible to get a , but that's not really what I want.  I've tried positioning an orthographic camera in almost all possible ways but still can't get one. Actually an orthographic camera wouldn't work because as soon as you get the world x-axis parallel to the viewport x-axis, the world y-axis is always parallel to the viewport y-axis.  I think it is something like shearing, but I am not so sure.  Cabinet projection:


I am using Ubuntu 16.04. I am following this guide to install hercules:    This URL gives 403 error (forbidden):

How can I install applications like Google Chrome on Ubuntu?  Are there any commands to install an application?    Index of answers:


I have a HP desktop with IDT 92HD89E Beats Audio sound chip, and there is no driver for it. At the time I had Ubuntu 14.04 but there was no sound.  I switched back to Windows so I can have sound. Now I want to switch back to Ubuntu, but this time 17.10. Is there like a work around or something that can help me? Thanks.

I recently shifted to Ubuntu.  My beats audio speakers connected to my laptop are not working. I am using an hp ENVY dv6 laptop.  What should I do?


How can I make this work?  I know that MyOtherClass m_myOtherClass; is not known at this point and so I get errors, but what is the solution when you have to do stuff like that? Forward declarations and includes dose not work because the compiler does not know all it is needed, for example object size.  I know I can solve this problem with pointers, but this means that there is NO SOLUTION for a problem like this? when someone want the classes to be exactly like these?  #ifndef MYCLASS_H #define MYCLASS_H  class MyClass{  private:     MyOtherClass m_myOtherClass; //Error unknown type name };  #endif // MYCLASS_H   second header file:  #ifndef MYOTHERCLASS_H #define MYOTHERCLASS_H #include "myclass.h"  class MyOtherClass{ public:     MyClass m_myClass; };  #endif // MYOTHERCLASS_H

I often find myself in a situation where I am facing multiple compilation/linker errors in a C++ project due to some bad design decisions (made by someone else :) ) which lead to circular dependencies between C++ classes in different header files (can happen also in the same file). But fortunately(?) this doesn't happen often enough for me to remember the solution to this problem for the next time it happens again.  So for the purposes of easy recall in the future I am going to post a representative problem and a solution along with it. Better solutions are of-course welcome.     A.h  class B; class A {     int _val;     B *_b; public:      A(int val)         :_val(val)     {     }      void SetB(B *b)     {         _b = b;         _b->Print(); // COMPILER ERROR: C2027: use of undefined type 'B'     }      void Print()     {         cout<<"Type:A val="<<_val<<endl;     } };       B.h  #include "A.h" class B {     double _val;     A* _a; public:      B(double val)         :_val(val)     {     }      void SetA(A *a)     {         _a = a;         _a->Print();     }      void Print()     {         cout<<"Type:B val="<<_val<<endl;     } };       main.cpp  #include "B.h" #include <iostream>  int main(int argc, char* argv[]) {     A a(10);     B b(3.14);     a.Print();     a.SetB(&b);     b.Print();     b.SetA(&a);     return 0; }


My client is planning to host their applications on cloud. And I have been asked to suggest what all needs to be purchased. With all the names / products I am feeling lost. From my experience, these are the following thats needed for a normal hosting.   RDS (MSSQL DB) is there need for backup / failover - (units 01) Windows Instance (hosting .net app. Should we host the DB also) - (units 01) Linux Instance (hosting php app) - (units 01) load balancer - is it required? elastic ip (I guess this is static ip) - (units 01)   Both 2 & 3 are webservice / APIs and a management web app. Traditionally, I deploy 2 instances of windows & 2 instances of linux behind a load balancer to work around any failovers / bottlenecks.   Data transfer - I want to host everything within one region (EU-IRELAND or EU-FRANKFURT). So will there be charges  This is the calculation I arrived at .  PS: Apologies, if the question may seem broad.

This is a  about  Related:      I have a question regarding capacity planning. Can the Server Fault community please help with the following:   What kind of server do I need to handle some number of users? How many users can a server with some specifications handle? Will some server configuration be fast enough for my use case? I'm building a social networking site: what kind of hardware do I need? How much bandwidth do I need for some project? How much bandwidth will some number of users use in some application?


I have Windows vista 64 bit with a free D: drive that has nothing on it.   How do I install Ubuntu Dual Boot  The drive is formatted but did I do it right? How can I tell?

I need my pre-installed version of Windows 7 (or any other version of Windows), how could I install Ubuntu without erasing it?


I'm just curious about when certain badge calculations are done.  Are certain badges like the serial upvote detection script that runs at 3am?  I have this question .  I DO have nice answer for it, but I dont have enlightened yet.  Not sure if that is because they are calculated differently or what.  Thanks for the clarifications.

Do badges get calculated in real time, or do they get calculated by an external service? How long does it take for a badge to be awarded, once its requirements are met?  Does Stack Overflow use any external services to do things, like maintenance, e-mailing or badge calculation?


I am trying to install the fSpy add-on for Blender. I've downloaded it as a .zip file and went to user preferences to install it. However, it does not show up in any list of add-ons in user prefs.   When I checked the console it repeatedly shows the following:  Modules Installed () from '/Users/lihechen/Downloads/All Files/Plugins/Blender/fSpy-Blender-master.zip' into '/Users/lihechen/Library/Application Support/Blender/2.81/scripts/addons'   But nothing shows up. Can anyone please help? I'm using Blender 2.81

I have tried installing fspy in blender 2.81, however it says it is 'installed' (as can be seen in attached image) but then doesn't appear in add-ons list, and hence cannot be enabled.


Hi amazing HeroStacks So as title suggest, I have an embedded google drive document (.pdf), where my webpage loads a window with a 36 page interactive brochure. My goal is to be able to link to a specific page in that .pdf document from the outisde. So say for instance a button/link click from my webpages footer area (or newsletter), goes to a specific products page or perhaps headline withing the document. Is that doable? The interactive pdf, allready have links within the document and that works great. And I know I have to make the document viewable for everyone with a link etc, else the embed window will show some access limitied window, but how do I jump to a page or section from the outside?

I'd like to provide a link to a PDF document in Google Drive like [documenturl]?page=4 and have that link jump to the specified page.  With a quick search, I was only able to find this unresolved forum question:


Why is there no Stack Exchange community about law?

I think a Legal Stack Overflow would be an excellent resource. Why doesn't such a thing exist? If it doesn't, I'd like to create one.


This question is not a duplicate, it is not about right and wrong answers and questions, it is about whether an acronym for sloppy answers to good questions would be useful, and I propose one that seems reasonably polite, more than some well known acronym for the opposite case (RTFM for sloppy questions). This is obviously based on the assumption that there are also sloppy answers, not only sloppy questions.  More often than expected I see that questions like "... how do I do x in Y ..."? even when they are clearly and well specified get some replies that do NOT answer the question at all and go like: "In Y doing x is bad style" "Why would you want do to x?" "Why are you using Y"? "Tell me the story of your life so we can understand why you wrongly chose language/tool Y rather than Z that is more ..." ...  Such replies would be somehow acceptable if they came along with the requested answer, most of the times there is no answer, this is the case I am writing about (and about clear, well specified questions)    Such annoying non-answers seem nearly as frequent as sloppy questions. For sloppy questions there is RTFM. For this annoying non-answers I am not aware of useful acronyms, so I propose FATFQ, which seems not only appropriate but also rather "open" and kind, relative to this kind of non-answers: it is not JATFQ or OATFQ (Just Ask.../ Only Ask ...) it is "First Ask The Fine Question", after that free to explain how right your tools and vision of the world are and how wrong the question is, but first, before the sermon, please answer the fine question, maybe by saying that you do not see any way to do x in Y.

In the limited number of questions I have asked on Stack Exchange, I have had several comments and answers that are not answering my question, but are instead saying that I should be asking something else.  The most recent example is at , which basically asks how to increment the value of a GUID variable by 1. In the comments, user "atlaste" explains why this may be a bad idea, and that some people use dedicated hardware for similar things, but nothing relating to my question or its phrasing.  I understand this in general -- in my own life I find that when people come to me with a question, I often want to better understand where they are coming from to make sure my answer really fits their problem. I see this partly as a way to reduce the risk of miscommunication, and partly to reduce the risk that the person did not think the problem through.  But it is my predisposition to think that in a Stack Exchange site, we should assume that the questioner knows at least approximately what they want. Because even if the question was not the best for that one person, the answer should apply to the question so that future users will find this question and answer to be useful.  So my question is, to what level is it acceptable to dispute the premise of the question that is being asked?  This is related to , but I believe slightly different. Seeing this as the "XY Problem" assumes that you have that problem. Here I am asking, "To what extent is it okay to assume that the question is an instance of the XY Problem?"  Here is a (somewhat ludicrous) example of a problem, with background, and the question I could ask at the end of it.   I want to have a pretty house I decide that pretty is "feng shui", with all those crazy rules and oblique lines I want to rebuild my garage to have oblong walls I decide to do this be hand, and use a sledgehammer to rip the walls apart I injure my back by doing this with no training I ask the question: "What is the right way to use a sledgehammer so that it does not hurt your back?"   Now if you want to apply the "XY Problem" here, you could question many things. And the more details I give of the background problem, the more you could question the premise.   Why did I use manual sledgehammer instead of some "power" hammer Why did I try to use a sledgehammer without formal training -- go get some real training instead Why did I use a sledgehammer myself -- go pay a contractor instead Why did I use a sledgehammer at all, instead of a saw Why don't I just buy a new house instead Why do I like "feng shui" Why should houses be pretty   In my opinion, you cannot go all the way back up the stack; it is ridiculous to do so. So is it ever okay to debate the premise? How do you know how far is okay to go?


There's a compelling theory put forth (or at least reiterated) I believe by Feynman(?) (Edit: Sorry it was Penrose) , that, assuming all subatomic particles eventually decay, the resulting empty universe becomes a singularity and a big bang happens again, birthing a new universe. Surely spacetime isn't changing size in such a case - lest the planck length change with it. It seems, then, that in the absence of anything to measure it, spacetime just doesn't really exist and is just a mathematical construct simplifying the description of how forces and matter interact based on whatever laws govern physics. This might seem like semantics, but when it comes to discussing space being shaped to connect two different "regions" as with wormholes the distinction seems to matter. So is spacetime a real tangible fabric of the universe or is it more of a description of a range of interactions and behaviors? Edit: I'm not dissenting spacetime's success at describing reality. But rather, it seems to me that in reality, the way particles interact is based on individual and entangled wave functions and the way those particles interact with all of the fundamental forces. So then isn't spacetime just a simplified construct? Einstein's equations predict wormholes but I'm curious if they just show up as a mathematical quirk because of the equations treat spacetime as a 3+1D fabric, when it seems like perhaps it's more complicated than that. Or maybe it's not. Maybe spacetime really is a fabric filled with dark energy that exists even in a true vacuum. Seems like a valid question to me, despite the comments it's getting.

What is space time? Is it like a material or a theoretical substance? Is it made up of chemicals? Is there a way to interact with it?   I know that gravity can deform it but other than that. Can some one give me a good explanation? I am only 15 :)


Let $X$ and $Y$ be two random variables. I notice a book states $E(X + Y) = E(X) + E(Y)$ without proof. I think, for the simplest case, the proof can be the following:- $E(X + Y) = \sum p_i (X + Y) = \sum (p_i X + p_iY) = \sum (p_i X) + \sum (p_i Y) = E(X) + E(Y)$. But what happens if the corresponding probabilities for Y are $q_i$ and $p_i \ne q_i$ in general?

The proof of linearity for expectation given random variables are independent is intuitive. What is the proof given there they are dependent?  Formally, $$ E(X+Y)=E(X)+E(Y)$$ where $X$ and $Y$ are dependent random variables.  The proof below assumes that $X$ and $Y$ belong to the sample space. That is, they map from the sample space to a real number line. Is that also a condition for linearity of expectation?  Proof: $$E(X+Y) =\sum\limits_{s}(X+Y)(s) P({s})    $$ $$E(X+Y) =\sum\limits_{s}(X(s)+Y(s)) P({s})    $$ $$E(X+Y) =\sum\limits_{s} X(s)P({s}+ \sum\limits_{s} Y(s)P({s})     $$ $$E(X+Y) =E(X)+E(Y)$$ Here $S$ is the sample space and $s$ is an event in the sample space.   for proof.  Also, more reasoning for step 2 would be helpful. I don't understand it completely.


I want to test if an element with a specific class name exists or not. Here's my code:

1

A Head Full Of Dreams

03:44

Coldplay

   JS  $('.track').dblclick(function() {     var $prev;     $prev = $(this).parent('div').find('.status-active');     if ($prev != null) {         //This will always be true     } }   And the picture below is the screenshot of the console   I'm confused by the layers of the object. It means that even if I did't get the object with the class that I want, I still get the object with the parent element. So the object is not null, and the result will always be true?  I have found the solution to fix the mistake is that I need to use the lengthproperty.  if($prev.length){     //This works! }   Just want to clarify the idea that when can I test the result using null value? I'll be appreciate if you give me some advice!!

How can I check the existence of an element in jQuery?  The current code that I have is this:  if ($(selector).length > 0) {     // Do something }   Is there a more elegant way to approach this? Perhaps a plugin or a function?


There are favorite and ignored tags in Preferences. They need to explicitly list your tags. I would like to have wild char support here, so for example *PHP* will find PHP, PHP3, PHP4, PHPUnit, CakePHP and all other PHP tags.

I'd like to be able to specify an interesting or ignored tag via a wildcard.  May tags which cover similar topics have common roots.  For example  windows windows7 windows-vista windows-xp windows-errors windows-xp-sp3   would all match the wildcard windows*.  Someone who finds one of these tags "interesting" would probably find all of them to be "interesting" (or vice versa, if they want to ignore all the windows related stuff, they would need to ignore all of these tags).  I realize that technically everything tagged windows-xp should also be tagged windows, but that's not the case.  ()


In my general topology class, we introduced some basic algebraic topology. My professor mentioned the term $\pi_0$ together with path components of $X$, but I forgot what he said. Does anyone know what is it? And he also mentioned $\pi_{\leq 1}$ and $\pi_2$. What are these things? We use Munkres' Topology.  In section 52, he mentions "There are indeed groups $\pi_n (X,x_0)$ for all $n \in \Bbb Z_+$, but we shall not study them in this book. They are part of the general subject called homotopy theory."

What are the elements in the zeroth homotopy group? Also, why does $\pi_0(X)=0$ imply that the space is path-connected?  Thanks for the help. I find that zeroth homotopy groups are rarely discussed in literature, hence having some trouble understanding it. I do understand that the elements in $\pi_1(X)$ are loops (homotopy classes of loops), trying to see the relation to $\pi_0$.


I'm trying to have a shortcut for going back a few dirs. Something like "cd ...." == "cd <number of dots - 1> * '../'"  I tried doing alias '...'='../..' && cd ... but got "No such file or directoy" I then tried doing alias '...'='../..' but got "invalid alias name" I guess I can create a function: function bla { for i in $(seq $(($1 - 1))); do cd ../; done;  }; bla 3 but that seems less elegant (and also I cd ../ one in a time which is bad (cd - won't have the desired effect for example) but I can concat the strings and only cd at the end)  My questions are: How to solve (1) & (2) and is there a neater way for this?

I often find myself doing commands like this  cd ../../../../../   Is there a shortcut I can use that will cd ../ n times?


One activity in my project is crashing. LogCat says "Null EXception " . Simple Adapter giving null exception. I have posted the feed_activity.java and feed_activity.XML file .  import android.support.v7.app.AppCompatActivity; import android.os.Bundle; import android.widget.ListView; import android.widget.SimpleAdapter;  import com.parse.FindCallback; import com.parse.ParseException; import com.parse.ParseObject; import com.parse.ParseQuery; import com.parse.ParseUser;  import java.util.ArrayList; import java.util.HashMap; import java.util.List; import java.util.Map; public class FeedActivity extends AppCompatActivity {  @Override protected void onCreate(Bundle savedInstanceState) {     super.onCreate(savedInstanceState);     setTitle("Your Feed");     setContentView(R.layout.activity_feed);     final   ListView listView =  findViewById(R.id.listview);     final  List<Map<String,String>> wordData= new ArrayList<>();                 for (int i=1;i<=5;i++){                   Map<String,String> wordInfo = new HashMap<>();                   wordInfo.put("content","word                    content"+Integer.toString(i));                   wordInfo.put("username","user"+Integer.toString(i));                   wordData.add(wordInfo);                 }     SimpleAdapter  simpleAdapter = new SimpleAdapter(this,      wordData,android.R.layout.simple_list_item_2, new String[]     {"content","username"}, new int[]     {android.R.id.text1,android.R.id.text2});     listView.setAdapter(simpleAdapter);             }         }   [LogCat for feedactivity][2] XML Activity_feed :- ListView is used inside a constraint layout .  <?xml version="1.0" encoding="utf-8"?>  <android.support.constraint.ConstraintLayout   xmlns:android="http://schemas.android.com/apk/res/android"  xmlns:app="http://schemas.android.com/apk/res-auto"  xmlns:tools="http://schemas.android.com/tools"  android:layout_width="match_parent"  android:layout_height="match_parent"  tools:context=".FeedActivity">  <ListView     android:id="@+id/listView"     android:layout_width="395dp"     android:layout_height="590dp"     android:layout_marginStart="8dp"     android:layout_marginTop="5dp"     android:layout_marginEnd="8dp"     android:layout_marginBottom="8dp"     app:layout_constraintBottom_toBottomOf="parent"     app:layout_constraintEnd_toEndOf="parent"     app:layout_constraintHorizontal_bias="0.0"     app:layout_constraintStart_toStartOf="parent"     app:layout_constraintTop_toTopOf="parent"     app:layout_constraintVertical_bias="1.0" /> </android.support.constraint.ConstraintLayout>

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?


So assume that $a^n|b^n$ then $b^n=a^n(x)$ for some integer $x$ taking the nth root of both sides you get $b=a(x^{\frac{1}{n}})$. Now I'm not sure if this is ok since $x^{\frac{1}{n}}$ is not always an integer. But it seems like it should always work so I"m not sure if this is the correct approach.

Does $a^n \mid b^n$ imply $a\mid b$? I think it does but haven't been able to prove it.  I don't know much number theory so an elementary answer would be great.


I just want to know if in an exponential function $e^x$, will $x$ always be dimensionless? If so, Why?

I have a unit measure, say, seconds, $s$. Furthermore let's say I have a dimensionful quantity $r$ that is measure in seconds, $s$. What is the unit measure of $e^r$? ($1/r$ is in $Hz$.)  My question is general, how to find the unit measure of a transformation function $y=f(x)$ where $x$ takes some known unit measure. I give above two functions $f(\cdot)=e^\cdot$ and $f(.)=1/\cdot$.


I need to think of a command that I'll execute a different command on uneven days.

When configuring cron to run a command every other day using the "Day of Month" field, like so:   1 22 */2 * * COMMAND   it runs every time the day of month is odd: 1,3,5,7,9 and so on.  How can I configure cron to run on days of month that are even like 2,6,8,10 and so on (without specifying it literally, which is problematic as every month has a different number of days in the month)?


I Don't need a tool I need an implemetation/alghorithm :) I need to make a shellscript because I can't install anything on the server   f2.txt  She has 123 apples George 18 years is old Florin it's leaving Michael it's not here Peter is smiling   f1.txt  She has 132 apples George is 18 years old Michael it's not here Peter is smiling He is sleeping   Desired output:  diff is at: line 1 : 123 instead of 132 line 2 : 18 years is instead of is 18 years lines missing: He is sleeping lines added: line 3: Florin it's leaving

I have some sql dumps that I am looking at the differences between. diff can obviously show me the difference between two lines, but I'm driving myself nuts trying to find which values in the long list of comma-separated values are actually the ones causing the lines to be different.   What tool can I use to point out the exact character differences between two lines in certain files?