I am from Pakistan I applied for 4x Weeks UK family visit visa with my 6x years daughter and they refused, my refusal issue is same. I am going to quote my refusal letter.     You stated they you are employed with A----- company and Earning Rs. ____ per month in support of your application you have provided a latter from your employer. However  I am not satisfied that one document alone demonstrates that you have the employment status and earning claimed. You also state that your spouse is employer with ___ Company and Earning Rs. ____ per month in support of your application you have provided a latter from your employer However  I am not satisfied that one document alone demonstrates that you have the employment status and earning claimed with out further corroborating evidence. I note that you have declared no other personnel income, savings or assets. Based on the information provided i am not satisfied that your circumstances are as claimed and that you have demonstrated strong economic financial ties to Pakistan.  It is your responsibility to satisfy me that your circumstance in Pakistan are such that if granted leave to enter you will abide by all the conditions attached to any such leave and that you will leave the uk on completion of the proposed visit  but you have failed to do so. therefore I am not satisfied that  you are seeking a genuine visit or that you intend to leave the uk at the end of your visit  your application for visit visa has been refused  paragraph V4.2(a) and (c) I am not satisfied that you have sufficient funds to cover all reasonable costs in relation to your visit including the cost of your journey. any cost relating to dependents and the cost of any planned activities. your application for visit visa has been refused under paragraph V4.2(e).  ,,,   These objections and reasons are not as like they thinking I have my bank statement and transactions including Rs. 4 lac balance I have transactions of my salary in statement and my husband recently employed he is also have his salary transaction in the same statement because we both using our joint account.  I just want to go Uk and meet my family for 4x weeks and I am with my 6 years daughter my husband is not going with us due to his job.  Now please guide me should I go for Administration review and provide them my bank statement because my visa rejected on 26 July 2016 I still have time period for administration review OR I should reapply immediately to remove all these objections and give them more evidences I mean bank statement and our pay slips etc? Kindly guide me what to do which way will work.. Your quick help and guidelines will help me.

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?


When I try to move a model everything in a circle around it moves as well. I was not having this problem and now I am.

I created a thick glass bottle and duplicated the interior faces to make a new object to create the liquid inside.   I went in the edit mode, selected the faces I wanted to copy and duplicated them with ShiftD. Then I pressed P to  separate the duplicated faces.   Now I try to make a duplicate of that liquid to make it flow out of the bottle, and I simply need the duplicate of one face of it. So I go to edit mode and do as I did to make the liquid from the bottle faces... but as soon as I'm back to the object mode and I want to move the duplicated faces, every thing moves with it...   I played around and tried things, and while doing so I realized that if I dupe the liquid object in object mode using ShiftD and press 0 to place it where the original is, they move together if I duplicate it and place it somewhere else so that they are separated.   Also if I pick one of the two separated objects and make it intersect with the other one, release my left mouse button to place it there, and then try to move it again, they both move together, but not at the same speed.  I really don't understand what is going on and I'm sure it's really badly explained, so what I'll do is make a screen capture of my Outliner and record the behavior of the objects and upload those to help you understand.


I'm running into a rather confusing issue with server certificate verifications. When running apt update I get the following error:  W: Failed to fetch https://deb.nodesource.com/node_6.x/dists/trusty/main/binary-amd64/Packages  server certificate verification failed. CAfile: none CRLfile: none W: Failed to fetch https://packages.gitlab.com/gitlab/gitlab-ce/ubuntu/dists/trusty/main/source/Sources  server certificate verification failed. CAfile: none CRLfile: none   And also when I try to clone a Git repository, I get: fatal: unable to access 'https://github.com/certbot/certbot/': server certificate verification failed. CAfile: none CRLfile: none  The operating system is Ubuntu 14.04.5 LTS.   I tried reinstalling the ca-certificates and adding extra certificates from other sources and updating the certificates by running update-ca-certificates.   This problem just happened to spontaneously appear from all I could tell.  Hopefully somebody can help me out with this. Thanks!

I've added many PPAs using the add-apt-repository command. Is there a simple way to remove these PPAs? I've checked in /etc/apt/sources.list for the appropriate deb lines but they aren't there.   This is on a server system so a command line solution would be great!


Let $M$ and $N$ be two differentiable manifolds and $f:M\to N$ continuous. Show that $f$ is differentiable if and only if $g\circ f\in C^\infty(M)$ for all $g\in C^\infty(N)$.  My attempt:  For the direction "$\Leftarrow$" I guess that one could use some kind of identity map, however $g$ maps to $\mathbb{R}$.  For the other direction what I basically have to show is that for every chart $(\psi,V)$ in $M$ one has that $(g\circ f\circ \psi^{-1})^{(k)}$ exists for every $k\in\mathbb{N}$ (don't I?). What I tried is taking a chart $(\phi, U)$ in $N$ and considering $(g\circ\phi^{-1}\circ\phi\circ f\circ\psi^{-1})^{(k)}_x$. I can calculate the first derivative $d(g\circ\phi^{-1}\circ\phi\circ f\circ\psi^{-1})_x=d(g\circ\phi^{-1})_{\phi\circ f\circ\psi^{-1}(x)}\circ d(\phi\circ f\circ\psi^{-1})_x$. I don't really know how to continue since by assumption only the first derivative of $f$ exists. Does someone have a hint?

This is Exercise 3.1.A. in      Suppose that $\pi: X\rightarrow Y$ is a continuous map of differentiable manifolds. Show that $\pi$ is differentiable if differentialble functions pull back to differentiable functions, i.e., if pullback by $\pi$ gives mpa $\mathcal{O}_Y\rightarrow \pi_*\mathcal{O}_X$.   Let $f: V\subseteq Y\rightarrow \mathbb{R}$ be a differentiable function on an open subset of $Y$. Let $(U,\phi)$ be a chart of $X$, $(V,\psi)$ be a chart of $Y$. Then $f\circ\pi(\phi^{-1})$ is differentiable and $f\circ\psi^{-1}$ is differentiable. We need to show that $\psi\circ\pi\circ\phi^{-1}$ is differentiable. I don't know how to prove this.   Can we say that since $(U,\psi\circ\pi)$ constructs a chart of $X$, by the compatibility, $\psi\circ\pi\circ\phi^{-1}$ is differentiable? This seems true but this does not use the fact that $f$ is differentiable.  Sorry I have no background of Differentiable Manifolds. Any help would be appreciated.  I also saw this post: , but I don't understand how $\gamma$ is smooth in the answer. $\gamma=\beta\circ\rho$, where $\rho$ is defined to be smooth, but $\beta$ is not.


For any natural number $x$, determine the sum; $$ \sum_{\substack{    n\leq x   }}  \mu(n)\left\lfloor \frac{x}{n} \right\rfloor.$$ (Hint: Use $\lfloor x \rfloor=\sum_{\substack{    k\leq x   }}1.$)  Here is my start: $$=\sum_{\substack{    n\leq x   }}  \mu(n)\sum_{\substack{    k\leq \frac{x}{n}   }}1$$ if we change the order of summations then  $$=\sum_{\substack{    k\leq x   }}1  \sum_{\substack{    n\leq \frac{x}{k}   }}\mu(n)$$ But I couldn't go further

I'm currently sitting with the following number theory problem:  Prove that for all $X \geq 1$, $$\sum_{1 \leq n \leq X} \mu(n) \left[\frac{X}{n}\right] = 1.$$  A few ideas I have tried: Using that $[x]=x - \{x\}$ which I couldn't make out to bring anything. Switching around on the summation variables, like $$\sum_{d \leq N} \mu(d) f\left( \frac{n}{d} \right) = \sum_{d \leq N} \mu \left( \frac{d}{n} \right) f(d)$$ but that didn't seem to bring anything.  I tried writing out the first few terms, which give $$\mu(1) [X] - \left[\frac{X}{2}\right] - \left[\frac{X}{3}\right] - \left[\frac{X}{5}\right] + \left[\frac{X}{6}\right] - \left[\frac{X}{7}\right] - \left[\frac{X}{8}\right]$$ but I can't seem to find a system where it simply reduces to one!  What do you think?


I looked through my website access log files and I saw lots of requests for icon files (with counts):  49146 /apple-touch-icon-precomposed.png 45836 /apple-touch-icon.png 40287 /favicon.ico  6752 /apple-touch-icon-120x120-precomposed.png  6669 /apple-touch-icon-120x120.png   886 /apple-touch-icon-152x152-precomposed.png   876 /apple-touch-icon-152x152.png   318 /apple-touch-icon-76x76-precomposed.png   317 /apple-touch-icon-76x76.png    71 /apple-touch-icon-57x57-precomposed.png    70 /apple-touch-icon-57x57.png    46 /apple-touch-icon-114x114-precomposed.png    44 /apple-touch-icon-114x114.png    30 /apple-touch-icon-72x72-precomposed.png    30 /apple-touch-icon-72x72.png   How should I create icon files to satisfy all these requests?   What file formats, and image sizes should I create?   What meta tags should I include in my pages for site icons?  I'd like my site's icon to show up:   In the browser's URL bar When a user bookmarks my site When my site is added to the mobile home screen on iPhone or Android When my site is shared on Facebook and other social media sites

I know of 2 basic kinds of default web icons for websites:   : place an .ico formatted file at the root of your site named favicon.ico and most desktop browsers will find it and display it in various contexts (bookmarks, tabs). Can also be added in code, which allows you to specify other names and other graphics types to the file, though there are :  <link rel="shortcut icon" href="/favicon.ico" /> <link rel="icon" href="/favicon.ico" />  : place a png formatted file called either apple-touch-icon.png or apple-touch-icon-precomposed.png at the root of your site and iPhone OS/iOS versions of Safari will pick those up and store them when the site is added to the Home Screen. Can also be added with code like:  <link rel="apple-touch-icon" href="/custom_icon.png" />    Are there any other default icon graphics for a website a webmaster can include?


I have installed zekr Quran study software in ubuntu 13.04, but it showes error   org.eclipse.swt.SWTError: No more handles [Unknown Mozilla path (MOZILLA_FIVE_HOME not set)]       at org.eclipse.swt.SWT.error(SWT.java:4387)     at org.eclipse.swt.browser.Mozilla.initMozilla(Mozilla.java:1939)     at org.eclipse.swt.browser.Mozilla.create(Mozilla.java:699)     at org.eclipse.swt.browser.Browser.(Browser.java:99)     at net.sf.zekr.ui.QuranForm.makeFrame(QuranForm.java:628)     at net.sf.zekr.ui.QuranForm.init(QuranForm.java:340)     at net.sf.zekr.ui.QuranForm.(QuranForm.java:319)     at net.sf.zekr.ZekrMain.startZekr(ZekrMain.java:51)     at net.sf.zekr.ZekrMain.main(ZekrMain.java:94)   then I executed the following commands   tcsh   setenv MOZILLA_FIVE_HOME /usr/lib/firefox   setenv LD_LIBRARY_PATH ${MOZILLA_FIVE_HOME}:${LD_LIBRARY_PATH}`   But it showes error again    LD_LIBRARY_PATH: Undefined variable.  Now what should I do? Pls help.

I installed Zekr Qur'an study software on Ubuntu 12.04 and I upgraded to 12.10. Then the Zekr app started giving me this error whenever I start it.  org.eclipse.swt.SWTError: No more handles [Unknown Mozilla path (MOZILLA_FIVE_HOME not set)]     at org.eclipse.swt.SWT.error(SWT.java:4387)     at org.eclipse.swt.browser.Mozilla.initMozilla(Mozilla.java:1939)     at org.eclipse.swt.browser.Mozilla.create(Mozilla.java:699)     at org.eclipse.swt.browser.Browser.<init>(Browser.java:99)     at net.sf.zekr.ui.QuranForm.makeFrame(QuranForm.java:628)     at net.sf.zekr.ui.QuranForm.init(QuranForm.java:340)     at net.sf.zekr.ui.QuranForm.<init>(QuranForm.java:319)     at net.sf.zekr.ZekrMain.startZekr(ZekrMain.java:51)     at net.sf.zekr.ZekrMain.main(ZekrMain.java:94)   Please advise me.


here is the link of pictures and videos to my problems. To describe it in words, my camera nikon d3500 is going half way click to autofocus but on full click is not taking any picture. Sometimes it shows error that Error. Press shutter release again. Even if this error is not displayed but still my camera is unable to take pictures. I tried resetting the options but retouch menu is all greyed out, the reset menu in shooting menu is also greyed out. I also tried formatting the memory card and take the battery out for about 8 hours and re-insert it into the camera to reset the settings, but that did not work.

I know there are quite a few posts out there about the famous "Press Shutter Release Button Again" error. But mine seems to be quite weird. I own a Nikon D3200 with the standard 18-55 mm lens. It works great and takes amazing pictures but only if my aperture is fully open (f/3.5). Once I close it to, for example, f/4 it shows me the "Press Shutter Release Button Again" error. The weird part though is that it will take a picture, but the picture will either be way too dark or way too bright depending on the lighting.   I checked and the mirror is moving without any issue and the aperture "arm" is also moving freely. I think it might be the lens? I am not sure about this though since I am quite new to DSLR cameras.   I doubt that this is normal, don't know if anybody has some advice?


Using the code analysis tools (FxCop) I'm surprised how much information is visible inside the application exe file:   Class names Methods Argument count/types/passing mathods etc   I have tried to make the app a release, do not include any debug info, but still, lot of "coding" info is present.  Is there any option how to "strip" such meta info? Is this needed for reflection?

Obfuscation is one way, but it can't protect from breaking the piracy protection security of the application. How do I make sure that the application is not tampered with, and how do I make sure that the registration mechanism can't be reverse engineered?  Also it is possible to convert a C# application to native code, and  is too costly.  C# provides lot of features, and is the ideal language for my code, so writing the whole codebase again in C++ is out of the question.  Secure certificates can be easily removed from the signed assemblies in .NET.


Let $z_n$ be a sequence of nonzero complex numbers such that $z_{n+1}=z_n^2+z_n$ for all $n\in\mathbb{Z}$.  Can such a sequence satisfy $\lim_{n\to +\infty}z_n=\lim_{n\to -\infty}z_n=0$ ?    A friend from the university showed me this question saying it's a student competition problem from the 90's. None of us and our colleagues was able to solve it, nobody had even an idea how to start the solution.  =======================  It is NOT a duplicate. There is a big difference between real and complex numbers and sequences, especially when one wants to use the fact that being bounded and monotonic implies convergence, which was the main observation in the linked question!

Define the recursive sequence $(a_n)$ as $a_{n+1} = a_n^2 + a_n$ where $n \in \mathbb{N}$. We want to find $a_1 \in \mathbb{R}$ such that $(a_n)$ converges to a limit that depends on $a_1$.   Attempt: Let $a_1 = k$, then $a_2 = k^2 + k$, $a_3 = (k^2 + k)^2 + (k^2 + k)$, ... clearly if we have |k| > 1 then the sequence $(a_n)$ will diverge. From this we deduce the interval of convergence must be when $|k| \le 1$. Suppose $(a_n) \to L$ then $a_{n+1} = a_n^2 + a_n$ $\implies L = L^2 + L \implies L = 0$. Surely if $k = 0$ this will occur as $a_n = 0$ for all n. But it is not clear to me if there are other $k$ such that the recursive sequence converges.


I am a beginner and I am confused between these two examples. So sorry if I ask something that has already be answered. I don't know how to search for this issue.  Let's say I have class Person and class Student. Student extends Person. So when I do:   Student student = (Student)new Person();   I get ClassCastException. Which makes sense (Person is not instance of Student).  But when I do this:  Person p = new Student();         Student s = (Student)p;         System.out.println(s);   It compiles and runs just perfectly. How? When p is reference of type Person (and which I said Person is not type of Student). Then it must look at object that p is referring to. But how/why does it do that? Shouldn't it just look at reference type because that is what we are passing?  By the way can you send me any link of some reading about this, so I can learn more about it?  Thanks

Upcasting is allowed in Java, however downcasting gives a compile error.   The compile error can be removed by adding a cast but would anyway break at the runtime.   In this case why Java allows downcasting if it cannot be executed at the runtime? Is there any practical use for this concept?   public class demo {   public static void main(String a[]) {       B b = (B) new A(); // compiles with the cast,                           // but runtime exception - java.lang.ClassCastException   } }  class A {   public void draw() {     System.out.println("1");   }    public void draw1() {     System.out.println("2");   } }  class B extends A {   public void draw() {     System.out.println("3");   }   public void draw2() {     System.out.println("4");   } }


I need to access all possible number of combinations of characters in a string. Without Using Any loop, because i have to filter records in thousands. loop can give performance issue.  lets Take a Example :  Any Custom method ABCD ===>> ABCD, ABDC,ACBD,ACDB, ADCB, BACD, BADC, BCAD, BCDA, BDAC , BDCA , CADB,CBDA,CDBA, CBAD, DABC, DBCA, DCBA,DCAB......  thanks in Advance

I want to write a function that takes an array of letters as an argument and a number of those letters to select.   Say you provide an array of 8 letters and want to select 3 letters from that. Then you should get:  8! / ((8 - 3)! * 3!) = 56   Arrays (or words) in return consisting of 3 letters each.


How would you determine how much cherokee indian in your heritage is your great great grandmother was 1/2 cherokee indian?

My sister, cousins, and other relatives speculate that my mom's grandmother was Jewish (for various reasons). I've heard people say at times things like, for example, "I'm 50% German" or "I'm 25% Swedish." This has to do with their ancestry. But, how exactly is this calculated? Say for example that my mother's paternal grandmother was indeed 100% Jewish, what would that make me and my siblings, and how is it calculated?


How can a person trapped in a box figure out, without looking outside, whether the box is stationary or moving with a constant velocity?  Is it even possible, considering the fact that the box is an inertial frame of reference? (since acceleration, and thus net force, is zero)  Additional question: Assume that the box is moving with a constant velocity. When a ball is thrown at a wall, will the time taken by the ball to reach the wall be any different from the time taken when the box is stationary? (If I picture myself in a closed room, I don't see why this should be possible - yet I can't convince myself that this is the case. If the wall is moving away from the ball, it seems reasonable that the time taken should be more. Likewise, it feels reasonable to think that the ball should take less time to reach the wall that is moving towards it.)

This is not a contradiction and I know it is impossible but still consider a thought experiment by me and point out if something is wrong. See the following picture and then the explanation follows.    Rest frames are easy to understand. They are just for clarification. Lets move on to the moving frames. The velocity of the box is $0.1\ c$. Now a photon is emitted (I am not taking a light ray to avoid complication in discussion). After emission the box also moves a certain distance ahead. So the photon takes more than one second to reach the wall. But even the source moves that much distance ahead. When the light is reflected back, the source and the wall again move forward as the box is moving. But after reflection the wall has no role to play. We are concerned about the source. The source moves a certain distance ahead and therefore light takes less than one second to reach back. But the difference of the first case and the second case is not the same. To explain, I will give some equations.  Moving frame 1:  Velocity of the box: $0.1\ c = 30,000km/s$  Time taken by light to reach the wall $=\frac{330,000\ \text{km}}{300,000\ \text{kms}^{-1}}= 1.1s$  Distance moved ahead by the box from original position: $30,000\ \text{km}$  Moving frame 2:  distance moved ahead by the box from original position  $>30,000\ \text{km}$ as the box also moves ahead after reflection.  let $d$ be the distance moved ahead by the box after reflection.  Time taken by light to reach the source: $\frac{270,000\ \text{km}\ -\ d}{300,000\ \text{kms}^{-1}} <0.9s$  Therefore we see that this could possibly determine the absolute motion.  So in total we see that the light will take lesser time to reach the source. Please correct me if I am wrong and give your opinion why is it so.  EDIT 2 for clarification  The box is the compartment in space in which you are moving and I am calculating the time the light takes to reach back the source. I am not even adding velocities. Please correct me and tell me where did I add velocities. For clarification just let me give a simple example. Suppose person A is standing still and B is running towards a light source. Obviously he will see the light before person A even though the speed would be the same. So, what I am doing over here is not increasing the speed of light, but instead decreasing the distance to be covered by it.


My credit card company is giving me credit increases despite me not asking for them. Are there any drawbacks to an increased spending limit?   For reference I spend 25$ per month on this card, pay it off in full every month, and use it when traveling out of the country.

Today I received a letter from the bank that issued my credit card. Basically it says that, since I'm "one of their best customers" my credit (card) limit has been increased.  This is the second time that they have done this. The first time I didn't give it much thought. I'm a legal resident in the United States, so I knew that I would need to build a "credit history" for myself here and I though that it was a good sign that they would increase my credit limit after a couple years.   After this happened the second time, I wonder if there could be a "catch" on this. I mean, what is my bank's real motivation for allowing me to spend more money. Are the any pitfalls (besides the obvious "don't get into too much debt. Don't buy things that you cannot really afford") I should avoid?  Additional info:   I'm a legal resident in the US.  I have had this credit card for around 4 years now. I make a sensible use of my card. I never had an issue paying my balance.


I know how to set two divs stacked one before the other to make the second fill all the page's height if they are defined with percentages, but how if the first div's height is defined in "em"?  body{   height:100%;   background-color:yellow; } #Header{   height:3em;   border:solid 2px black;   background-color:red; }  #Content{   border:solid 2px black;   background-color:green;   height:To fill body.. ???? }   . (Updated)

I am working on a web application where I want the content to fill the height of the entire screen.  The page has a header, which contains a logo, and account information. This could be an arbitrary height. I want the content div to fill the rest of the page to the bottom.  I have a header div and a content div. At the moment I am using a table for the layout like so:  CSS and HTML    #page {     height: 100%; width: 100% }  #tdcontent {     height: 100%; }  #content {     overflow: auto; /* or overflow: hidden; */ }

...

...

     The entire height of the page is filled, and no scrolling is required.  For anything inside the content div, setting top: 0; will put it right underneath the header. Sometimes the content will be a real table, with its height set to 100%. Putting header inside content will not allow this to work.  Is there a way to achieve the same effect without using the table?  Update:  Elements inside the content div will have heights set to percentages as well. So something at 100% inside the div will fill it to the bottom. As will two elements at 50%.  Update 2:  For instance, if the header takes up 20% of the screen's height, a table specified at 50% inside #content would take up 40% of the screen space. So far, wrapping the entire thing in a table is the only thing that works.


I have an AppCompatSpinner and I'm trying to set a text on a TextView here.  Here's my code:  eSpinner.setOnItemSelectedListener(new AdapterView.OnItemSelectedListener() {             @Override             public void onItemSelected(AdapterView<?> adapterView, View view, int i, long l) {                  final TextView eSpinnerTV = (TextView) adapterView.getSelectedView();                  switch (i) {                     case 0:                         final Calendar c = Calendar.getInstance();                         mHourEnd = c.get(Calendar.HOUR_OF_DAY);                         mMinuteEnd = c.get(Calendar.MINUTE);                          TimePickerDialog timePickerDialog = new TimePickerDialog(activityName.this,                                 new TimePickerDialog.OnTimeSetListener() {                                      @Override                                     public void onTimeSet(TimePicker view, int hourOfDay,                                                           int minute) {                                          Calendar date = Calendar.getInstance();                                         date.set(Calendar.HOUR_OF_DAY, hourOfDay);                                         date.set(Calendar.MINUTE, minute);                                         date.set(Calendar.AM_PM, date.get(Calendar.AM_PM));                                          sEnd(hourOfDay, minute);                                          uTimeInSF = new SimpleDateFormat("HH:mm:ss").format(date.getTime());                                          eString = new SimpleDateFormat("hh:mm a").format(date.getTime());                                          // error on the line below                                         eSpinnerTV.setText(uTimeAMPM);                                      }                                 }, mHourEnd, mMinuteEnd, false);                         timePickerDialog.show();                 }             }              @Override             public void onNothingSelected(AdapterView<?> adapterView) {              }         });   Here's sEnd.java file's code:  public void sEnd(int hour, int min) {         if (hour == 0) {             hour += 12;             format = "AM";         } else if (hour == 12) {             format = "PM";         } else if (hour > 12) {             hour -= 12;             format = "PM";         } else {             format = "AM";         }          uTimeAMPM = hour + ":" + min + " " + format;      }   Here's the xml code:  <android.support.v7.widget.AppCompatSpinner        android:id="@+id/pTime"        android:layout_width="wrap_content"        android:layout_height="wrap_content"        android:layout_marginTop="8dp"        android:layout_marginBottom="8dp"        android:entries="@array/pTimeList"        style="@style/Base.Widget.AppCompat.Spinner"> </android.support.v7.widget.AppCompatSpinner>   Here's pTimeList:  <string-array name="pTimeList">     <item>Pick a time..</item> </string-array>   As soon as I'm clicking the OK button after choosing time from TimePickerDialog, the app is crashing giving this error: java.lang.NullPointerException: Attempt to invoke virtual method 'void android.widget.TextView.setText(java.lang.CharSequence)' on a null object reference on the line specified in the code above.  What is causing this error even when this textview has been clearly reference above in the code as final TextView eSpinnerTV = (TextView) adapterView.getSelectedView();?  Please let me know.

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


I need to type some code in Latex, but when I type [replace] (as a part of the code) it says:  "Missing number, treated as zero"  Here is my minimal working example:         \documentclass[]{report}        \begin{document}        \texttt{        [some text]\\        some other text\\        [replace]\\         blablabla\\         }        \end{document}   Any Help is appreciated :) Thanks a lot in advance!

Whenever I try to compile a table that has a "[" as first character in a row it gives me the error:  Missing number, treated as zero. Illegal unit of measure   Example:  \begin{table}[htb]     \centering     \begin{tabular}{r|r}         [some text ] & ... \\         [some more text ] & ...     \end{tabular}     \caption{...}     \label{tab:...} \end{table}   How can I print "[" as first character in a row?


Im new to Linux. I need a software with GUI to recover data from scratched or damaged DVD .I can't find any software for this purpose. In Windows there is CD/DVD data recovery tool.I thought that dvd disaster can do that but I found that   "this is not a CD/DVD data recover utility that you can use after the disc damage occurs, it’s rather an application that you should run while the optical disc is fully read-able!"  ()  I want to recover data from damaged dvd.

I have certain old CD/DVD's which are not in good condition. I want to recover from them anything that can be recovered. in windows you had software like Isobuster and Cd Recovery which will let me do this. Can anyone suggest a native linux app?


Sometimes, when booting, I get:   grub ubuntu purple background Grey backlit screen Black screen   And nothing else. It does seem that Ubuntu is correctly booted. To fix the issue, I can put the computer to sleep and back again, and then the screen will be OK. I am certain that ubuntu is booted because, during the black screen, I typed enter, then my password, then I poped a terminal. After that, I did the "fix" routine and confirmed that I had an open terminal in my session.  I am unsure where to look at as most questions related to this cannot boot at all. I did a  of the failed boot, I suspect this is clearer than my explanation.  Here are the 4 lines that flashes, from dmesg:   [   20.065643] ACPI Error: Needed type [Reference], found [Integer] 00000000214ff4c5 (20181213/exresop-69)   [   20.065656] ACPI Error: AE_AML_OPERAND_TYPE, While resolving operands for [Store] (20181213/dswexec-427)   [   20.065700] No Arguments are initialized for method [RPPC]   [   20.065704] ACPI Error: Method parse/execution failed  \_SB.PCI0.LPCB.EC0.RPPC, AE_AML_OPERAND_TYPE (20181213/psparse-531)   [   20.065716] ACPI Error: Method parse/execution failed  \_SB.PCI0.LPCB.EC0._Q04, AE_AML_OPERAND_TYPE (20181213/psparse-531)   Looking these up didn't yield anything helpful for me but I might have missed crucial information as I've got no idea what's happening. I've seen driver related answers, telling to install them from Ubuntu's "additional drivers" tool if they appear; there's nothing here for me.  Questions are therefore:   What other information can I provide to diagnostic what happens? How to fix this?   Edit 1: I tried both kernel options at boot: 5.0 and 4.18, didnt' help

I am trying to boot Ubuntu on my computer.  When I boot Ubuntu, it boots to a black screen.  How can I fix this? Table of Contents:


The idea stems from one of my players but can you tie magic rings (enchanted with magic missile) together and activate them all in one action? So for example they have ten magic rings all with the same spell, can he use all the rings as they are tied together (essentially creating a single object.)

Say a creature owns multiple items with wording similar to this:  As an Action, you may speak the command word to [...]  Say the creature has deliberately obtained such items, perhaps by creating them itself, to have the same command word. Can this creature use one action to speak the shared command word and activate multiple items at once? The purpose of this question is not to cheese my DM. I am writing a short story and like to keep my D&D fiction as close to rules-accurate as possible.


Find the center of the group  $\operatorname{GL}(n,\mathbb R)$ of invertible $n \times n$ matrices.  Please can someone please help me? I know that by definition the center $Z$ of a group $G$ is defined by $Z(G) = \{g \in G\ |\ ag = ga ,\, \forall a \in G\}$.  I know that the identity matrix commutes with any matrix. I also notice by computing several matrix products that if we have a matrix with a main diagonal and all other entries are zero, then the given matrix commutes. In addition, I know that the determinant cannot be zero since zero times another matrix will only be zero. Please I would really appreciate the help. Thank you.

The given question:  Let $k$ be a ﬁeld and $n \in \mathbb{N}$. Show that the centre of $\operatorname{GL}(n, k)$ is $\lbrace\lambda I\mid λ ∈ k^∗\rbrace$.  I have spent a while trying to prove this and have succeeded if $ k \subseteq \mathbb{R}$. So I imagine there is a nicer way to go about this. I have seen people saying take matrices where every element except one is zero in proving similar results but such matrices are not in $\operatorname{GL}(n,k)$ as they are not invertible.  What I have done.  I have said let $B \in$ Center then $B$ commutes with everything in $\operatorname{GL}(n,k)$. So take a permutation matrix, $P$ which swaps rows $i,j$ $P \neq I$. From this you can deduce that $B^T = B$ and that $B_{ii} = B_{jj}$. We can use the fact that $B$ is symmetric to find an orthogonal diagonalisation of $B$ by the spectral theorem.  This gives $QBQ^T = D \rightarrow B=D$. And as $B_{ii} = B_{jj}$ we can say $B = k * I$.   But the spectral theorem requires $B$ to be a real matrix.   How do I prove this for a general $k$?.


I want to create a custom lightning component or VF Page just like below Default 'ChangePassword' page in community.  I know that this is a standard page which we cannot modify in salesforce, that's why i wanted to create a lightning component/VF Page which should replicate the above page. Can you help me to find the code for this page? From where I can see the code for this page? or create a lightning component/VF Page for this. Regards, Pravindra

Following up this question , I am wondering if it is possible to make use of the Change Password lightning component:    It is not documented anywhere, and it is not used in standard pages.       The default Reset Password page uses some standard salesforce-like change password form.   The Visualforce page, well it's pretty basic VF page...  So here are my questions:   Where can I use the Change Password component? Is is possible to customize this component?


I was trying to set the print orientation into landscape through javascript. I'm only just using the window.print() function for the page's content to be printed. here's the code:      With this I was able to print a sample page. But only it was on portrait format. The client requires it to be in landscape. so I tried on many codes I found. here's the one am sure your most familiar with.     since it wasn't a button that am using to call the print function but an image type with href, I tried to change the previous one with:      See the id="printLandscape", I tried that on to be able to call the javascript function declared above and make the page print into my desired format which is landscape. But when I tried to print, to see if it was working. The printed page still has the default/formal or portrait type.  Is there something am missing? Or did I not declare the javascript properly especially the id on href for it not to work fine?  S.O.S

I have a HTML report, which needs to be printed landscape because of the many columns. It there a way to do this, without the user having to change the document settings?  And what are the options amongst browsers.


I am trying to code a modular equation solver, say given an equation, $x^2=180345$ and the modulo is 8, then we can solve it like this-->  $x^2 = 180345 \bmod 8 = 1 \bmod 8$ Now, x can have only the following set of values mod 8: {0, 1, 2, 3, 4, 5, 6, 7} You can verify that only x = 1, 3, 5, 7 satisfy x^2 = 1 mod 8 and the other values do not.  A code for this will be as simple as--> for i in range(1,8):   if( (i**2) % 8 == 1):     print(i)  But I am facing problem when it comes to large values. for example, say this is the case now $x^{2023}=60272843869801735644577066673$ and modulo is $19806040628566084345385967582$ With the same code that I mentioned it will take a lifetime to solve this equation, but when I use this  it is performing this operation within seconds. Can someone tell me what is the algorithm that they are using?

I have the following equation: $$ n \equiv M^k\mod(b) $$ where n, a, b are integers, and M is unknown. How do I solve this equation to find the M value? Those a and b are public keys of the RSA algorithm and n is the result of encryption. I need to find the encrypted message.


Is there a collection in C# working like dictionary with multiple keys allowing bidirectional access? For example:  Collection<int, string> a = new Collection<int, string>(); a.Add(1, "a"); a.Add(1, "b"); a.Add(2, "a"); a.Get(1);//returns ["a", "b"] a.InverseGet("a"); //returns [1, 2]

I am looking for a generic, bidirectional 1 to 1 Dictionary class in C# (2), ie. a BiDictionaryOneToOne<T, S> which is guaranteed to only contain one of each value and key (up to RefEquals anyway), and which can be searched using either key or value. Anyone know of one, or should I just implement it myself? I can't believe that I'm the first person to need this...  There is a BiDictionary in the answers to , but it is not for unique elements (and also does not implement RemoveByFirst(T t) or RemoveBySecond(S s)).   Thanks!


Can somebody help me? I know it's an old game, but I have opened the black books after collecting them all, in order to change my skills. Now I'm back in Skyrim and I keep taking damage, as if I'm in the dark area in the book. I can't revert to another save as it's all autosaves of when the glitch happened.   I don't want to lose my character so any help is appreciated!

I am playing Dragonborn DLC. I am currently going through one of the black books quests and even though I am not fighting my health bar keeps going down. I can heal back up to full again but it keeps disappearing. If I do not heal I will die in about 30 seconds.  I have no disease or nothing is visible anyway, no clue as to what's wrong. I can leave the black book quest or fast travel to a different location or rest for 24 hours but still the health disappears.


My apologies if this has been asked before. Meta's suggestions and a Google search are not returning any promising results.  Why are audits not scored? Perhaps a +3 for a successful audit and a -5 for a failed audit would be a useful tool to keep people engaged in auditing while keeping them on their toes.  I'm not suggesting to replace the current system. This is more an augmentation to encourage folks to work on various queues with a more immediate reward (when an audit is encountered).

Just wanted to see what the community thought of adding a reward to passing the review tests? Maybe a 1 point reward?  I know seeing the tests in the review area has helped me be extra careful when reviewing, but I thought perhaps a little boost in incentive would be cool.


Let $H$ be a Hilbert space and $\{\phi_k\}$ an orthonormal basis of $H$. Prove that the linear operator $T:H \to H$ defined by $T(\phi_k) = \frac{1}{k+1}\phi_{k+1}$ is compact.   Proof: Consider the sequence of linear operators defined by $$ T_n(f) = \sum_{k=1}^{n}\frac{1}{k+1}\langle f,\phi_{k}\rangle\phi_{k+1}.$$ They have finite rank, so they are obviously all compact.  Since $T$ is linear and $\phi_k$ is an orthonormal basis, $$ T(f)=T(\sum_{k=1}^{\infty}\langle f, \phi_k \rangle\phi_k) =\sum_{k=1}^{\infty}\langle f, \phi_k \rangle T(\phi_k) = \sum_{k=1}^{\infty}\frac{1}{k+1}\langle f, \phi_k\rangle \phi_{k+1}.$$  Then $$ \|(T-T_n)(f)\|^2 = \|\sum_{k=n+1}^{\infty}\frac{1}{k+1}\langle f,\phi_k \rangle \phi_{k+1}\|^2 = \sum_{k=n+1}^{\infty}\frac{|\langle f,\phi_k\rangle |^2}{(k+1)^2}\leq\frac{1}{(n+2)^2}\sum_{k=n+1}^{\infty}|\langle f,\phi_{k}\rangle|^2 \leq \frac{1}{(n+2)^2}\sum_{k=1}^{\infty}|\langle f,\phi_{k}\rangle|^2 = \frac{1}{(n+2)^2}\|f\|^2.$$  So $$ \|T-T_n\|=\sup_{\|f\|=1}\|(T-T_n)(f)\| \leq \frac{1}{(n+2)^2},$$ which tends to zero as $n \to \infty$.  My question is: Why does this prove what was asked? This proves that there is a sequence of compact operators that converges to $T$. How can we infer that $T$ is compact from that? Is there such a theorem?

When I read the item of compact operator on Wikipedia, it said that      Let $T_{n}, ~~n\in \mathbb{N}$, be a sequence of compact operators from   one Banach space to the other, and suppose that $T_n$ converges to $T$   with respect to the operator norm. Then $T$ is also compact.   Can anyone give me a brief proof of this? Thanks in advance.


On my ubuntu machine where I rin the following command:  printenv | grep HOSTNAME   Shows no output whilst when I do the following on terminal:  echo ${HOSTNAME}   Output is shown. SO I wanted to know why in printenv does not shows the HOSTNAME environmental variable?

On my Linux box (Gentoo Linux 2.6.31 to be specific) I have noticed that the HOSTNAME environment variable is available in my shell, but not in scripts. For example,  $ echo $HOSTNAME   returns  xxxxxxxx.com,   but  $ ruby -e 'puts ENV["HOSTNAME"]'   returns  nil   On the other hand, the USER environment variable, for instance, is available both in the shell and in scripts.   I have noticed that USER appears in the list of environment variables that appears when I type  export   i.e.,  declare -x USER="infogrind"   but HOSTNAME doesn't. I suspect the issue has something to do with that.   My questions: 1) how can I make HOSTNAME available in scripts, and 2) for my better understanding, where is this variable initially set, and why is it not "exported"?


They say that if $A = X \times Y$, with $X$ statistically independent of $Y$, then  $$\frac{\Delta{A}}{A}=\sqrt{ \left(\frac{\Delta{X}}{X}\right)^2 + \left(\frac{\Delta{Y}}{Y}\right)^2 }$$  I can't understand why that is so geometrically.  If $X$ and $Y$ are interpreted as lengths and $A$ as area, it is pretty easy to understand, geometrically, that  $$\Delta{A} = X\times\Delta{Y} + Y\times\Delta{X} + \Delta{X}\times\Delta{Y}$$  Ignoring the term $\Delta{X}\times\Delta{Y}$ and dividing the both sides by $A$ ($= X \times Y$), that expression becomes  $$\frac{\Delta{A}}{A} = \frac{\Delta{X}}{X} + \frac{\Delta{Y}}{Y}$$  which is different from  $$\frac{\Delta{A}}{A}=\sqrt{ \left(\frac{\Delta{X}}{X}\right)^2 + \left(\frac{\Delta{Y}}{Y}\right)^2 }$$  which looks like a distance calculation. I just can't see how a distance is related to $\Delta{A}$.  Interpreting $A$ as the area of a rectangle in a $XY$ plane, I do see that $\Delta{X}^2+\Delta{Y}^2$ is the how much the distance between two opposite corners of that rectangle varies with changes $\Delta{X}$ in $X$ and $\Delta{Y}$ in $Y$. But $\Delta{A}$ is how much the area, not that distance, would vary.

1) Up until now, during practical work sessions, I always used these formulas for uncertainty propagation:  if $C = A+B$  or  $C = A-B$ $$\Delta C = \Delta A + \Delta B$$ if $C = AB$ or $C = \frac{A}{B}$ $$\frac{\Delta C}{C} = \frac{\Delta A}{A}  + \frac{\Delta B}{B}$$ if $C = A^m$ $$\frac{\Delta C}{C} = |m|\frac{\Delta A}{A}$$   These formulas are derived from the expression for the differential of a function of multiple variables:  if $C = f(A,B)$ $$ dC = \frac{\partial C}{\partial A}dA + \frac{\partial C}{\partial B}dB \Rightarrow \Delta C = \frac{\partial C}{\partial A}\Delta A + \frac{\partial C}{\partial B}\Delta B$$  and I think that makes sense because the value C is just a function of two variables that happen to be measurements.  2) But this morning, I was told that this is wrong and I should actually use these instead:  if $C = A+B$  or  $C = A-B$ $$(\Delta C)^2 = (\Delta A)^2 + (\Delta B)^2$$ if $C = AB$ or $C = \frac{A}{B}$ $$\left(\frac{\Delta C}{C}\right)^2 = \left(\frac{\Delta A}{A}\right)^2  + \left(\frac{\Delta B}{B}\right)^2$$  which are apparently derived from a general formula:  $$(\Delta C)^2  = \left(\frac{\partial C}{\partial x_1}\Delta x_1\right)^2 + \left(\frac{\partial C}{\partial x_2}\Delta x_2\right)^2 +   \hspace{0.3cm}...$$  or   $$\Delta C  = \sqrt{\left(\frac{\partial C}{\partial x_1}\Delta x_1\right)^2 + \left(\frac{\partial C}{\partial x_2}\Delta x_2\right)^2 +   \hspace{0.3cm}...}$$  3) So:   Why is this formula better?  Where does it come from? What does it actually represent? (Do I recognize the shape of a norm in that last formula?)  What is wrong with the formula of the differential?   I'm asking a lot, but the propagation of uncertainty always confused the ship out of me.


Im having trouble installing the os in my computer. I get to the screen menu where it gives you the options to install or to test before installing. Whenever i Press install my screen goes black for a few seconds and then turns off completely. Nothing happens after that.  Is there a way to troubleshoot this and find out if this is my pc or the usb? Im really new to all tech stuff too.

I am trying to boot Ubuntu on my computer.  When I boot Ubuntu, it boots to a black screen.  How can I fix this? Table of Contents:


I got the following email: Sandbox: Developer script exception from     ContactTrigger: System.LimitException: Too many futurecalls: 51   Important addition: I do not see that mentioned 50 calls were executed in my HTTP call's handler logs.  Indeed I do some future calls upon contact inserting/updating in the loop, but I don't see so many contacts created in bulk in our Salesforce instance. Actually at the time I received this letter no contacts were created at all.  Here is some code:      trigger ContactTrigger on Contact (after delete, after insert, after undelete, after update, before delete, before insert, before update) {      ...      if(tc.isAfter){         // call handler instance to meet new registration requirements         new ContactHelper().execute(tc);     } }   and the helper  public class ContactHelper extends GenericTrigger {      public override void execute(TriggerContext tc)     {         if (Test.isRunningTest()) {             return;         }         List<Contact> affectedContacts = tc.newList;         if (tc.isInsert) {             for (Contact contact: affectedContacts)             {                 if (!contact.Greylist__c) {                     updatePartnerPortal(contact.id, 'contact_inserted');                 }             }         }          if(tc.isUpdate) {             for (Contact contact: affectedContacts)             {                 if (contact.PersonID__c == null && !contact.Greylist__c) {                     updatePartnerPortal(contact.id, 'contact_updated');                 }             }         }     }      @future (callout=true)     public static void updatePartnerPortal(string contactId, string operationType)     {         // HTTP call     } }

Working on a future method to post values to external web service. But since there is a limit of 50 callouts per invocation, I am getting error "Too many future calls : 51". Cases are loaded into salesforce from external ETL in bulk. So is there a way to workaround this error.   Class  public with sharing class caseTrigger {      //method invoked by trigger after insert     public void CaseInsert(List<Case> caseIns){           list<Id> caseIds = new list<id>();             List<Case> caseList = [Select id from case WHERE Id IN :caseIds];                 for(Case c : caseList){                     if(c.Status != 'closed'){                         caseIds.add(c.id);                     }                          if(f.caseId_User.size()>0){PostCases(caseIds);}      }     //postCases (future method)     @future(callout = true)     public static void PostCases(List<Id> Ids){         //prepare Json to post to webservice    } }


Let $(X,d)$ be a metric space and $U$ a subset of $X$. It is an elementary fact that $U$ is closed in $X$ if and only if it contains all its limit points. The forward direction is proven by showing that if there's a limit point in $X \backslash U$ then $X \backslash U$ is not open, so $U$ is not closed.   The backward direction is what my question is about. We show that if $U$ is not closed then it doesn't contain all its limits points. If $U$ is not closed then $X\backslash U$ is not open. So there is an $x\in X \backslash U$ such that for any $n\in \mathbb{N}$ the ball $B\left(x,\frac{1}{n}\right)$ intersects $U$. Therefore for each $n$ we can choose an $x_n$ in this (infinite) intersection and then the sequence $(x_n) \subset U$ converges to $x$, so we have a limit point $x\notin U$. Now my knowledge of exactly when the Axiom of Choice is necessary in mathematical arguments is limited but to me it seems like we are using it here to construct the sequence. Is it necessary here or is there some way to circumvent this? It would be strange if the Axiom of Choice was necessary for such a basic, standard property of metric spaces.

Often, we use a construction like this: Given a subset $ A $ of a metric space and its limit point $ a $, we know that for every $ \epsilon > 0 $ there is another point $ x $  different from $ a $ such that $ d(x,a) < \epsilon $. So for every natural $ n $ we let $ a_n $ be such a point within $ 1/n $ of $ a $, which gives us a sequence convergent to $ a $.  My question is, is the axiom of countable choice needed for this construction, or is it formally correct just in ZF?


I learned and always think that linux free memory is the "free" of "-/+ buffers/cache" You can get this knowledge from lots of website.    [root@dev001 ~]# free              total       used       free     shared    buffers     cached Mem:      32877844   31422864    1454980          0    1358500     774612 -/+ buffers/cache:   29289752    3588092 Swap:      1048568      67984     980584 [root@dev001 ~]# mkdir /mnt/ramdisk [root@dev001 ~]# mount -t tmpfs -o size=10g tmpfs /mnt/ramdisk [root@dev001 ~]# cd /mnt/ramdisk/ [root@dev001 ramdisk]# dd if=/dev/zero of=1g bs=1024 count=$((1024*1024*10)) 10485760+0 records in 10485760+0 records out 10737418240 bytes (11 GB) copied, 20.0645 s, 535 MB/s [root@dev001 ramdisk]# ls -lh total 10G -rw-r--r-- 1 root root 10G Jul 26 21:09 1g [root@dev001 ramdisk]# free               total       used       free     shared    buffers     cached Mem:      32877844   32630940     246904          0     792364   10901876 -/+ buffers/cache:   20936700   11941144 Swap:      1048568      67984     980584 [root@dev001 ~]# umount /mnt/ramdisk [root@dev001 ~]# free               total       used       free     shared    buffers     cached Mem:      32877844   22128348   10749496          0     792416     416160 -/+ buffers/cache:   20919772   11958072 Swap:      1048568      67984     980584 [root@dev001 ~]# free              total       used       free     shared    buffers     cached Mem:      32877844   22127372   10750472          0     792432     416160 -/+ buffers/cache:   20918780   11959064 Swap:      1048568      67984     980584   While, these days, I found my server is out of memory, but when we do these things , the memory comes back. Any one can answer why is it?   The free memory is 3,588,092(let's say 3.4G)  and total memory is 32G, am I right? During this step, we haven't found any process that eat lots of memory via the command 'top', So we thought 3.4G free is not correct, we 100% sure free memory is at least 20G We mount our memory as a ramdisk to local, and wrote data into it, as you can see, it is 10G, and it is successful After unmount, the free memory rise to 11,959,064   how could it be?   Seems the free memory is not just the "free" of "-/+ buffers/cache"  Thanks

This is a  about how Unix operating systems report memory usage.   Similar Questions:                    I have production server that is running Debian 6.0.6 Squeeze  #uname -a  Linux debsrv 2.6.32-5-xen-amd64 #1 SMP Sun Sep 23 13:49:30 UTC 2012 x86_64 GNU/Linux   Every day cron executes backup script as root:  #crontab -e  0 5 * * * /root/sites_backup.sh > /dev/null 2>&1   #nano /root/sites_backup.sh  #!/bin/bash str=`date +%Y-%m-%d-%H-%M-%S` tar pzcf /home/backups/sites/mysite-$str.tar.gz /var/sites/mysite/public_html/www mysqldump -u mysite -pmypass mysite | gzip -9 > /home/backups/sites/mysite-$str.sql.gz cd /home/backups/sites/ sha512sum mysite-$str* > /home/backups/sites/mysite-$str.tar.gz.DIGESTS cd ~   Everything works perfectly, but I notice that Munin's memory graph shows increase of cache and buffers after backup.  Then I just download backup files and delete them. After deletion Munin's memory graph returns cache and buffers to the state that was before backup.  Here's Munin graph:  Externally hosted image was a dead link.


I am trying to make a game for myself and my friends to play, and I have a prototype working in my test world that works perfectly, however, the game relies on the fact that we will be playing on a random seed, and because of that I am converting all of the command blocks into one long command that can be run to set up the game on a new world very quickly. In doing this I have found one command that does not seem to work, I have tested it all I can but cannot find what syntax I have wrong.  The command ("/kill @e[type=item,nbt={Item:{id:"minecraft:compass"}}]") works perfectly when I type it into another command block or chat.  Here is the command:  /setblock ~6 ~-1 ~1 repeating_command_block[conditional=false,facing=up]{Command:"/kill @e[type=item,nbt={Item:{id:"minecraft:compass"}}]",auto:1b} replace   According to the game, there should be another "}" right after the "{id", I have no idea why this is happening.

I need help with a specific command that I am using in a new game that I am creating inside of Minecraft. The command is:  /give @p sign 1 0 {BlockEntityTag:{Text1:"{"text":" [MF2]","color":"gold","clickEvent": {"action":"run_command","value":"tellraw @a [""{"text":"[MF2]  ","color":"gold"},{"selector":"@p","color":"dark_aqua"},{"text":" is now an admin of the server!","color":"white"}]"}}",Text3:"{"text":"Click to join Admin","color":"dark_aqua","clickEvent": {"action":"run_command","value":"scoreboard teams join admin @p"}}"},display: {Name:"Custom Sign"}}   If I take out the /tellraw command then the command works fine, but I need the command in there to announce to the game that a new admin has joined.  With the tellraw command, the error message is the following:  Data tag parsing failed: Unexpected token 't' at: text":" [MF2]","color":"gold","clickEvent":{"action":"run_command","value":"tellraw @a [""{"text":"[MF2] ","color":"gold"}, {"selector":"@p","color":"dark_aqua"},{"text":" is now an admin  of the server!","color":"white"}]"}}",Text3:"{"text":"Click to join Admin","color":"dark_aqua","clickEvent": {"action":"run_command","value":"scoreboard teams join admin @p"}}"   If anyone knows how to fix this, please let me know.


Has anyone confirmed the spawn rate for golden bees? I found several threads at various forums, but they all boil down to "just buy one".  I know I can buy them, and did in my file. However, my 6 year old son wants to catch one. He just caught his first shiny Pokemon, so he knows what patience means. I'd just like to be able to give him a number if possible.    Regarding duplicate status:  I don't believe this is a duplicate at all. I asked a specific question not covered by either the question or answer in the linked one. "It appears randomly" is not a spawn rate, and I thought that was clear from my original question.

The Bee Guy says he'll give me an even bigger reward for a Golden Bee. Is there a specific place these bees appear or a certain thing I need to do? Is the reward more rupees or an item?


If we were to travel almost at $299\,792\,458~m/s$, or the speed of light, what would happen to the human body? Would the human body stay the same or would there be consequences that would harm the person? Would our body shut down? I've been looking for an answer but could not find one.

If a person was sitting on a craft that has accelerated to near light speed speed from Earth (e.g. 99.999% of light speed) would there be any impact on his or her human biology due to relativistic effects on mass, time and distance?    For example, would the heart still be able to pump blood effectively if the relativistic mass of the blood has increased?    Or would accelerating the blood a bit further towards light speed requires more energy than when stationary on earth?


I have dual os (not sure if it should be called dual since it's not on the same hdd) Everytime after I switched from ubuntu back to windows 7, the time always changes. Suppose the time is 8pm now but the time would be approx 4am that each time I have to udpate the time in order for it to get to the right time.  Can someone please give me a hand?

Dual boot system Windows XP Pro and Ubuntu 12.04.  I have the bios set for the correct time and Ubuntu set for US Eastern time.  Ubuntu will boot up and the time will be off by -4 hours.  If I correct the time in Ubuntu then when I boot up in Windows XP the time will be off by + 4 hours.  This is a fresh install of 12.04. I did not have this problem before reinstalling Ubuntu.


I am trying to add classes to my webform. In   hook_webform_element  I can do this   if ($element['#type'] == 'checkboxes') {   $wrapper_classes = array(     'form-item',     'webform-component',     'large-16 medium-8 small-24 columns',     'webform-component-' . $type,   ); } else {      $wrapper_classes = array(     'form-item',     'webform-component',     'large-8 medium-8 small-24 columns',     'webform-component-' . $type,   ); }   But I do not seem to have access to the submit button. I need to add a couple of classes and also only do it on a certain form so suppose I need the $form_id.

By default, the web form is displayed with <?php print drupal_render($form['submitted']); ?> .  I need to make a small edit and add class="btn" to the submit button.  I can change its value with $form['actions']['submit']['#value'] = "click to become a member";  But I couldnt find a way to add the class.  Please help!  Thank you


I'm trying to recreate a memory dumper in C. I would like to iterate over memory using pointers and load the value when accessible.  #include<stdlib.h> #include<stdio.h>  int main() {     unsigned long ptr = sizeof(long);     printf("%s\n", (char*)ptr); // gives memory violation error     return 0; }   When I hit printf("%s\n", (char*)ptr) it raises a memory violation exception.  Is there any way either to handle this exception or to know if a pointer is accessible? Thanks.

Is there any way to determine (programatically, of course) if a given pointer is "valid"? Checking for NULL is easy, but what about things like 0x00001234? When trying to dereference this kind of pointer an exception/crash occurs.  A cross-platform method is preferred, but platform-specific (for Windows and Linux) is also ok.  Update for clarification: The problem is not with stale/freed/uninitialized pointers; instead, I'm implementing an API that takes pointers from the caller (like a pointer to a string, a file handle, etc.). The caller can send (in purpose or by mistake) an invalid value as the pointer. How do I prevent a crash?


Apparently after the split, all the tag-links (once they are fixed) will point to MSE instead of SO.  It seems like many questions will want to reference tags on a particular site.  We already had the special magic tag link of [meta-tag:], so how about a syntax to direct tag-links to the site of choice, or at least a subset of the sites that we can make easy abbreviations to?

The tag  and meta-tag  syntax generate much nicer looking results than merely surrounding your tag with [square brackets].    However, they only work when you're talking about the site you're on.  On Area51, in Chat, and on Meta sites, this is frequently not the case, leading to attempts at syntax like [[tag:failure]](https://superuser.com/questions/tagged/failure), which produces:    Hmm, must be some subtle syntax thing:   : [tag:failure](https://superuser.com/questions/tagged/failure) []: [[tag:failure](https://superuser.com/questions/tagged/failure)] : [tag:[failure]((https://superuser.com/questions/tagged/failure))] : [tag:failure] : [tag:failure][1] \n\n [1]: https://superuser.com/questions/tagged/failure : [more text is a [tag:failure] too](https://superuser.com/questions/tagged/failure)   I give up!  How can I create a link to a tag on another site with tag markdown?


I cannot change directory like this    I have a problem like this:

I want to enter the following folder in the terminal:  Milano, Torino (Jan)-Compressed   How should I write the command cd to enter this directory?  Spaces and several other special characters like \, *, ), ( and ? cause problems when I try to use them in the command line or scripts, e.g.:    $ cd space dir bash: cd: space: No such file or directory  $ cat space file cat: space: No such file or directory cat: file: No such file or directory  $ cat ( bash: syntax error near unexpected token `newline'  $ echo content >\ > ^C  $ ls ? (  )  *  ?  \   How do I enter file or directory names that contain special characters in the terminal in general?


Update on dining room wiring! With pics! Here’s hoping some one can help me out! A - switch with source line and line to light (B) B - light with wire connecting to second light (C) C - 2nd light (was ceiling fan without light) with clipped off wire and wire to switch (D) D - single pole switch for 2nd light -C  Situation: Switch A turns on light B and turns off light C (if it was on, if it was off it did nothing) Switch D, if switch A was off, would turn on/off 2nd light C - if switch A was on switch D did nothing  I hope that makes sense and now enjoy my pic skills   I have a situation in my dining room. It’s long so one side is the dining room light and the other end has a ceiling fan. Both have their own single switches. If the ceiling fan is turned on and running, and I turn on the dining room light the ceiling fan turns off. And vice versa. The incoming power goes thru the dining switch up to the dining room light over to the ceiling fan and then down to the fan switch. Any clue how I would fix that?

I have an issue where the far left 12/2 coming from the circuit has been used to power a dimmer switch to a light  Carry power from light to another light  The second light is controlled by another switch at the end of the run. Issue - if 1st switch is off, the 2nd light will work from its switch. If 1st switch is on, the 2nd light wont work at all from its switch Based on the diagram is there anyway to fix this issue without current wiring setup?


This question is from .     A combination on $n$ objects can be represented by an   $n$ bit binary vector, $(X_n, X_{n-1}, \dots, X_2, X_1)$,  where each bit,   $X_k \in \{1, 0\}$, expresses whether the corresponding object is   included in the combination or not. A set of combinations   can be represented by a set of the $n$ bit binary vectors.   We call such sets combination sets. Combination sets can   be regarded as subsets of the power set on $n$ object.      We can represent a combination set with a Boolean function by using n   input variables for each bit of the vector. The output value of the   function expresses whether each combination specified by the input   variables are included in the set or not. Such Boolean functions are   called characteristic functions. The operations of sets, such as   union, intersection, and difference, can be executed by logic   operations on characteristic functions.   Can anyone please make me understand this characteristic functions with an example?

A combination on $n$ objects can be represented by an   $n$ bit binary vector, $(X_n, X_{n-1}, \dots, X_2, X_1)$,  where each bit,   $X_k \in \{1, 0\}$, expresses whether the corresponding object is   included in the combination or not. A set of combinations   can be represented by a set of the $n$ bit binary vectors.   We call such sets combination sets. Combination sets can   be regarded as subsets of the power set on $n$ object.      We can represent a combination set with a Boolean function by using n   input variables for each bit of the vector. The output value of the   function expresses whether each combination specified by the input   variables are included in the set or not. Such Boolean functions are   called characteristic functions. The operations of sets, such as   union, intersection, and difference, can be executed by logic   operations on characteristic functions.    Can anyone please make me understand this combination sets with an example?   Can anyone please make me understand this characteristic functions with an example?


If I buy a physical copy of a Nintendo Switch game, will I only be able to play it in the language/locale of that physical copy? Or does owning that copy grant me the ability to play it in ALL language / region settings? I heard that the Switch is region-free, but I also know there can always be fine-print.

Many Nintendo devices often come with , which means if you purchase a device in one country, you won't be able to play games from another (generally).  Is the Nintendo Switch also region locked like many of its predecessors such as the Wii U and Wii?


I installed Nodejs via package   curl -sL https://deb.nodesource.com/setup_4.x | sudo -E bash - sudo apt-get install -y nodejs   Then I check version of nodejs and npm   nodejs -v v0.10.25 npm -v 1.3.10   Current version of nodejs are v4.4.2 LTS and v5.10.1 stable. What's wrong?

I noticed over at the  website that node is currently at v 0.12.0.  Can someone let me know how to install the latest version of node together with npm (terminal commands please)?


QUESTION: N people arrive at a party all of whom are wearing hats. We collect all the hats and then redistribute them. What is the probability that no one gets their own hat? ANSWER REASONING: $$|\bigcup_{i=1}^N S_i|=\sum_{i=1}^N(-1)^{i+1}\binom{N}{i}(N-i)!=N!\sum_{i=1}^N\frac{(-1)^{i+1}}{i!}$$ What I don't get is the probability of exactly n men getting their own hats back. So the reasoning given in the book is:P($A_{1} \bigcap A_{2} \bigcap A_{3}\bigcap......A_{n}$) =  $N\choose n $ $(\frac{(N-n)!}{N!})$, where each $A_{i}$ is the probability of the i_th person choosing their own hat. I am not sure why this makes sense because $(N-n)!$ gives us the number of ways in which (N-n) can choose their hats but does not exclude the possibility where (N-n)do not choose their own hats, which is what we want since we want only n people to be  able to choose their hats, not the rest?

the setup: $N$ people arrive at a party all of whom are wearing hats. We collect all the hats and then redistribute them. What is the probability that exactly $k$ of the party members receive their own hats back? let $E_i$ denote the probability that the $i^{th}$ man receives his own hat back. Then, $\space\space E_{i_1}E_{i_2}\dots E_{i_n} \space\space$ is the event that men labelled $i_1 , i_2 , \dots i_n$ get their own hats back. which implies... $P(E_{i_1}E_{i_2}\dots E_{i_n}) = \frac{(N-n)!}{N!}$ and $\color{red}{\sum\limits_{i_1<i_2<\cdots <i_n}}P(E_{i_1}E_{i_2}\cdots E_{i_n}) = \binom{N}{n}\frac{(N-n)!}{N!} = \frac{1}{n!}$ question1: are the above two formulas correct? The probability that at least $k$ of the party members receive their own hats back (using the inclusion-exclusion principle) is  $$\sum_{i_1 < i_2<\dots<i_k}P(E_{i_1}E_{i_2}\dots E_{i_k}) - \sum_{i_1 < i_2<\dots<i_{k+1}}P(E_{i_1}E_{i_2}\dots E_{i_{k+1}}) + \dots + (-1)^{n-k}\sum_{i_1 < i_2<\dots<i_n}P(E_{i_1}E_{i_2}\dots E_{i_n}) + \dots + (-1)^{N-k}\sum_{i_1 < i_2<\dots<i_N}P(E_{1}E_{2}\dots E_{N})$$ question2: is the above formula correct? Assuming that the above formulas are correct, the probability that at least $k$ of the party members receive their own hats back, comes out to be $$\sum_{i=k}^N \frac{(-1)^{i-k}}{i!} = \frac{1}{k!} - \frac{1}{(k+1)!} + \frac{1}{(k+2)!} - \dots +(-1)^{N-k} \cdot \frac{1}{N!}$$ question 3: is this correct? $ \text{ the probability that exactly k of the party members receive their own hats back is} $ $$||$$ $$\text{(the probability that at least k of the party members receive their own hats back)}$$ $$-$$ $$\text{(the probability that at least k+1 of the party members receive their own hats back)}$$ question4: is the above formula correct? Assuming everything until now is correct, the probability that exactly $k$ of the party members receive their own hats back, comes out to be $$= \bigg[\frac{1}{k!} - \frac{1}{(k+1)!} + \frac{1}{(k+2)!} - \dots +(-1)^{N-k} \cdot \frac{1}{N!} \bigg] - \bigg[ \frac{1}{(k+1)!} - \frac{1}{(k+2)!} + \dots +(-1)^{N-(k+1)} \cdot \frac{1}{N!} \bigg]$$ $$= \frac{1}{k!} - \frac{2}{(k+1)!} + \frac{2}{(k+2)!} - \dots +(-1)^{N-k} \cdot \frac{2}{N!}$$ but the given answer is $$\frac{1}{k!} \cdot \sum_{i=0}^{N-k}\frac{(-1)^i}{i!}$$ so something is definitely wrong What I want to ask: could you please answer questions 1, 2, 3 and 4? edit: I know that a simple way to answer the question is to use the concept of derangements, which gives the answer as $$\frac{\binom{N}{k} D_{N - k}}{N!}$$, where $D_n = n! \cdot \sum_{i=0}^{n}\frac{(-1)^i}{i!}$ edit1:


I need a simple image editor tool to draw a simple box/rectangle in an existing image, and probably write a simple text in it.  A similar but not the same question has been asked here before:   The problem is that none of the solutions given can draw a simple box in an existing image. Pinta looks good, but this tool always crashes and doesn't help at all.  Others such as Shotwell, GThumb, Shutter don't even have a tool to draw a simple rectangle at all.  I'm looking for a very simple tool that can draw a box on existing image like this.    Please do not suggest GIMP, as I'm looking for a very simple tool, probably like Pinta, but not buggy and must be stable.

In Chipaca's answer to  there's a screenshot with certain highlights. The highlights are the following:   A row of a GUI list is highlighted by the other parts of the screenshot being darker. A check mark is highlighted by being circled by what looks like a (orange) crayon.   How do I create both of these highlights on a screenshot? Is there an automated process?  The screenshot I'm referring to looks like this:


I have a div whose width I'd like to be dynamic based off of text that is inside the div. I've found that this is possible by setting the div's display to inline-block; however, now I can't get the div to center with the display. I don't want to use text-align: center on the div or the html body as I do not want the text inside the div to be centered. I'm open to having this problem fixed with or without inline-block. As long as the div is centered and the div width is dynamic based off of the text, then I'm happy.

Text that will change div width.

  #wrapper {     display: inline-block; }

I have a layout similar to:  <div>     <table>     </table> </div>   I would like for the div to only expand to as wide as my table becomes.


I often end up with duplicate files with same content, but with same or different names while doing the literature study. How to find and delete the duplicate files from terminal? How to just move them to bin and recover later if necessary and how to delete them permanently?

I have a largish music collection and there are some duplicates in there. Is there any way to find duplicate files. At a minimum by doing a hash and seeing if two files have the same hash.  Bonus points for also finding files with the same name apart from the extension - I think I have some songs with both mp3 and ogg format versions.  I'm happy using the command line if that is the easiest way.


Solving a quadratic congruence $x^2-2x+4 \equiv 0 \pmod 9$ where $x\in \mathbb{Z}_9$.   My idea:  $x^2-2x+4\equiv (x-1)^2+3 \equiv 0 \pmod{9} \iff (x-1)^2=6\pmod{9}$. How can I deal with mod 9 since it's not prime...

In the  of dealing with . This question is about the lemma:     Lemma Let $k \ge 2$, $p$ prime and $a$ coprime to $p$. Then $$p^2\!\mid a n^k+ bp\iff p\mid n,b.$$    This lemma answers the following kinds of questions:


If there were infinite many stars, is the sky then always full of light so is there than even night?

The question is the well-known      If there are so many/infinite stars, in every direction, why is it dark at night? Where goes all the light we don't see?    Discussing with a friend we found different answers.   The first (my friend's answer) is that given the fact that in a finite amount of time (in this case, the age of the universe), light can travel only a certain, finite, distance, we cannot see, if they actually exist, stars farther than such distance (about 13 billions of years, I guess). Then he states (or better, I got him notice he implicitly does this)  that within this radius there aren't enough stars to fill the night sky, and that's why we have darkness without sun's light.   The second answer (mine, or anyway the one I heard from a minutephysics YouTube video) is that despite of the big size of the observable universe, cosmological expansion red shifts most of the light out of the visible radiation range, so that the majority of light can't be seen by our eyes at night, while if we use, for example, an infrared camera, we should see a brighter sky, and lenghtening more and more the wavelength at which we observe the sky, we come to the uniform background radiation.  So my question is, what is the right answer? Is it one of the above-mentioned or even a third one?  EDIT: I've seen both answer may be acceptable, but what is the main contributing phenomenon?


I would like to compute the infinite sum $$\sum_{k=1}^{\infty}k^2\left(\frac{1}{2}\right)^{k-1}$$   How is that possible?   I tried to use the derivative method and got stuck here:  $$  \frac{d^2}{d^2x}\frac{1}{1-x}=\sum_{k=1}^{\infty}(k^2-k)x^{k-2} $$  How can I continue from here? What manipulations am I allowed to do to reach the exact form?  Thanks!

So I am studying series for an exam right now and there is an example in the book I am studying (unfortunately the book is specific to my university so I cannot give any link) where certain series' sums are calculated. At some point the following ones are calculated:  $$\sum_{n=1}^{\infty}\left(\dfrac{1}{5}\right)^{n-1}=\frac54$$  and  $$\sum_{n=1}^{\infty} n\left(\dfrac{1}{5}\right)^{n-1}=\frac{25}{16}$$  I do not understand the reason that extra $n$ (the multiplier in the front) squares everything. Also I have no clue what to do when I have say   $$\sum_{n=1}^{\infty}n^2\left(\dfrac{1}{5}\right)^{n-1}$$  Do I cube everything? Is there a specific way to do it that I do not get? If there is some online paper, book chapter or whatever that could help me, please link me to it!


How come pure monocromatic light in the violet spectrum is perceived by us as light that is a superposition of 2 other, different wavelength light. is there some scattering process in the eye that causes a both an filtration of one photon (lets say Red) and a shift in the wavelength of the Blue (like Compton/Raman scattering)? Edit: I'm looking for at least a electrodynamical\quantum mechanical explanation. how come purple is "measured" when the wavefunction consists of 2 particles of different wavelength

Our eyes contain 3 photoreceptor cells (cones) to perceive three wavelength ranges of light. Here is a visual representation of the wavelengths by these receptors (S, M and L).    So if we have light of 440 nm, it results in the color blue. If we have light of 540 nm, it results in the color green. If we see light of 650 nm, it results in the color red.  I think I understand our ability of the brain to mix the results of the signals of these receptors, producing colors like yellow. However, what I do not understand is how the color spectrum is displayed like this:    Given that spectrum, I would suggest that the color 'blue' is actually a mix between the receptors S and M. And the pure result of activating the S-receptor would result in the color 'purple' (I would describe the color in the left of the image as purple, right). Therefore, the receptor colors should instead be RGP (red, green, purple) instead of RGB (red, green, blue).  However, there is one problem with this which I cannot explain. How come that mixing red light with blue light also results in purple light? How is it possible that purple light can be achieved through mixing (additively) blue and red light, just as going to the shortest wavelength boundary of what we can see (from blue to ultraviolet via purple)?  So the actual problem here is:   Purple is the color at the very shortest wavelength we can see. Purple is an additive mix between what we see as red light and blue light.   That just doesn't make any sense. I don't see how our brain can possibly perceive this as being the same color. Shouldn't both purple colors actually be different colors (thus we would have a new different color for that)?  UPDATE: Pure activation of the S-cone (blue) may actually give violet instead of blue. That means that the color blue contains also a bit activation from the M- and L-cones (green and red). So then the "blue-est blue" is actually violet, not blue. This confusion originates from the RGB-system (and other sources) that assume blue as being a primary color, whereas violet would perhaps be more accurate! Further details can be found in the accepted answer.  The  may further help to understand what purple/magenta/violet really is.


As far as I can recall there are just a few words in the English language which end with the spelling -tion after an 'S' which have a pronunciation ending as 'chan'. But in South Asia, 99% of the people pronounce such words as 'shan'.  I am referring to words like digestion, suggestion, combustion, congestion, indigestion, exhaustion, etc.  But people pronounce the word question correctly as 'chan'.

Ok, we got a lot of words with suffix "-tion" in English like reflection or congestion.  But the way to pronounce "-tion" is different sometimes.  congestion /kənˈdʒes.tʃən/  reflection /rɪˈflek.ʃən/  SO, What are the rules to pronounce the suffix "-tion" in English, when to say "/-tʃən/" and when to say  "/ʃən/"?


I have a Java project witch consults an API which returns a String like:  "['test1', 'test2', 'test3']" // the array is a string   So basically an array object parsed to a String. I would like to know the best way to convert it to a real Java List.

I have an array that is initialized like:  Element[] array = {new Element(1), new Element(2), new Element(3)};   I would like to convert this array into an object of the  class.  ArrayList<Element> arraylist = ???;


Camera sensors have an specific number of cells,and their resolution depends on this amount of cells. But film does not have this "units" of sensible material; So, does the size of the particles of the film's light reacting coatings determine its resolution, or can it be said that film has an infinite resolution?

Is there some kind of equivalency table or formula that expresses what kind of pixels you need in a digital camera to have roughly the same quality as a particular ISO graded film? What other variables would influence this (focal-length, exposure time, etc)?


I feel intimidated in learning TikZ. I was wondering if there are some nice materials (or just your replies) at different level:   for providing big picture, which is important to beginners to not lose direction during learning. for comprehensive reference.   Examples are important, but only examples are not always clear for understanding the big picture and organization.


If I want to solve $x^2=x$ then obviously $x(x-1)=0$ so $x=0$ or $x=1$.  But, what if I try to solve it differently:  $$x^2=x$$ $$\frac{x^2}{x}=1$$ $$x=1$$  Then for some reason the solution $x=0$ vanishes. Apparently I am missing something. Question is: what am I missing and how to also get $x=0$ as a solution in the second method?

I have the equation $x^2=x$.  If I divide $x$ from both sides I get $x=1$.  Yet clearly $x$ can also equal $0$.  What step in this process is wrong? It seems to me that there's only one step. And isn't dividing the same thing from both sides a valid step?  I hope this isn't a stupid question because I feel dumb asking about something so basic.  EDIT: To clarify, what I'm looking for is not only an explanation for why my methodology is wrong, but also a better methodology that will keep me from missing possible solutions in the future.


Lets say that you have a connected car battery. If you remove the negative lead first and then touched it would the current go through you to the earth (GND)?  What is i then attached a wire which is touching the ground to the negative battery terminal?

First, if you have a better suggestion for title I'm really opened to suggestions, but it is the best I came up with.  If I touch an electric line and the earth, I will get electrocuted.  However, if I touch the positive of a car battery, people told me the same thing won't happen...why is it?  It seems I need to touch the battery positive and the battery ground.


Here is the preamble i used   \immediate\write18{makeindex \jobname.nlo -s nomencl.ist -o \jobname.nls} \documentclass[paper=letter, fontsize=12pt]{book} \usepackage[utf8]{inputenc} \usepackage[english]{babel} \usepackage{graphicx} \usepackage{subfigure} \usepackage{amsmath} \usepackage{amssymb} \usepackage{fancyhdr} \usepackage{geometry} \usepackage{textcomp} \usepackage{setspace} \usepackage[font=small]{caption} \usepackage{float} \usepackage{lineno} \usepackage{hyperref} \usepackage{pdflscape} \usepackage[Glenn]{fncychap} %Options: Sonny, Lenny, Glenn, Conny, Rejne, Bjarne, Bjornstrup %\textwidth=450pt\oddsidemargin=0pt %\geometry{verbose,a4paper,tmargin=25mm,bmargin=25mm,lmargin=25mm,rmargin=25mm} \setlength{\parindent}{0in} \onehalfspacing  \usepackage[numbers]{natbib}  \begin{document} and I want to put a picture in landscape mode. I did in this way which did not worked for me:  \begin{landscape} \begin{figure}[h!] \begin{center} \includegraphics[scale=0.5]{lhc_cross_section.jpg} \caption{Cross sectional view of proton-proton collision.} \end{center} \end{figure} \end{landscape}   Any suggestion will really be appreciated.

How can I change some pages into document into landscape mode, while leaving the others in portrait mode (or vice versa)?


Every lecture and book says that the denominator in Bayes' Rule does not depend on the parameter $\theta$. However, the denominator also includes $\theta$ in the formula of Bayes' Rule. I just cannot understand what it really says.

I read that in Bayes rule, the denominator $\Pr(\textrm{data})$ of   $$\Pr(\text{parameters} \mid \text{data}) = \frac{\Pr(\textrm{data} \mid \textrm{parameters}) \Pr(\text{parameters})}{\Pr(\text{data})}$$   is called a normalizing constant. What exactly is it? What is its purpose? Why does it look like $\Pr(data)$? Why doesn't it depend on the parameters?


On both my nexus 9 and my Oneplus One running android 5.0.1 the apk installer will pop up and show the permissions but it simply won't let me click install. It does it for apks from the internet and from the Amazon app store. The only thing that I have found is that lollipop doesn't let secondary users install apps but I don't even have secondary users on either of my devices. I searched the settings and haven't found anything, and before you assume that I am a complete fool the "unknown sources" box is checked. How can I fix this?

I'm trying to sideload an application, as seen in the picture below.    I have allowed the installation of applications from unknown applied actions in settings, but I can't seem to press the install button. The cancel button works correctly and installing applications via adb install works correctly. What's the problem?  EDIT: For those who have this problem, using ChainFire's  will correct it because the app uses hardware compositing, and Android doesn't notice a "layer" on top of the current screen.


I get that $∅$ is subset of every set thus $∅ ⊆ \{\{∅\}\}$. However, I'm not sure if $∅ ⊂ \{\{∅\}\}$. From definition of proper subset, the relation between two sets require the larger set to have at least one element not in the other one. What I'm confused is, does $\{\{∅\}\}$ have an element that $∅$ doesn't have?

if $$A=\left\{\varnothing \right\}$$ we know that $A$ is a Singleton Set whose single element is a Null set. That is $A$  is a set containing another set which is Null set.  Now are these two statements True?  $1.$ $\varnothing \in A$  $2.$ $\varnothing \subset A$


I've calculated many symmetric and antisymmetric solutions of the time-independent Schrödinger Euqation by a given square potentials $V(x)$. Just for practice etc., but honestly I do not understand why I have to calculate the symmetric and antisymmetric solution of the time-independent Schrödinger Equation.   I.e. for every $i$-th constant potential part $V_i$ in $V(x)$ you can compute a time-indepedent wave-function $\psi_i(x)$, which solves the time-independent Schrödinger Euqation $$\psi_i(x)'' + k_i^2 \psi_i(x)'=0$$ with $k_i=\frac{\sqrt{2m(V_i-E)}}{\hbar}$ and in the end you got $\psi(x)$ solved in a symmetric way $(\psi(x)=\psi(-x)$, even parity$)$ and solved in an anti-symmetric way$(\psi(-x) = -\psi(x)$, odd parity$)$ with respect to continium conditions between each $\psi(x)_i$-boundary of course.   So what meaning does the symmetric and antisymmetric solution have for a particle with mass m in a certain (square) potential in Quantum Mechanics?   (I tried to find a solution for my problem, but I neither really found it in Albert Messiah books nor here. But I read that post here: )

I have done the Problem 2.1 in Griffiths' quantum mechanics,  and it seems not making sense to me.  What if the wave function isn't symmetric at all?  Then obviously the proof doesn't work. The solution confuses me.      If $V(x)=V(-x)$ then the "position" wave function can always be taken to be either even or odd.


I am interested in evaluation $\lim_{x\to ∞} \left(\sqrt{x^2+4x+1}-x \right)$.  I tried to multiply it by ($\sqrt{x^2+4x+1}+x$) but didn't seem like it did worked.

This is being asked in an effort to cut down on duplicates, see here: , and here: .    What methods can be used to evaluate the limit $$\lim_{x\rightarrow\infty} \sqrt[n]{x^{n}+a_{n-1}x^{n-1}+\cdots+a_{0}}-x.$$  In other words, if I am given a polynomial $P(x)=x^n + a_{n-1}x^{n-1} +\cdots +a_1 x+ a_0$, how would I find $$\lim_{x\rightarrow\infty} P(x)^{1/n}-x.$$  For example, how would I evaluate limits such as $$\lim_{x\rightarrow\infty} \sqrt{x^2 +x+1}-x$$ or $$\lim_{x\rightarrow\infty} \sqrt[5]{x^5 +x^3 +99x+101}-x.$$


I'm trying to get into pairing-based cryptography and I don't see why the group order of the group G in  the pairing function   e:G*G-> G_t   has to be a prime number.  I don't find an argument why groups of order p^k for a prime number p and some entire number k cannot be used?

Why we need bilinear groups of composite order? What's the special security property of the composite order group in comparison with one of prime order? To put it in another way when do we need composite order groups for bilinear maps and when prime order?


I am trying to do date comparison in javascript.Through a web service call I am getting a date in the form of ""2014-07-02T09:49:49.299Z" and from database I am getting the dat like "2014-07-11 16:01:34".I need to compare these two dates after doing some kind of formatting.i am not sure how to format these two kind of dates to a common format.  Thanks in advance.....

Can someone suggest a way to compare the values of two dates greater than, less than, and not in the past using JavaScript? The values will be coming from text boxes.


Aside from indexing the value of the foreign key, what is/are the advantage of assigning foreign keys to databases? I've seen a lot of databases that does not assign foreign keys, but is relational by their schema. One example is the database of the wiki (mediawiki). I've studied their schema and although their tables are interconnected using the primary key of one table, they aren't assigning any foreign keys.

I'm testing some queries with MySQL and tried to create two tables were there should be a reference between IDs. Something like:  CREATE TABLE user  (   id int(11) UNSIGNED AUTO_INCREMENT,   name varchar(30) NOT NULL,   PRIMARY KEY id );  CREATE TABLE photo (   id int(11) UNSIGNED AUTO_INCREMENT,   user_id int(11) UNSIGNED,   filename varchar(50) NOT NULL,   PRIMARY KEY id );   A query like:  SELECT p.filename, u.name FROM user AS u INNER JOIN photo AS p ON u.id = p.user_id   Would result in all records of photos and their user's name.   So if it is possible to create a relation on query, why would I use foreign keys and define NO ACTION, considering I want to keep a history of photos, if there is no need for that? Foreign keys helps on performance or just make data more organized?


I am learning Cypress and automating API tests. I have a JSON file in the fixtures folder and I want to pass this JSON file as a request body. {   "name": "Harry",   "email": "hello@cypress.io",   "mobile": "1234" }   so if I want to change the mobile value to something else then I can do like cy.fixture('request.json').then((requestBody) => {       requestBody.mobile = '5678'       cy.request({         url: requestUrl,         method: 'POST',         body: requestBody     }) })  If I want to delete the mobile value and just want to pass name and email from request.json then can I do this from the same file or I have to create a separate file. Is it possible in cypress?  requestBody.mobile.delete() //something like this

Say I create an object as follows: let myObject = {   "ircEvent": "PRIVMSG",   "method": "newURI",   "regex": "^http://.*" };  How should I remove the property regex to end up with new myObject as follows? let myObject = {   "ircEvent": "PRIVMSG",   "method": "newURI" };


I'm thinking of buying a canon 550D second hand. I have a few quesitons:  1) If I buy lenses for this camera, will they work with ALL other canon DSLRs?  2) What should I look out for when buying second hand (I'm buying it from a second hand store)  3) What is this "magic lantern" program and should I get it?  Thank you

This is specific to Canon, but what is the difference between EF and EF-S lenses?


To further clarify... I'm attempting to figure out whether friction is reduced the faster a vehicle moves. It's easy to understand that faster vehicles take more time and distance to stop.

Possible Duplicate:          Layman alert...I last did physics in high school, and am just trying to understand something my son is working on.   To keep a box moving across the floor at a constant velocity I need to apply a force equal and opposite to that of the  force working on it.  If I start applying a force greater than the kinetic friction force, the box will speed up. Will it keep speeding up indefinitely, or will the kinetic friction force I need to overcome increase as the box gets faster?


Let $\ G\ $ be a finite group with $\ |G|=n\ $  Caley's theorem states that $\ G\ $ is isomorphic to a subgroup of the symmetric group $\ S_n\ $  However, in many cases, the smallest positive integer $\ m\ $, such that $\ G\ $ is isomorphic to a subgroup of $\ S_m\ $ is smaller than $\ n\ $.     How can I determine $\ m\ $ , if I do not have access to GAP ?   Is there some applet or online calculator that can do this ? Or can $\ m\ $ be calculated by knowing specific properties of $\ G \ $ ?

It is a theorem that, for every finite group $G$, there exists an $n$ such that $G \leq  S_n$. Given a particular group, is there any way to determine or bound the smallest $n$ such that this occurs? The representation of the group is up to you, though bounds that use less information are preferred.  If this problem is too hard, specific special cases are also interesting, as are bounds on $n$.


I have fit a logistic regression to predict a given binary outcome, and the estimated coefficient associated with one of the features, feature $x$ let's say, has a value $\theta$. The interpretation of this coefficient is that an increase by one unit of feature $x$, will increase the odds of the outcome by a factor of $e^\theta$. Is it possible to quantify/approximate by how much the "probability of the outcome" (not the odds) will increase/decrease given an increase by one unit of feature $x$ ?

There's a lot of discussion in epidemiology around the relative merits of odds ratios vs risk ratios. Proponents of the former cite the mathematical qualities of odds (not constrained to be between 0 and 1) and their suitability for examining common outcomes. Proponents of the latter believe that RR's are often more interpretable, and match how clinicians and the public tend to think. Some have suggested methods to model risk ratios directly (in multivariable models). For instance, the log binomial model and poisson regression with robust standard errors. What I don't understand is - why don't we just fit the model using standard logistic regression and perform the inverse logit transformation on the fitted estimates? For instance, lets say we are trying to predict coronary heart disease using BMI (exposure) and age (confounder). We could fit the model and estimate the odds of CHD across the range of values of BMI (adjusted for age), according to the model. We then take the inverse-logit of those fitted odds to transform them onto the probability scale. Seemingly this way we now have an idea of the risk of the outcome across all values of the exposure, which we can plot or otherwise describe. But i've never seen this method recommended. Which makes me think there must be a conceptual issue with it?? p.s. lets assume we are performing a cross-sectional or cohort study (not a case-control study).


$$\ddot y + y + \epsilon y^3 = 0$$ $$y(0) = a$$ $$\dot y = 0 $$  How do I solve this to first order using "ordinary asymptotic power series"? Frankly I don't see that term in the section in my book so I'm confused where to start. If someone could start me off that would hopefully help me see where this should be going.

The question is to find an approximate solution, up to the order of epsilon of following problem.  $$y'' + y+\epsilon y^3 = 0$$ $$y(0) = a$$ $$y'(0) = 0$$  I tried to solve the given problem using perturbation theory.  $$y(t) = y_0(t) + \epsilon y_1(t) + \epsilon^2 y_2(t) + \cdots$$ $$t = w(\epsilon)t = (1 + \epsilon w_1 + \epsilon^2 w_2 + \cdots )t$$  However, i failed to find an appropriate approximate solution... help me!!


I'm need to convert some string comparisons from vb to c#. The vb code uses > and  < operators. I am looking to replace this with standard framework string comparison methods. But, there's a behaviour I don't understand.  To replicate this, I have this test  [TestMethod] public void TestMethod2() {     string originalCulture = CultureInfo.CurrentCulture.Name; // en-GB      var a = "d".CompareTo("t");  // returns -1     var b = "T".CompareTo("t");  // returns 1      Assert.IsTrue(a < 0, "Case 1");     Assert.IsTrue(b <= 0, "Case 2"); }   Could someone explain why b is returning 1. My current understanding is that if it is case sensitive then "T" should precede "t" in the sort order i.e. -1. If it is case insensitive it would be the same i.e. 0  (FYI .Net Framework 4.5.2)  Many thx

Comparing string in C# is pretty simple.  In fact there are several ways to do it.  I have listed some in the block below.  What I am curious about are the differences between them and when one should be used over the others?  Should one be avoided at all costs?  Are there more I haven't listed?    string testString = "Test"; string anotherString = "Another";  if (testString.CompareTo(anotherString) == 0) {} if (testString.Equals(anotherString)) {} if (testString == anotherString) {}   (Note: I am looking for equality in this example, not less than or greater than but feel free to comment on that as well)