I run Ubuntu 16.04 LTS and my cpu is intel i5-7300hq. After updating today I got kernel 4.13.0-26-generic from 4.10.0-42-generic. During the update process I got the following warnings:  update-initramfs: Generating /boot/initrd.img-4.13.0-26-generic W: Possible missing firmware /lib/firmware/i915/kbl_huc_ver02_00_1810.bin for module i915 W: Possible missing firmware /lib/firmware/i915/bxt_huc_ver01_07_1398.bin for module i915 W: Possible missing firmware /lib/firmware/i915/skl_huc_ver01_07_1398.bin for module i915   How do I fix those missing firmware? I think the solution is to get the new linux-firmware package from  but I am not sure which one is appropriate for kernel 4.13. Or is there another way to fix this?  Edit Regarding the  suggested. The answers there suggest downloading some binaries straight from intel. Isn't that though more risky compared to getting the proper linux-firmware package that integrates them more properly with the operating system to make sure weird bugs don't arise?  Here is the information of the current linux-firmware package:  $ apt policy linux-firmware linux-firmware:   Installed: 1.161.1   Candidate: 1.161.1   The newer versions available from  are 1.164, 1.169, 1.170. But I don't know which one corresponds to the 4.13 kernel.

When I run a kernel or NVIDIA driver update on my 16.04, this triggers an initramfs rebuild which outputs the warning below:  Processing triggers for initramfs-tools (0.122ubuntu8.1) ... update-initramfs: Generating /boot/initrd.img-4.4.0-34-generic W: Possible missing firmware /lib/firmware/i915/skl_guc_ver6.bin for module i915_bpo   I have a notebook with two graphics chips, an NVIDIA GeForce 940M and the Intel i5-6200U's integrated graphics.  The device in use is my NVIDIA card:  $ inxi -G Graphics:  Card-1: Intel Sky Lake Integrated Graphics            Card-2: NVIDIA GM108M [GeForce 940M]            Display Server: X.Org 1.18.3 driver: nvidia Resolution: 1920x1080@60.03hz            GLX Renderer: GeForce 940M/PCIe/SSE2 GLX Version: 4.5.0 NVIDIA 367.35   Here's the output of lshw -c video, corresponding to my Intel graphics chip which should use that driver:      *-display                   description: VGA compatible controller          product: Sky Lake Integrated Graphics          vendor: Intel Corporation          physical id: 2          bus info: pci@0000:00:02.0          version: 07          width: 64 bits          clock: 33MHz          capabilities: pciexpress msi pm vga_controller bus_master cap_list rom          configuration: driver=i915_bpo latency=0          resources: irq:125 memory:a2000000-a2ffffff memory:b0000000-bfffffff ioport:5000(size=64)   The file in the warning does not exist, only those:  $ ll /lib/firmware/i915/ total 336 drwxr-xr-x  2 root root   4096 Aug 11 13:24 ./ drwxr-xr-x 74 root root  32768 Aug 11 13:24 ../ -rw-r--r--  1 root root   5872 Jul 21 17:03 bxt_dmc_ver1_04.bin -rw-r--r--  1 root root   5872 Jul 21 17:03 bxt_dmc_ver1_05.bin -rw-r--r--  1 root root   8380 Jul 21 17:03 bxt_dmc_ver1_06.bin -rw-r--r--  1 root root   8380 Jul 21 17:05 bxt_dmc_ver1_07.bin lrwxrwxrwx  1 root root     19 Jul 21 17:05 bxt_dmc_ver1.bin -> bxt_dmc_ver1_07.bin -rw-r--r--  1 root root   8824 Jul 21 17:03 skl_dmc_ver1_23.bin -rw-r--r--  1 root root   8928 Jul 12 21:33 skl_dmc_ver1_26.bin lrwxrwxrwx  1 root root     19 Jul 12 21:33 skl_dmc_ver1.bin -> skl_dmc_ver1_26.bin -rw-r--r--  1 root root 109636 Jul 21 17:03 skl_guc_ver1_1059.bin lrwxrwxrwx  1 root root     21 Jul 21 17:03 skl_guc_ver1.bin -> skl_guc_ver1_1059.bin -rw-r--r--  1 root root 128320 Jul 21 17:03 skl_guc_ver4_3.bin lrwxrwxrwx  1 root root     18 Jul 21 17:03 skl_guc_ver4.bin -> skl_guc_ver4_3.bin   The latest driver package seems to be installed though:  $ apt-cache policy xserver-xorg-video-intel xserver-xorg-video-intel:   Installed: 2:2.99.917+git20160325-1ubuntu1   Candidate: 2:2.99.917+git20160325-1ubuntu1   Version table:  *** 2:2.99.917+git20160325-1ubuntu1 500         500 http://ftp.uni-stuttgart.de/ubuntu xenial/main amd64 Packages         100 /var/lib/dpkg/status   What does this warning mean exactly and how can I fix it?


I don't understand what does this @ means in HotspotID = @HotspotID?      public BestFit CheckBestFit(String hotspotID)     {         String sql = "SELECT ZoomOut FROM Components WHERE HotspotID = @HotspotID";         Int32 value = 0;     }

I was browsing through the questions and noticed this:  SELECT prodid, issue FROM Sales  WHERE custid = @custid  AND datesold = SELECT MAX(datesold)               FROM Sales s               WHERE s.prodid = Sales.prodid                   AND s.issue = Sales.issue                   AND s.custid = @custid   I was wondering what the "@" does in front of custID?  Is it just a way of referencing the custID from the table being selected?


I have a requirement to display all files in a directory which doesn't have CountOfFilesTransmitted=0 string in them.   If I give below command it gives only those files which has CountOfFilesTransmitted=1  find . -type f | xargs grep -l "CountOfFilesTransmitted=1"   Gives: 1.log, 2.log, 10.log  find . -type f | xargs grep -l "CountOfFilesTransmitted=1" -- gives 3.log, 7.log   There are logs in that directory with 0 to 100 files Transmitted I have to give 101 entries. Is there a way to get filenames which have non zero?  something like "find . -type f | xargs grep -l "CountOfFilesTransmitted!=0" which should return all files which doesn't have "CountOfFilesTransmitted=0" string.

What concise command can I use to find all files that do NOT contain a text string?  I tried this (using -v to invert grep's parameters) with no luck:  find . -exec grep -v -l shared.php {} \;   Someone said this would work:  find . ! -exec grep -l shared.php {} \;   But it does not seem to work for me.   has this example:  find ./logs -size +1c  > t._tmp while read filename do      grep -q "Process Complete" $filename      if [ $? -ne 0 ] ; then              echo $filename      fi done < t._tmp rm -f t_tmp   But that's cumbersome and not at all concise.  ps: I know that grep -L * will do this, but how can I use the find command in combination with grep to excluded files is what I really want to know.  pss: Also I'm not sure how to have grep include subdirectories with the grep -L * syntax, but I still want to know how to use it with find :)


We just installed the abuntu disc 9.04 and are wanting to update. Is there a place you can buy discs to do this or should it be done online. We are new to this and a little bit confused about what to do. Also, are all updates neccesary or can one choose what they want?  Not sure where to go from 9.04  Thank you.

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


For example, should it state: The beneficiary(ies) on your account were updated? OR The beneficiary(ies) on your account was updated? I'm thinking the first, but want to be sure.

Consider the following sentence:     We assume that the individual(s) possesses some general knowledge of the rules of football.   Is "possesses" correct there? Should it be "possess"? Is the rule more complex than always using one or the other?


As noted many times in the Mistborn trilogy (I can't remember any exact text), Feruchemists used to keep Metalminds on their bodies - including earrings - to store Feruchemical attributes. It was later revealed that Ruin was able to control any being who's body was pierced with metal which means he should also be able to affect anyone with earring Metalminds (example: Vin herself was manipulated through her earring). How were the Feruchemists not affected by Ruin?

We have several examples of Hemalurgic spikes being used to control or manipulate a being:  Kandra Inquisitors Koloss Vin Penrod Spook  However, Spook's letter in The Hero of Ages reads:  Vin, My mind is clouded. A part of me wonders what is real anymore. Yet, one thing seems to press on me again and again. I must tell you something. I don't know if it will matter, but I must say it nonetheless. The thing we fight is real. I have seen it. It tried to destroy me, and it tried to destroy the people of Urteau. It got control of me through a method I wasn't expecting. Metal. A little sliver of metal piercing my body. With that, it was able to twist my thoughts. It couldn't take complete control of me, like you control the koloss, but it did something similar, I think. Perhaps the piece of metal wasn't big enough. I don't know. Either way, it appeared to me, taking the form of Kelsier. It did the same thing to the king here in Urteau. It is clever. It is subtle. Be careful, Vin. Don't trust anyone pierced by metal! Even the smallest bit can taint a man. Spook The Hero of Ages - Chapter 69  So I'm wondering if this is indeed true. I can only think of one example that would support any metal allowing control or manipulation. The Lord Ruler said:  I fear that it has corrupted my thoughts. It cannot sense what I think, but it can speak inside of my head. Eight hundred years of this has made it difficult to trust my own mind. Sometimes, I hear the voices, and simply assume that I am mad. The Hero of Ages - Chapter 48  And in The Final Empire:  [Vin] flared the iron. Blue lines appeared pointing to the Lord Ruler’s rings and bracelets—all of them but the ones on his upper arms, piercing his skin. The Final Empire - Chapter 38  These bracers obviously were not Hemalurgically charged, because the Lord Ruler had no need for that being a full Mistborn and Feruchemist already. And yet it allowed Ruin to speak to his mind. So is it truly any metal in a person allows control? If enough coins were shot into someone could they be controlled? What about Miles Hundredlives1? Would Harmony be able to fully control him due to the number of piercings? Could the Lord Ruler have taken control of a Terris Steward2 like he did the Koloss? In short, does the Metal have to be Hemalurgically charged to control someone?  (all emphasis mine) 1 - Miles Hundredlives  “You need to get [Miles'] metalminds off of ’im,” Wayne said. “It’s the only way.” “He keeps thirty different ones,” Waxillium said, “all piercing his skin, The Alloy of Law - Chapter 13  2 - Terris Steward  “You’re a Terrisman,” Vin said. [Sazed's] earlobes had been stretched out, and the ears themselves contained studs that ran around their perimeter. He wore the lavish, colorful robes of a Terris steward The Final Empire - Chapter 8


I'm having a NullPointerException error when I run my program, I've read a few things on it and tried to make some changes but still getting the error. here's the code :  public class Farm { private Connection connect; private PreparedStatement prep; public Farm(){     try {         Class.forName("oracle.jdbc.OracleDriver");         DriverManager.getConnection("jdbc:oracle:thin:@localhost:1521:XE", "SHID","pikachu");      } catch (ClassNotFoundException e) {         // TODO Auto-generated catch block         e.printStackTrace();     } catch (SQLException e) {         // TODO Auto-generated catch block         e.printStackTrace();     } }  public void AddAnimal(String name, int age, double weight, String specie){      String sql="INSERT INTO ANIMALFARM VALUES('"+name+"',"+age+", "+weight+",'"+specie+"')";     try {         prep= connect.prepareStatement(sql);          prep.executeUpdate();      } catch (SQLException e) {         // TODO Auto-generated catch block         e.printStackTrace();     }  }}   My main class:  public class Test {  public static void main(String[] args) {     // TODO Auto-generated method stub     Farm ferme= new Farm();     ferme.AddAnimal("Cerbre", 43, 34.00, "dog"); }}   And I'm having this error  Exception in thread "main" java.lang.NullPointerException at Farm.AddAnimal(Farm.java:31) at Test.main(Test.java:7)

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?


Given a certain PID, is it possible to discover what command-line executed this process?   top, atop, ps provide real time informations, I'm looking for something whereby I can look the past, because I've seen a process taking many resources of the machine, I've killed it, but now I want to know more about it

Sometimes, I have a rogue Java process which takes up 100% of my CPU and makes it jump about 30C in temperature (usually resulting in a crash if not killed).  Problem is, I can never really identify it (its got a long list of parameters and stuff) or analyze it because I have to kill it so quickly.  Is there a sort of log I can look at to see the identity of past processes I have killed? If not, is there a way for me to catch that process next time it shows up?  If it matters I'm OpenSuse 11.4.


I have:   op1 = Integer.parseInt(jTextField1.getText());  op2 = Integer.parseInt(jTextField2.getText());   However, I want to check first whether the text fields' values can be assigned to integer variables. How do I do that?  I've been going through this for a long time, so, if this was already asked here, forgive me

I normally use the following idiom to check if a String can be converted to an integer.  public boolean isInteger( String input ) {     try {         Integer.parseInt( input );         return true;     }     catch( Exception e ) {         return false;     } }   Is it just me, or does this seem a bit hackish?  What's a better way?    See my answer (with benchmarks, based on the  by ) to see why I've reversed my position and accepted  to this problem.  I think this original code will be used by most people because it's quicker to implement, and more maintainable, but it's orders of magnitude slower when non-integer data is provided.


Computer with Ubuntu 20.04 installed was working. Now boots to a black screen. Lights on the keyboard show the computer is on. Tried to reboot with a ubs from which the system was first loaded. Cannot get to terminal. Any suggestions welcome.

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:


$\sum_{n\geq1}\frac{2^{n-1}}{1+a^{2n-1}}, a > 0$  I was considering the use of some power series, but to no end as the denominator of the fraction does no simply after derivation.

Let $a \in (1, \infty)$. Calculate $$ \lim\limits_{n \to \infty} \sum_{k=0}^n \frac{2^{k-1}}{a^{2k-1}+1} $$   Here's what I tried:  Let $ x_n = \sum_{k=0}^n \frac{2^{k-1}}{a^{2k-1}+1} $. Let $a_n, b_n$ so that $a_n < x_n < b_n$. If $a_n \to l, b_n \to l$ with $ l \in \mathbb{R}$ then $x_n \to l$. I tried saying that $$ {{1+2+2^2+\dots+2^{n-1}}\over{a^{2n-1}+1}} < x_n < {{1+2+2^2+\dots+2^{n-1}}\over{a+1}} $$ but the limit of the lefthand-side  fraction is $0$ and the one for the righthand-side is $\infty$. How can I solve this?


I want to protect my .dlls from reverse engineering.  My scenario:  I have an Asp.net website and that website I already hosted on client's server (IIS). Now I set some XYZ date in my system. That system should work until that date. once that date is become current date at that time User will get a popup message "your licence is expired. Please contact to Vendor."  Now clients comes to me and ask for re-new licence and pay me some amount. I will generate new date in an encrypted string. I will just give that encrypted string to the client. The client will insert that encrypted string in the system and that encrypted date will be stored in ABC table in the database.  Now some technical client tries to update that encrypted date in that ABC table in the database by de-compiling  or reverse-engineering, and they will get the string token key which we used for encrypt/decrypt logic, and also gets the encrypt/decrypt function from my .dll.   Now they can easily generate the new date in an encrypted form and update that in table into database.  Please someone can help on that - How can I prevent this.

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.


I am going to reinstall Ubuntu soon and want to move my wireless passwords I have to the new installation. What do I need to backup to put on the new installation?

I have an Acer Aspire ZG5 netbook which is currently running Jolicloud, but I've decided it isn't for me and plan to switch to Lubuntu or Xubuntu.  However, I do lot of travelling and have many saved wifi passwords for different offices, hotels, cafes, restaurants, friends' and relatives' houses etc. It would be very annoying to have to ask for and reenter all of these passwords.  Is there a way to transfer my saved wifi passwords from the old installation to the new one?


how can I write the code of this picture in latex

I am facing problem to write the code of this below picture in my Latex document. kindly guide me about this.


In my regression model of BMR on age (yrs) , gender (1=male, 0=female), height and weight. The regression equation obtained is:  BMR = 1232.059+13.281 weight+3.954 age+192.214 male-3.471 age:gender.  Please interpret the negative coefficient of age:gender interaction. Do the negative coefficient have anything to do with the positive coefficient of age and gender?

If I have a linear regression of the form:  $$y \sim 1+\beta_1x_1 + \beta_2x_1x_2,$$  where $x_2$ is a Boolean variable depending on another variable $x_{2cont}$, a positive variable:  $$x_2 = \begin{cases} 1 & \mbox{if } x_{2cont} > 5 \\ 0 & \mbox{if } 0 < x_{2cont} \le 5. \end{cases}$$  And I got regression results. How shall I interpret the regression results?  esp. how shall I interpret the two coefficients I get from this regression,  $\beta_1 \text{ and } \beta_2$?


My question is a bit straightforward. How can I solve $i^i$? Do I have to work it out based on polar form of complex number? Even that doesn't seem to help!!

According to WolframAlpha,  but I don't know how I can prove it.


I have a newbie question  I have Greyhound tickets from Toronto,ON to NYC.  The first stop on this route is Buffalo NY.  I have individual tickets for each leg of trip (e.g. Toronto–Buffalo, Buffalo - Syracuse etc.).  My question is: Can I board the bus at Buffalo rather than at Toronto, as it turns out that works better with our trip plans?  (I Tried to contact Greyhound, but they are closed until Monday)

When travelling a (US) Greyhound service including a transfer, is it possible to skip the first leg of the journey? For flight tickets  that this is generally not allowed. But does Greyhound consider it as two distinct bookings or is it one indivisible whole?


The spin 1 $A^\mu$ field transforms under the $\left(\tfrac{1}{2}, \tfrac{1}{2}\right)$ representation of the Lorentz field. When restricted to the $SO(3)$ subgroup, it decomposes into the $0 \oplus 1$ representation of $SO(3)$. However, when using the massive Proca action, the spin $0$ degree of freedom is "killed off" by the equations of motion. (If the particle is massless, an extra degree of freedom is killed off, let's ignore that.)  What then was the point of using the $\left(\tfrac{1}{2}, \tfrac{1}{2}\right)$ representation to begin with? Why didn't we just use the $(1, 0)$ representation from the beginning?  Similarly, when we want to describe a spin 2 particle, we use the $(1, 1)$ representation and kill off degrees of freedom in the Lagrangian just like we did we the Proca action. What's the point? Why not just start with the $(0, 2)$ representation from the get-go?  To elaborate, there is a difference between the representations of the fields and the representations of the particles. However, which particle representations are actually present and "physical" are determined by the Lagrangian. The massive Proca Lagrangian kills of the spin $0$ particle. Is there some general way to construct Lagrangians that only give you the particles you want? And what's the point of keeping these un-physical representations around?

My impression for how Poincare and Lorentz representations are linked in $3+1$ dimensions is:   Assuming positive mass for simplicity, irreducible representations of the Poincare group are indexed by their mass $M$ and spin $s$. Irreducible representations of the Lorentz group are indexed by two numbers $(s_1, s_2)$ and when restricted to the rotation subgroup contains spins from $|s_1 - s_2|$ up to $s_1 + s_2$ in integer steps. Particles transform in representations of the Poincare group, while fields transform in representations of the Lorentz group. They are related by defining $$|\mathbf{p}, \lambda \rangle = a^\dagger(\mathbf{p}, \lambda) |0 \rangle$$ where $\lambda$ is the helicity, and the field is defined in terms of the creation and annihilation operators in the usual way. The only requirement is that the Lorentz representation used for the field contains the spin $s$ used in the Poincare irrep. A relativistic wave equation is imposed to eliminate the unwanted degrees of freedom.   For example, a massive spin $1$ particle may be embedded in a vector field, which is in the $(1/2, 1/2)$ irrep of the Lorentz group. This vector field has one extra degree of freedom that is eliminated by the equation $\partial_\mu A^\mu = 0$.  Assuming this is right, I'm wondering why I've never heard of "alternative" embeddings. For instance, why can't one embed a spin $1$ particle inside the $(1, 0)$ irrep, which doesn't have any extra degrees of freedom at all, or inside the $(1, 1)$ irrep? For massive particles, I've only ever seen spin $0$ in $(0, 0)$, spin $1/2$ in $(1/2, 0) + (0, 1/2)$, and spin $1$ in $(1/2, 1/2)$. Are other embeddings very clunky, or not allowed, or are they actually used somewhere?


Thresh's basic attacks are technically ranged since it works with runaan's hurricane. So does that mean that Yasuo wind wall can block.

It blocks everything from skillshots to even auto-attacks, but is there any skills that go through it? Things I have in mind would be dashes or certain attacks like Lux's ult.  How does it interact with returning spells (Ahri Q, Draven ult) or AOE spells. Do those spells still return to Ahri/Draven or just dissipate? Does AOE counter this wall such as Nasus or lux E's? Are bouncing projectiles blocked as they hit the wall?


Could a helpful soul tell me if this approach is correct?   I need to compute the gradient $\nabla f$ and find the result and deriviation of   $f(\vec{x}) = \vec{x}^T\vec{x}+c$    To solve this, I'm using a table in my textbook (First course in Machine Learning, 2nd edition, p. 23)):   If above table can be used as I imagine, I get:  $f(\vec{x}) = \vec{x}^T\vec{x}+c   \leftrightarrow \frac{\partial f}{\partial \vec{x}}(2\vec{x}+c)$.  Calculating $ \frac{\partial f}{\partial \vec{x}}(2\vec{x}+c) = 2$    The result is 2 and the derivative is $ \frac{\partial f}{\partial \vec{x}}(2\vec{x}+c)$

It's stated that the gradient of:  $$\frac{1}{2}x^TAx - b^Tx +c$$  is   $$\frac{1}{2}A^Tx + \frac{1}{2}Ax - b$$  How do you grind out this equation? Or specifically, how do you get from $x^TAx$ to $A^Tx + Ax$?


So I've been on stackoverflow for a while just replying question and now, for the first time asked something python-sqlalchemy related. I only got a reply that wasn't helpful so after a few days, I set a bounty that is now about to run out. The 50 reputation were kind of a lot to me and it's sad to see my bounty is about to run out without having attracted any answers. As the faq explains, . In a case where no single answer is given during the bounty period, I think it would be nice to return the bounty; Not finding any help is frustrating enough.  People repeatedly ask  or  bounties are returned, however, I haven't found any information on why the bounty system is so rigorous.  To clarify: I'm not talking about situations where there's unvoted replies within the bounty period but when there is no reply during the bounty period at all. This reason just doesn't apply in a case like this:     In any case, you will always give up the amount of reputation specified in the bounty, so if you start a bounty, be sure to follow up and award your bounty to the best answer!   When you set a bounty, you can expect someone to drop by and give a reply. If you don't accept it, you still got a new idea. At this point, the bounty should be gone, and this is the usual case, that there will be some reply.

It's possible to offer and award bounties of reputation on questions.   What is a bounty? How can I find questions that have a bounty attached? How do I start a bounty? When can I start a bounty? Why is the system requiring me to choose a bounty amount that's higher than the minimum? Can I use Markdown formatting in the bounty remarks? Can I edit the remark? How long is the bounty period? How do I award a bounty? Can I award a bounty to my own answer? Can I award a bounty to an old answer? If I offer a bounty on someone else's question, can I award the bounty to their answer? After awarding the bounty, can I remove it or move it to another answer at a later time? What happens if there's no answer after the bounty period? What happens if I feel my question is still unanswered? What is automatic awarding? Are bounty awards exempt from the 200 points/day reputation limit? How does Community Wiki mode affect bounties? How does user deletion or post dissociation affect bounties? Can I award a bounty to an answer from a deleted user or one where the author was dissociated? Can I offer a second bounty after the first one has expired? Can I raise my bounty? What happens if a bounty question is closed or deleted? Why can't I vote to close or migrate a bounty question? What happens if I delete my account while I have an active bounty? Do I keep an awarded bounty when I delete my answer? What happens if a question where I awarded a bounty later gets deleted or migrated? Can I cancel my bounty? Can I affect / divide / share part of my bounty to two (or more) users? How many outstanding bounties can a single user have?      See also:  in the Help Center


I had a Galaxy Nexus running Android 4.2.1 and it broke. My insurance replaced it, so I have a new Galaxy Nexus running Android 4.0.2. The new phone doesn't show that any system updates are available. (Well, I think it updated from 4.0.0 to 4.0.2 as soon as I turned it on, but nothing since then.) How do I update it to 4.2?  (Sorry if I'm not giving enough information; I'm new and I'm not sure what's relevant.)  QUESTION RESPONSES: -I am in Canada and my provider is Mobilicity. -I have tried going to About Phone -> System Updates and nothing shows up.  When I first got the phone, it updated from like 4.0.0 or 4.0.1 to 4.0.2, but that's all that has showed up.  I also tried clearing the cache and force stopping Google Services Framework, as suggested in another thread. -I don't really know what it means to install the update manually; I guess I'm willing to, but I feel that something must be wrong because this is the exact same phone (as far as I can tell) I've had for the last year with the exact same provider.  When I got this phone one year ago, it ran Jelly Bean automatically, so I don't get why this one wouldn't do the same automatically.  NEW INFO: -Sometimes when I click System Updates, after it says there no updates available and shows "Last checked for updates" as the current time, it starts downloading a 41.2 MB "Android System Update".  After it downloads, it restarts and gets that picture of the robot having surgery, but it's still running 4.0.2.    I don't think this question is a duplicate of the one posted, because this is a case where I know there is an official update from the carrier/manufacturer, but my phone isn't seeing it.  I noticed another thing: when it downloads the "Android System Update" and restarts, the picture of the robot starts off as a green guy standing up with a blue thing spinning in his chest, but then it changes to the green guy laying down with a red caution triangle over his chest.  Does that tell me anything?

This Community Wiki question is designed to be the "canonical question" for questions asking how to upgrade one's device to a new Android version.   I want to get a newer version of the OS for my Android device. How can I do that?  See also:


Hello how can I make a list of numbers that will increase by an x amount until the range is complete. Like I want set = [i for i in range(2,11)] I want the contents of list to be increase by 0.1, so its contents are going to go like [2, 2.1, 2.2, 2.3...... etc.]. Also how can I only print the contents of set1 of elements from the code below. instead of the outputs being (2, 1, 1) (2, 1, 2) (2, 2, 1) (2, 2, 2) (3, 1, 1) (3, 1, 2) (3, 2, 1) (3, 2, 2) it would be(2) (2) (2) (2) (3) (3) (3) (3). Thanks for the help :) import itertools set1 = [i for i in range(2,4)] set2 = [i for i in range(1,2)] set3 = [i for i in range(1,2)]               list_set = [set1, set2, set3] for element in itertools.product(*list_set):   print(element)

Is there a way to step between 0 and 1 by 0.1?   I thought I could do it like the following, but it failed:  for i in range(0, 1, 0.1):     print i   Instead, it says that the step argument cannot be zero, which I did not expect.


i've got Linux Mint on my machine and need Windows to be installed. Is there a way to install Windows without overwriting the bootloader? Also I couldn't find any guide how to backup/recover the bootloader, since all guides show installing windows first.  Regards

I have Linux Mint installed on my system. Now I want to install Windows 8 OS on another drive which is empty, so how can I achieve that.  Does installing Windows over Linux affect GRUB loader?  PS: Don't want to do it the virtual way.


I have no clue what I'm doing wrong.  I have a light, and everything, but it renders black.  When I render it from the bottom toolbar it renders fine, when I click Render Image, or render it from the view of the camera, its black.  I would attach the blend file, but I don't know how to. I already tried putting in more lights, and messing with the layers, but it just wont work!  Does anyone mind telling me what I did wrong?

In solid mode with Material or Texture, it is shown fine.   But in the Render mode, everything is pitch black. I have a sun, and the Opacity of the scene is set to 100%.    I am new to using Blender, so I have no idea what is wrong. If you could help, I would appreciate it. If you need more information to help me, I would be glad to give it.


Is there a way to insert an automatic "last edited" timestamp in the footer of a Google Document?  I would like to make sure that time stamp is on the document when I print. I figure out how to enter a "today" time stamp but need a script to pull "last edited" and, if possible, the user that last edited.

Is there a way in Google Docs to automatically update the date in a header of the page, so that whenever I print the document it will have today's date?


Either my supervisor is wrong in not letting me work on an idea which he does not understand, my bad that I am  stuck with someone who is not open-minded. But I suck it up.  But I am enthusiastic about the idea and wish to work on it myself. I can find time for it and it is very useful for my future opportunities. My supervisor is not really worried about my future.  So firstly, how to manage this exercise by getting what I want, having no effect on my PhD and keeping my supervisor not too angry (after all my Phd is still influenced by this guy). Secondly, is it ok to write it up myself and publish it? I am not using any ideas from my supervisor for this work, of course the learning from previous works will be used - which is already published!

I am doing a phd where my aim is to solve a problem A which is very interesting. My supervisor has got a lot of connections in a technology B and he claims to be an expert in B. I came to this group because of these accomplishments. But soon I realized that B is not really a great technology for A.   So in my phd proposal I proposed a method which encompasses B but is more general (say R). Now I realize that I do not want to use B at all because my preliminary results are not encouraging. In fact, I am inclined to use E as a base technique which does not have any impact on R.  But my supervisor, who is interested in only publishing in B  and frowns upon everything else (it was a nightmare to convince him to let me work on R) is dead against it. He says that he is an expert in B and his vision of the group is not inclined with me trying other things.  There are other professors in my university who have worked in E and could collaborate but my supervisor won't collaborate with people from outside his kingdom. I also know professors from outside my university who could help me if needed. I could knock the doors of school committee in order to  help me but that would create a lot of problems as my supervisor wields a lot of power and influence everywhere.    Another query is, is it ethical to collaborate with people outside the university (of course after letting my supervisor know) for my PhD work. My Masters supervisor would be happy to help me out.  Edit: After looking at comments, I am thinking that after all, it is MY PhD. Yes, I have spent 1.5 years, but 1.5 years is left. Why should I spend any moment of my life on something I find to be not exciting, particularly less exciting because it is forced on me. And in those 1.5 years I learnt to write well and also learnt 'A' which is important. Its not total waste. My supervisor has his agenda, and why should I give up mine to make him happy? His vision is fine, but he does not have the right to force his vision on me.


If I have an equation, say $x^2 + 9x-93=0$, why can't I just take the derivative on both sides to get $2x = -9$ and therefore $x = -\dfrac{9}{2}$. What is the reason behind why what I did is wrong?

Let's say we have $x^2=25$ So we have two real roots ie $+5$ and $-5$.  But if we were to differentiate on both sides with respect to $x$ we'll have the equation $2x=0$ which gives us the only root as $x=0$.  So does differentiating on both sides of an equation alter it? If it does, then how do we conveniently do it in Integration by substitutions? If not then what exactly is going on here ?


What are the list of symbols found in LaTeX for letters similar to these:   For Mobile Phone - `\mphone` For Phone - `\phone`   What are the other symbols available like for email, home, etc..

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


I found a solution online that uses the Binomial Theorem. Is it possible to prove this without using that theorem?

Please help me  to evaluate combinatorially the following sum: $$\sum_{k=0}^n \binom{n}{k}$$   Thank you.


Source: RMO 2019, question 3  Let $a,b,c$ be positive real numbers such that $a+b+c=1$. Prove that $$\frac{a}{a^2+b^3+c^3}+\frac{b}{b^2+c^3+a^3}+\frac{c}{c^2+a^3+b^3}\leq \frac{1}{5abc}.$$  I tried using Holder's inequality but couldn't get to the desired result.

Let $a,b,c> 0$ be three real numbers such that $a+b+c=1$. I want to prove that   $$\frac{a}{a^2+b^3+c^3}+\frac{b}{b^2+a^3+c^3}+\frac{c}{c^2+a^3+b^3}\le\frac{1}{5abc}.$$  My attempt: Using AM-GM on each denominator gives (here, LHS denotes the left-hand side) $$LHS\le\frac{1}{3a^{\frac12}bc}+\frac{1}{3b^{\frac12}ac}+\frac{1}{3c^{\frac12}ab}.$$  However, I think that my attempt doesn't work because the last expression can get larger than $\frac{1}{5abc}$. In fact, if we multiply with $3abc$ then the original inequality is: $$\sqrt a+\sqrt b+\sqrt c\le\frac35$$  However, as $a,b,c<1$, $$\sqrt a +\sqrt b + \sqrt c> a+b+c=1>\frac35.$$ So my upper bound is always larger than the given one.


I am a novice on this topic. However, I wonder if we use nuclear bombs against the tsunami, will it reduce the speed and impact of the tsunami. Is it possible to break the massive wall of waves using nuclear bombs? In other words, is it possible to create another opposite force which can neutralise/reduce the energy carried by Tsunami by creating an induced wave.

Encouraged by the zeitgeist let me ask the following:  Is it feasible (now or in the future) to build systems a certain distance of a vulnerable coastline which can serve to dampen a tsunami before it reaches the coast itself?  The following picture comes to mind. We have some device which is small enough to be mounted on a buoy. An array of such buoys can be anchored some distance off the coastline, controlled by computers which are linked into the global tsunami warning network. This setup is quite feasible given what a cell phone can do today.  On the detection of an oceanic earthquake or other tsunami generating event (such as a piece of the Rock of Gibraltar falling into the sea) and given present environmental conditions one can calculate the expected path of the tsunami and its intensity. If a TDS (Tsunami Dampening System) of the type I describe above happens to be deployed in range of the tsunami, all relevant information is conveyed to the TDS controllers by the global tsunami warning system. All this happen in a matter of moments.  This leaves plenty of time (25min - 2hr) for the devices in the TDS array to be activated and to do their job. The question in this case would be - what form could such devices take? Perhaps mini-turbines which could dissipate the incoming energy into the ocean by first converting it to electrical energy.  Any such undertaking involves physical estimates for the size and shape of such an array, the precise capabilities of each device, etc. Many of these concerns involve simple physical questions.  Can you come up with the details of such a system or alternatively outline your own design? If you think that this idea would never work in the first place - for technological, physical or some other reasons - please explain what you think would be the prime obstacle and why?


Currently working on an oscilloscope design that would require each channel to be able to take in between 30VPP, -30V to +30V, which will go to an ADC which has a maximum input of 3.3V.  What types of designs or specific circuits could I implement to offset the voltage where 0 is -30V and 3.3V is +30V ?  ALSO - Yes, I will also be implementing a voltage divider, but the ADC cannot take in negative voltage.

I am trying to create a circuit which will allow me to scale and offset a voltage (be it AC or DC) to within the range of the Arduino ADC.  The voltage could be anything between + and - 250V, but I also need to have good sensitivity over lower voltage ranges too.  To this end I am looking at a circuit whereby you can vary the voltage range that it expects the input to be and amplify/attenuate it accordingly.  How I will be making the decision and setting the different gains is for another topic for now.  I am only interested in the scaling and offsetting at the moment.  So far I have come up with this circuit:    Which appears to do just what I want for the +/- 250V range.  I don't know how "safe" this circuit is, and if I am endangering any of the components with the 250V or not.  The graphs at the bottom are (left to right) the input voltage, the power consumption of the bottom 10M resistor, the voltage across the 100M resistor (which is simulating the Arduino ADC input) and the power consumption of the upper 10M resistor.  Now, if I drop the input voltage to just +/- 2.5V and tweak the op-amp feedback resistor accordingly, for some reason the offset voltage the op-amp is adding jumps right up.  I don't know for sure if this is the fault of the simulator I am using, or if it is really what will happen, as I haven't yet breadboarded this circuit (I guess that's the next stage).  This is the output from the 2.5V version:    You can see how the offset has jumped up and the output is clipping massively.  If I drop the lower 10K resistor to the virtual ground offset voltage divider to just 3.3K it compensates, but that's not nice - I would like to just vary the one resistor.    The op-amp is (will be) a 5V single supply rail-to-rail I/O one.  The two diodes are to protect the input of the op-amp against over voltage - I don't know if this circuit strictly needs them, but I guess it doesn't hurt to have them there.  Also, I don't know if the resistor values are quite what I want - I chose them to keep the power consumption right down and the impedance right up.  I don't want them to impact the frequency response of the circuit more than I can help - the input waveform could be anything from DC up to around 500KHz or so, and I need that reproducing at the ADC end as faithfully as I can.  (I know the Arduino can only really sample at lower speeds than that, but the Arduino is just for experimenting - the final system will use a dsPIC with 1.1Msps ADC).  So, what can I do to A) get a more stable offset, B) allow the varying of the input sensitivity without nuking either the op-amp or the ADC, and C) make the circuit safe to connect to, for example, a European mains voltage?


I want to replace my "Show Application" logo with an .ico file, I want it to look like Unity 8. I found the "show-applications-extension-symbolic.svg" in the "/usr/share/icons/gnome/scalable/actions/" and I tried to replace it with my converted ".ico file to .svg". But it seems that it is impossible to convert an .ico file to .svg because they are different types of files.  Can you find a solution for this? This is how Unity 8 DE looks:   Thank you for your time :p  edit: I want to use the file as it is (if possible) but if the solution requires to convert the file, well, it's okay. This is the .ico file in question (it is converted to .png because this website doesn't allow to send .ico files):  ( If you have an svg of this image, please send )

I'm using Ubuntu with GNOME desktop.   I was wondering how to change the "Show Applications" button icon on the dash?


What is the difference between angular velocity and angular frequency and in what reference is it used in SHM?

In the simple harmonic oscillator model, we talk about the angular frequency and I understand that this tells something about the instantaneous angular velocity of the object. For example, a simple pendulum. But what does this mean when we apply this concept to an object attached to a spring that behaves as a simple harmonic oscillator? There is no instantaneous circular motion for the object, so how can we relate the angular frequency to a system like this?


I want to get the cover of a book form its ASIN through Amazon API. I use the ItemLookup function, but I only get the author, manufacturer and the title.  ie :  <ItemAttributes> <Author>Anna Gavalda</Author> <Manufacturer>J'Ai Lu</Manufacturer> <ProductGroup>Book</ProductGroup> <Title>Ensemble, C'Est Tout (French Edition)</Title> </ItemAttributes>

sends an ISBN number to Amazon and gets back a small bit of XML including author, title, and publisher.  However, I also want to get small, medium and large graphic and book descriptions of the title.  Problem: I can find no REST URL examples/documention that work, either at Google or when logged into my "AWS Account" at Amazon Associates.  I find a lot of examples from 2003-2005 but they are all out-of-date and give errors, it seems that Amazon's cloud web services have obfuscated their simple REST API documentation for their books.  Can anyone point me to some documentation on how I can get detailed information about books at Amazon via REST/XML?   Here's what I have tried so .


Which sentence is grammatically correct and WHY?

I saw him crossing the road.   I saw him cross the road.   Which one is correct and why?


My family's flights with AlItalia later this month have of course been affected by Coronavirus. We cannot get refunds, only vouchers are offered, as with basically all airlines at the moment. We booked through an agent, Supersaver.  If I look at the sum we paid (about € 1520), insanely enough only about € 90 of that is for the tickets, and the other € 1430 is for "taxes and fees". Presumably not all the taxes and fees will need to be paid by AlItalia if we don't go on the flight.  For which sum will I get vouchers if I accept them, the ticket price or the price including everything?

My family's flights with AlItalia later this month have of course been affected by Coronavirus. We cannot get refunds, only vouchers are offered, as with basically all airlines at the moment. We booked through an agent, Supersaver. Now in the Netherlands, apparently government decided to allow these vouchers only with a few conditions, see . It includes the condition:  Flight voucher not used? Ask for refund! If you have accepted the flight voucher and you are not able to use it, you are entitled to a full > refund of the ticket price. The airline takes the initiative to repay  Has Italy also published rules for airline vouchers that include a statement on this? Has the EU?


Please, help me understand this statement. The outer product notation for matrices also gives an intuitive input-output relation for them. For instance, the matrix |0⟩ ⟨1| + |1⟩ ⟨0| can be read as "output 0 when given a 1 and output 1 when given a 0".

Quantum algorithms frequently use bra-ket notation in their description. What do all of these brackets and vertical lines mean? For example: $|ψ⟩=α|0⟩+β|1⟩$  While this is arguably a question about mathematics, this type of notation appears to be used frequently when dealing with quantum computation specifically. I'm not sure I have ever seen it used in any other contexts.     Edit  By the last part, I mean that it is possible to denote vectors and inner products using standard notation for linear algebra, and some other fields that use these objects and operators do so without the use of bra-ket notation.   This leads me to conclude that there is some difference/reason why bra-ket is especially handy for denoting quantum algorithms. It is not an assertion of fact, I meant it as an observation. "I'm not sure I have seen it used elsewhere" is not the same statement as "It is not used in any other contexts".


We know that: $$\left(\sum_{k=1}^n k\right)^2 = \sum_{k=1}^n k^3 $$   My question is there other examples that satisfies:  $$\left(\sum_{k=1}^n k\right)^a = \sum_{k=1}^n k^b $$

$f(k) = \sum_{r=1}^{n} r^k$. Find an integer $x$ that solves the equation $f(x) = \bigl(f(1)\bigr)^2$.  Problem credit:   I understand why $x = 3$ is a solution. $1^3 + 2^3 + \dots + n^3 = \left(\frac{n(n + 1)}{2}\right)^2 = (1 + 2 + \dots + n)^2$. But how can we prove that there is no other solution?  Will we have other solutions if $x$ is real? What if $x$ is complex?


If I need to ask someone about their birth order, what question is usually used? Let's say I do not ask how many children his family has first.  What is your birth order? or Which child are you in your family?

I am the third daughter (or son) of my parents.   OR      How should a question that is answered with the above sentences be framed?


I was trying to evaluate the limit of the sum $$\lim_{n\to\infty} \sum_{i=0}^n \frac{1}{_nC_i}$$ My first idea was, since the number of terms grows but the size of each term shrinks as $n \to \infty$, to turn this into an integral, because an integral is basically the same thing. But I'm not quite sure how to turn this into an integral, and I don't even know if it can be done.  Can it be done this way? If so, can I have a hint as to how?  If not, how could I find this limit? Just by observing its values, it seems to approach $2$, but again, I can't figure out how to show that.

How to calculate the sum of sequence $$\frac{1}{\binom{n}{1}}+\frac{1}{\binom{n}{2}}+\frac{1}{\binom{n}{3}}+\cdots+\frac{1}{\binom{n}{n}}=？$$ How about its limit?


I made following functions but it generates errors when I use main functions despite no error without usage of main function  def setup_name():     print("Before we start...","\n"           "What is your name?")     char_name = input("Name : ").strip().capitalize()     return char_name  def intro():     print(cname," is building great walls now")     print()  cname = setup_name() intro()   But below gives me error  def setup_name():     print("Before we start...","\n"           "What is your name?")     char_name = input("Name : ").strip().capitalize()     return char_name  def intro():     print(cname," is building great walls now")     print()  def main():     cname = setup_name()     intro() main()   To me, it seems no difference exist here so I think i need some sharp eyes.  Thanks!

What exactly are the Python scoping rules?  If I have some code:  code1 class Foo:    code2    def spam.....       code3       for code4..:        code5        x()   Where is x found?  Some possible choices include the list below:   In the enclosing source file In the class namespace In the function definition In the for loop index variable Inside the for loop   Also there is the context during execution, when the function spam is passed somewhere else. And maybe  pass a bit differently?  There must be a simple reference or algorithm somewhere.  It's a confusing world for intermediate Python programmers.


I have a web api service that accepts an image (byte[]) as part of the data for the post/create method.  I save the image data in a sql server blob column.  When I use the corresponding get method I see the data as   "ffd8ffe000104a46494600010100000100010000ffdb004300100b0c0e0c0a100e0d0e..." (shortened)  When I look at the bytes of the original image they look just like that (snip from my binary editor):  ![Manual Method[()  I need a way to convert my data into the correct jpg file.  I’ve tried several things but finally had to manually do it.  I didn't include here my attempts at using Image but they were also many and unsuccessful.  There must be a more standard way of doing what I need to do.  For all of these methods I use the same File writing code:  string base64String = Convert.ToBase64String(photoFromDB, Base64FormattingOptions.None); //various methods to convert that to a byte[] tempBytes string DestFilePath = "testManual.jpg"; System.IO.FileStream fs = new System.IO.FileStream(DestFilePath, System.IO.FileMode.Create, System.IO.FileAccess.Write); fs.Write(tempBytes, 0, tempBytes.Length); fs.Close();   Here are my attempts and the outcomes:  ![All Methods[()              //Manual method that works but I don’t like. byte[] tempBytes = new byte[base64String.Length/2]; string tempString; byte tempByte; int count = 0;  for (int i = 0; i < base64String.Length; i = i+2) {     tempString = base64String.Substring(i, 2);     tempByte = Convert.ToByte(tempString, 16);     tempBytes[count++] = tempByte; }  //Unicode convert //I can see my data here but it has extra nulls included.  tempBytes = System.Text.Encoding.Unicode.GetBytes(base64String);    //UTF32 convert //again can see my data but even more nulls included  tempBytes = System.Text.Encoding.UTF32.GetBytes(base64String);   //UTF7, UTF8, and Default, ASCII, BigEndianUnicodegive me the same output //I can see my data but it isn’t correct yet  tempBytes = System.Text.Encoding.UTF7.GetBytes(base64String); tempBytes = System.Text.Encoding.UTF8.GetBytes(base64String); tempBytes = System.Text.Encoding.Default.GetBytes(base64String); tempBytes = System.Text.Encoding.ASCII.GetBytes(base64String); tempBytes = System.Text.Encoding.BigEndianUnicodegive.GetBytes(base64String);   What’s the secret sauce I’m missing?

How can you convert a byte array to a hexadecimal string, and vice versa?


After being through numerous forums available on the net for last 5 days, I am still not able to completely track down the browser close event. My requirement is to generate a popup message, when user tries to close the browser. I have called my javascript function on body 'onbeforeunload' event. And I have hardcoded the conditions to check the mouse-coordinates for the red 'X' buton of browser, refresh, File-close or Alt-F4. My code works fine when browser window is Maximized, but fails if we shrink it after a limit. Please help me, if some body has already found the solution to a similar problem. Thank you. Aggregated Responses of OP ------ Ok, just tell me if it is possible to detect if a user has clicked on the Refresh button of the browser. Also, Refresh can be triggered by Right-click - Refresh or Ctrl-R. My requirement is to make a variable false on Refresh. I am just able to do it on F5, but all other ways are still out of my reach. The same would be applied to Back button.  Hi ppl, Thanks for all who replied at least. I have talked to my seniors regarding this and they have now understood and have compromised with the browser menu buttons. So now my task has become easy. Now, I am using a variable and making it true by default. As, I mentioned earlier I just have to catch the onbeforeunload and popup a message when user tries to leave. The message will not popup when user is navigating to other pages, as I have made the variable as false on all the links of my page using following piece of code: document.onclick = function() {     //To check if user is navigating from the page by clicking on a hyperlink.     if (event.srcElement.tagName == 'A')         blnShowMsg = false; //To not popup the warning message     else         blnShowMsg = true; //To popup the warning message }  In my case still the message is shown when user does Refresh, back or goes to any link in Favorites, etc.  Thanks buddy, but I have already gone through that and didn't find much help there too. My seniors are not happy with that solution as putting a flag on every link of my application is a complicated job and they fear of breaking the application. Any other suggestions would be appreciated. Thanks once again.  Is there no one who can think of a solution here!!! where are all the experts???

When we refresh the page (F5, or icon in browser), it will first trigger ONUNLOAD event. When we close the browser (X on right top icon),It will trigger ONUNLOAD event. Now when ONUNLOAD event is triggered, there is no way to distinguish between refresh the page or close the browser.   If you have any solution then give me.


Take the following SQL sample:  Declare @Table Table (Value int)  Insert Into @Table Select intValueAsVarcharType From OtherTable Where Category = 'Type1'   The OtherTable.intValueAsVarcharType contains a list of nvarchar values, all the records for Category = Type1 are castable to ints. Values for other categories cannot all be casted to ints.  When we run the select (without the insert) we get a list of values that are all numeric ints, as expected.  When we run it with the insert we get the following error:  Conversion failed when converting the nvarchar value 'aaa' to data type int.  Another interesting thing is that if we change the where clause to the below:  Where Category = 'Type1' and intValueAsVarcharType not like '%[^0-9]%'   The select statement returns the exact same result set, but this time the insert also works.  I can guess that this is likely caused by the way SQL optimises the query, and that it probably checks all that the values can be casted to int before it filters the result set.  What I'm not sure about is:   Why exactly does adding the second where condition allow it to work when it doesn't change the result set? It seems to have the same execution plan as the statement without it. What is the best way to resolve this issue properly? Adding the second where clause seems to work but it feels "hacky" and I don't know if it will continue to work under all circumstances

I have a query to insert data from one table into another. One of the source columns is larger than the destination table's, although the actual data selected in the query isn't. So e.g. the source table is varchar(25), the destination table is varchar(10), and the query selects records that do not exceed 10 characters for that specific column.  My initial query failed with a truncation error, but when I rewrote it selecting the same records but changing the where clause i.e. to use WHERE IN and filtering on a cte it ran successfully.  i.e instead of doing  select * from tbl where col1 = 1   I did:  with cte as (select 1) select * from tbl where col1 in (select 1 from cte)   I understand that this is a bug in SQL Server, still I am wondering at which point does SQL Server validate the data for insertion. At which point is the error thrown?


I've a .tex file.  Most of the times, we use pdflatex to convert .tex to required .pdf.  Some times, we use xelatex to convert .tex to required .pdf   These pdfs are editable using various tools; is there any way to disable edit in generated pdf?   Note: I'm looking for non editable PDF (not the one with password)

Is there a package and command that can secure rendered pdf with a password?


\documentclass[12pt,a4paper]{article}     \usepackage[utf8]{inputenc}     \usepackage{amsmath}     \usepackage{amssymb}     \usepackage{setspace}     \usepackage{rotating}     \usepackage{array}     \usepackage{float}     \usepackage{booktabs,tabularx,dcolumn,adjustbox}     \usepackage[font=normal,skip=.333\baselineskip]{caption}     \usepackage[margin=2.5cm]{geometry}     \usepackage[strict]{changepage}     \usepackage{longtable}      \begin{sidewaystable}     \begin{minipage}[H]{\linewidth}         \centering     \begin{tabular}{ |l|m{3.5cm}|m{3.5cm}|m{3.5cm}|m{3.5cm}|m{3.5cm}|}         \hline         \textbf{State/Territory}& \textbf{Type of legislation} &\textbf{Brothels}&\textbf{Escort agencies}&\textbf{Private work}&\textbf{Street work}\\[0.3cm]         \hline\hline         Australian Capital Territory   & Legalization    &license&   license&registration&illegal\\[0.3cm] \hline         New South Wales&   Decriminalization  & legal   & legal& legal& legal$^1$\\[0.3cm]\hline         Northern Territories &Legalization & illegal&  license&  registration&illegal\\[0.3cm]\hline         Queensland    &Legalization & license&  illegal&legal&illegal\\[0.3cm]\hline         South Australia&   Criminalization  & illegal&illegal&legal&illegal\\[0.3cm]\hline         Tasmania&   Criminalization  & illegal&illegal&legal&illegal\\[0.3cm]\hline         Victoria & Legalization    &license&   license&registration&illegal\\[0.3cm]\hline         Western Australia& Criminalization  &illegal&   legal&not specified$^2$&illegal\\[0.3cm]\hline     \end{tabular}     \end{minipage}     \end{sidewaystable}   I am trying to produce a table of text for a paper but I am having issues with the alignment of text inside the cells.   What I am trying to obtain is to have the text exactly in the center of each cell. I tried with tokens c and m but I am not obtaining my ideal result because the text is either centered but up in the cell or on the upper left.  What I am not getting is that it works for column titles but not for the content of the cells as you can see from this partial screenshot    I went around the other questions but all the answers I found do not match my exact need. Does anybody have any hint?

I would like to create a table with some columns' width specified, while the text in those columns should be centered both horizontally and vertically. I found out that  \usepackage{array} \begin{tabular}{| c | c | m{5cm} |}   vertically centers the text in the last column, but justifies it horizontally (like text in normal paragraphs).  Update: With Jake's method, it seems both \\ and \hline cause an error. How to fix it?


When compiling with Makefile, I got error   /tmp/ccQ0q0g5.o:(.eh_frame+0x11): undefined reference to `__gxx_personality_v0' collect2: ld returned 1 exit status   It seems that the some .so or .a files missing, but how can I know which one is missing from such an error report?  Makefile:  CFLAGS = -Iinclude/ CFLAGS += -m32  LDFLAGS = -Llib -llits -lrt -lpthread -Wl,-R,'lib' server:server.cc     gcc -o server $(CFLAGS) $(LDFLAGS) server.cc

I've been getting this undefined symbol building with this command line:  $ gcc test.cpp Undefined symbols:   "___gxx_personality_v0", referenced from:   etc...   test.cpp is simple and should build fine.  What is the deal?


I have been trying to prove that $e^{x} \geq x^{e}$ for all $x \geq 0$.   This is what I have gotten so far:  $$ f(x) = e^{x} \\ g(x) = x^{e} \\  f'(x) = \frac{d(e^{x})}{dx} = e^{x} \\ g'(x) = \frac{d(x^{e})}{dx} = e x^{e-1}\\ $$ Now for all $x \geq 0$, $f'(x) \geq 0$, so $f(x)$ is always increasing or is constant, and $g'(x) \geq 0$ so $g(x)$ is always increasing or is constant.   Thus across the interval $[0,e]$, the lowest $f(x)$ can be is $f(0) = 1$ and the lowest $g(x)$ can be is $g(0) = 0$. The highest possible value of $f(x)$ is $f(e) = e^{e}$ and highest value of $g(x)$ is $g(e) = e^{e}$.   Thus across the interval $[0,e]$, $f(x) \geq g(x)$.   I've got 2 questions. One, is what I did correct. If not, where did I go wrong and what is the right method. Two, if yes, how does one prove it for the interval $(e,\infty)$.

I find it very strange that $$ e^x \geq x^e \, \quad \forall x \in \mathbb{R}^+.$$   I have scratched my head for a long time, but could not find any logical reason. Can anybody explain what is the reason behind the above inequality? I know this is math community, but I'd appreciate a more intuitive explanation than a technical one.


I have the following code, was wondering when Foo's destructor is called.  #include <iostream>  class Foo { public:   Foo() {   }   ~Foo() {     std::cout << "destruct" << std::endl;   } };  void go(Foo f) {   std::cout << "go" << std::endl; }  int main() {   go(Foo());   std::cout << "main" << std::endl;   return 0; }   If I run the code, I got the following output  go destruct main   It shows Foo's destructor is called after go is done. My gcc is 4.8.3.   I had thought the temporary Foo's object should be deleted after it is copied to go's argument. But this is not the case, and only one object of Foo exists. Is this expected or undefined in terms of compiler's implementation?

Does C++ provide a guarantee for the lifetime of a temporary variable that is created within a function call but not used as a parameter?  Here's an example class:  class StringBuffer { public:     StringBuffer(std::string & str) : m_str(str)     {         m_buffer.push_back(0);     }     ~StringBuffer()     {         m_str = &m_buffer[0];     }     char * Size(int maxlength)     {         m_buffer.resize(maxlength + 1, 0);         return &m_buffer[0];     } private:     std::string & m_str;     std::vector<char> m_buffer; };   And here's how you would use it:  // this is from a crusty old API that can't be changed void GetString(char * str, int maxlength);  std::string mystring; GetString(StringBuffer(mystring).Size(MAXLEN), MAXLEN);   When will the destructor for the temporary StringBuffer object get called?  Is it:   Before the call to GetString? After GetString returns? Compiler dependent?   I know that C++ guarantees that a local temporary variable will be valid as long as there's a reference to it - does this apply to parent objects when there's a reference to a member variable?  Thanks.


I have written a programme that reads Windows ETW data from an ETL file produced by the netsh trace utility.  I'm using standard Windows Event Tracing libraries to do this which require that I do some initial setup work, register a callback function (using PEVENT_RECORD_CALLBACK) and then call a function called ProcessTrace(...).  This worked fine as static functions but, for a few reasons, I needed to move the code into a netsh reader class (NetshReader).  I'm having problems defining the callback function.  If I run the example code below I get an Access Violation as soon as the ProcessTrace(...) function is called.  I suspect the problem is that the callback function must be static, but I thought I would check with wiser heads.  Can I define the ProcessTrace(...) callback as a member function?  Thanks in advance...Paul  #pragma once  #include <iostream> #include <windows.h> #include <stdio.h> #include <evntrace.h> #include <tdh.h>  #pragma comment(lib, "tdh.lib")  using namespace std;  class NetshReader { public:     void processNetshTrace();     void WINAPI processFirstPass(PEVENT_RECORD pEvent); };  void WINAPI NetshReader::processFirstPass(PEVENT_RECORD pEvent) {     std::wcout << "In callback function" << std::endl; }  void NetshReader::processNetshTrace() {     std::wstring stemp = L"C:\\traces\\a7-netsh.etl";      EVENT_TRACE_LOGFILE trace;     TRACE_LOGFILE_HEADER* pHeader = &trace.LogfileHeader;     TRACEHANDLE g_hTrace = 0;  // Handle to the trace file that you opened.      ZeroMemory(&trace, sizeof(EVENT_TRACE_LOGFILE));      trace.LogFileName = &stemp[0];      trace.EventRecordCallback = (PEVENT_RECORD_CALLBACK)(&NetshReader::processFirstPass, this);      trace.ProcessTraceMode = PROCESS_TRACE_MODE_EVENT_RECORD;      g_hTrace = OpenTrace(&trace);      if (INVALID_PROCESSTRACE_HANDLE == g_hTrace)         std::wcout << "OpenTrace failed" << std::endl;      ProcessTrace(&g_hTrace, 1, 0, 0); // <<=== Access violation here because tries to                                       //       callback to NetshReader object address                                       //       (i.e. "this") }  int wmain(int argc, wchar_t** argv) {     NetshReader* rdr = new NetshReader();     rdr->processNetshTrace();      return(0); }    The ETL file I have been using for testing is here:

I'm using an API that requires me to pass a function pointer as a callback. I'm trying to use this API from my class but I'm getting compilation errors.   Here is what I did from my constructor:  m_cRedundencyManager->Init(this->RedundencyManagerCallBack);   This doesn't compile - I get the following error:      Error  8 error C3867: 'CLoggersInfra::RedundencyManagerCallBack': function call missing argument list; use '&CLoggersInfra::RedundencyManagerCallBack' to create a pointer to member   I tried the suggestion to use &CLoggersInfra::RedundencyManagerCallBack - didn't work for me.   Any suggestions/explanation for this??  I'm using VS2008.  Thanks!!


However i'm not sure about the result because in another calculation choose B seemed to be the answer.   Am I missing something? Thanks guys

I've got another moment generating function question. I've uploaded the question as a link.   Joint Moment Generating Question:   My Solution: Not exactly sure how to approach this one  Also just another clarification. If the  correlation between random variables X and Y is zero, are X and Y are independent? I do know that if Covariance(X,Y) = 0, X and Y are said to be uncorrelated. But how about for correlation?  Thank you so much for your help guys!! Much appreciated =)


This question was asked in my analysis assignment and I am unable to solve it. i ahev no option except to post here.  Suppose that f(z) is analytic for $|f(z)|\leq 1$ such that |f(z)|<1 for |z|=1 . Show that $f(z)=z^n$ has exactly n solutions in |z|<1.  I am really sorry but I will not be able to provide anything as attempt because I am completely cluless which result I should use. So, I am asking you to just give hints. I would be working on details by myself. Thanks!

Suppose $f: \overline{\mathbb{D}} \to \mathbb{C}$ is continuous, analytic in $\mathbb{D}$ and satisfies $|f(z)|<1$ for $|z|=1$. Find the number of solutions to the equation $f(z) = z^n$ where $n$ is a positive integer. ($\mathbb{D}$ is the unit disk).  Some of my own attempts: Using the Maximum/Minimum Principle, we can split up the the problem in $2$ parts: Suppose $f$ is constant. It then holds that $z^n = c$ has exactly $n$ zeros because of the fundamental theorem of algebra.  Suppose $f$ is not constant. It holds that $f$ has at least one zero  in $\mathbb{D}$. It of course also holds that $z^n$ has a zero of multiplicity $n$ at the origin. I think I'm supposed to hit with stuff like Rouché's theorem, the Argument Principle or Schwartz lemma, but nothing seems to fit.   Thanks in advance.


I' looking for an easy proof of ? I mean I know that the variation must be  $ 0=\delta S = (EULER-LAGRANGE)+ (CONSERVED\, \, \, CURRENT) $  for the case of a particle $q(t)$. I know how to obtain it by I have doubts for the case of fields $ \phi (x) $, any hint? I have checked several books but I cannot find any easy proof of Noether's theorem anywhere; they use too complicated methods.

In the second chapter of Peskin and Schroeder, An Introduction to Quantum Field Theory, it is said that the action is invariant if the Lagrangian density changes by a four-divergence. But if we calculate any change in Lagrangian density we observe that under the conditions of equation of motion being satisfied, it only changes by a four-divergence term.  If ${\cal L}(x) $ changes to $ {\cal L}(x) + \alpha \partial_\mu J^{\mu} (x) $ then action is invariant. But isn't this only in the case of extremization of action to obtain Euler-Lagrange equations.   Comparing this to $ \delta {\cal L}$  $$ \alpha \delta {\cal L} = \frac{\partial {\cal L}}{\partial \phi} (\alpha \delta \phi) + \frac{\partial {\cal L}}{\partial \partial_{\mu}\phi} \partial_{\mu}(\alpha \delta \phi) $$  $$= \alpha \partial_\mu \left(\frac{\partial {\cal L}}{\partial \partial_{\mu}\phi} \delta \phi \right) + \alpha \left[ \frac{\partial {\cal L}}{\partial \phi} - \partial_\mu \left(\frac{\partial {\cal L}}{\partial \partial_{\mu}\phi} \right) \right] \delta \phi.    $$   Getting the second term to zero assuming application of equations of motion. Doesn't this imply that the noether's current itself is zero, rather than its derivative? That is:  $$J^{\mu} (x) =  \frac{\partial {\cal L}}{\partial \partial_{\mu}\phi} \delta \phi .$$  I add that my doubt is why changing ${\cal L}$ by a four divergence term lead to invariance of action globally when that idea itself was derived while extremizing the action which I assume is a local extremization and not a global one.


Can one semi-automate the test execution, say there are certain things that we can`t do using selenium like captcha issue, so is it possible to start the script, perform some task manually and automate others, in the same session or any other approach that solves the same problem.   Example scenario   Login. (Selenium) Captcha. (Take control and solve it yourself, in the same session)  Perform some task. (Selenium) Logout. (Selenium)

I want to achieve some use cases in which:  I want to perform some tasks that require manual intervention before kicking in automation execution. For instance, I need to manually launch the browser, navigate to the desired page, perform some manual tasks like entering captcha manually and then run the automation script to continue from there.  Debugging – Let's say we are working on a test script for a certain page (product checkout) in the application. But the script to reach that page (add to cart) is not ready yet. We can manually launch the browser and navigate to that page and then run the automation script.  Can someone help me to achieve this type of scenario?


I'm learning java I/O for a couple days. I've seen a lot of examples, and some of them are unclear to me. So, I know InputStream is a superclass for its subclasses (FileInputStream, etc), but I don't know how to use its subclasses properly. Usually I use subclasses like: FileInputStream FIS = new FileInputStream("path");  But the unclear thing is many times people use subclasses like: InputStream IS = new FileInputStream("path");  Can anybody explain me what's the difference between using subclasses like this?

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


Should either or both words in "out of" be capitalized (e.g., Bat Out of Hell)?  I wanted to clarify because the "o" is commonly capitalized in any Google search hits.

Are there any concrete rules that say which words (parts of speech) in a title should start with a capital letter? What would be a correct capitalization for the title of this question?


I am trying to capitalize the first letter in each word for my page title in Nuxt.js My current code capitalizes the first word, however I need it to also capitalize the rest.    head() {     return {       title: this.$route.params.models.charAt(0).toUpperCase() + this.$route.params.models.slice(1).split('-').join(' ') + ' | ' + this.title,       meta: [         { hid: 'description', name: 'description', content: '' }       ]     }   }   How would I approach this?

Is there a simple way to convert a string to Title Case? E.g. john smith becomes John Smith. I'm not looking for something complicated like , just (hopefully) some kind of one- or two-liner.


The following code appears in boost graph library manual available .    I have no problem understanding what the code does. My questions are:  (1)Why is the graph object passed as a constant reference. const Graph& g ?  (2)Why is the edge descriptor not passed similarly, but simply by value?  As I understand, the answer to (1) is that it imposes a constraint to ensure that the function is_self_loop() does not modify the object g and also that no copy is made of g within the function.  On the other hand, a copy is indeed made within the function of the edge_descriptor.  Is there any reason to accord these two different reasonings for the two passed objects? The function does not seem to alter e either, so why not pass it as a const and also to prevent a local copy, why not also pass it as a reference? Does this have to do with the sizes of g and e? That is, copying e is not a costly operation? If yes, how can the user figure out which object is "easy" to copy and which object is expensive to copy?

Is it better in C++ to pass by value or pass by constant reference?  I am wondering which is better practice.  I realize that pass by constant reference should provide for better performance in the program because you are not making a copy of the variable.


I'm studying unique factorization domains and I was able to prove that in a UFD if $gcd(a,b)=1$ and $a|bc$ then $a|c$ with the help of the experts here  Now since I'm taking a number theory class too, I've learned this lemma: if $gcd(a,b)=1$ and $a|c$ and $b|c$ then $ab|c$. My question: Does this lemma hold in a UFD too?? If not can you explain why? It sounds natural to work but I don't know how to prove it....

Let $R$ be a $\text{UFD}$, and let $a,b,c \in R$ such that $1=\text{gcd}(a,b).$ Suppose $a |c, \ b|c.$ Could anyone advise me on how to prove $ab |c \ ?$ How do I use the fact that every nonzero non unit $r \in R$ can be expressed as finite product of irreducible elements in $R\ ?$ Hints will suffice.


So I've done some research and found out about the different circadian cycles that use chemical clocks to help us keep time in the long term (hours, days, etc.). This doesn't seem to explain how we can so accurately count seconds. Musicians can count time extremely precisely in even shorter intervals than seconds. Is it a chemical clock responsible? If you could explain the whole process to me it would be great. Thanks.

Im an engineer by education and i program a lot, so the question sounds weird to people from other disciplines.  Im trying to better understand the human biological clock. Yet i do not really know what it is. I read about clock genes, endogenous cycles, and other observed phenomena that is time sensitive or cyclical in nature. But is there a centralized model of what the circadian rhythm is or how itis exhibited within the human body?   For example an electrical clock can be modelled with feedback loops or electrical flip flops that control the timing. Ive seen the heart modelled as Van Der Pol oscillator.  Does modern science have some notion of how the "master" clock within the human body work? Is there a feedback or an oscillator model of the master clock?  Thank you for any articles or keywords that ican use to research this question!


I've got an arcpy.Polyline() object and I have to insert a new vertex in it, which has to be placed on a center of a line. Right now I can calculate the center point coordinates but how to add it to an existing Polyline object in the right place of points order? The existing vertices order should not be changed, so the output line has to have previous vertices plus the new one somehere in the middle.  with arcpy.da.UpdateCursor(line_in,'SHAPE@') as uc:     for row in uc:         Midpoint = row[0].positionAlongLine(0.50,True).firstPoint            mid_p = arcpy.Point(Midpoint.X,Midpoint.Y)   ArcGIS 10.2 has no segmentAlongLine method so is it possible to update line's vertices here?    Due to the suggestion that this question has been already asked I would like to clarify that I don't need a new layer with points. The goal is to add a vertex to existing line.

I have a polyline shapefile (that contains multiple lines) and am trying to create a point at the midpoint of each line using Python. I am currently using the ET Geowizards tool 'PolylineToPoints' which does exactly what I want it to... but I am trying to avoid using ET Geowizards (as it is causing other issues).  Is there a way to do this in Python using Arc tools and functions?


While using random generator i get error with message     Exception in thread "main" java.lang.NullPointerException   i completely don't know why, because a lot of time it working, and then it throw exception. I have feeling like resource of generating doubles just has been exploited. I have a lot of messages on screen "psst" (pMutationChangePc is set to 0.0), and accidently it always finishing in error in first IF statement. Do you guys have some ideas how to resolve this problem, or what could be the problem? Code isn't even hard to read some checking values and printing on screen...  public void Mutation()     {         Random r= new Random();             if (r.nextDouble()<mutation.pMutationChangeStrategy && mutation.pMutationChangeStrategy!=0.0)             {                 char [] tab= {'P','C','D','K'};                 System.out.println("psst");                 this.strategy.buffor=MutationRecurtion(tab, r);             }             if (r.nextDouble()<mutation.pMutationChangePc)             {                 System.out.println("Mutation");                 if (r.nextBoolean()==true)                 {                     System.out.println("boolean");                     this.pOfCoopMax+=mutation.parameterIncMutation;                     this.pOfCoopMin+=mutation.parameterIncMutation;                 }                 else                 {                     this.pOfCoopMax-=mutation.parameterIncMutation;                     this.pOfCoopMin-=mutation.parameterIncMutation;                 }             }        }

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


When I buy fresh herbs from the grocery store they go bad too quickly what can I do to keep them fresher longer?    I just bought a vacuum sealer because I thought it would help preserve my food longer.   Should I seal and freeze or can they be kept in the frig?

What is the best way to store fresh herbs like parsley or cilantro?  I find I have about the same luck with them whether they are left in a plastic bag or I put them in a cup of water.


I need to check if the series is convergent:   $$\sum_{l=2}^\infty{\frac{1}{l^m}}, m  \ge 3$$  On the one hand I think that it has to be divergent because each iteration there will be added something more like the harmonic series.   On the other hand I think it has to be convergent because to some extend the sum value will be so small that it does not matter anymore.

To prove the convergence of the p-series   $$\sum_{n=1}^{\infty} \frac1{n^p}$$  for $p > 1$, one typically appeals to either the Integral Test or the Cauchy Condensation Test.  I am wondering if there is a self-contained proof that this series converges which does not rely on either test.    I suspect that any proof would have to use the ideas behind one of these two tests.


Browsing a StackExchange site's tags in the Android app (Version 1.0.85) appears to be inconsistent.  Clicking on a tag in a question and navigating back will bring the user back to the screen they were on before - which is the expected behavior. Clicking on a tag from the tags view in the action bar, opening a question, and navigating back does not. It brings the user back to the list of tags rather than the results with that tag.   (Gfycat)

This looks a little bit like a variation on  but specific to the tags view.  Reproduction (app version 1.0.71):   Select any site (say Meta) from the sidebar Switch to the tags view using the top bar Choose a tag, any tag ( is nice)   optionaly refine your search with more terms  Go to any question found, go back   you end on the unfiltered tags view  Go back again   lucky you, your search is here


Suppose ${{A_1}}$=[1,3] and ${{A_2}}$=[2,4], then ${{A_1} \cup {A_2}}$=[1,4] now $\sup \left( {{A_1} \cup {A_2}} \right)$ is clearly 4. so, $\sup \left( {{A_1} \cup {A_2}} \right) = \max \left( {\sup {A_1},\sup {A_2}} \right)$ is true.  Confusion with definition:  s is least upper bound for a set $A \subseteq R$ if two criterion are met  (1) s is an upper bound for A (2) if b is any upper bound for A, then $s \le b$  In the proof if I take ${s_1}$ to be ${\sup {A_1}}$ and ${s_2}$ to be ${\sup {A_2}}$, then if I apply definition then least of ${s_1}$ and ${s_2}$ is $\sup \left( {{A_1} \cup {A_2}} \right)$, which is certainly not true. What is exactly am I missing here?  Then once proved how can I extend it to $\sup \left( { \cup _{k = 1}^n{A_k}} \right)$ ? May be if i get clear with the base case then it will not be required. Edit: ${{A_1}}$ and ${{A_2}}$ are nonempty sets which are bounded above.

Let $A,B \subset \mathbb{R}$. Show that $\sup(A \cup B) = \max\{\sup A, \sup B\}$   Here's what I did so far:  Let $\sup A, \sup B$, and $\sup (A \cup B)$ denote upper bounds of $A,B$, and $A \cup B$, respectively. If $x \in A$, then $x \le \sup A$. If $x \in B$, then $x \le \sup B$. In either case, $x \in (A \cup B)$. So either $x \le \sup A$ or $x \le \sup B$. In either case, $x \le \max \{\sup A, \sup B\}$. So $\max \{\sup A, \sup B\}$ is the upper bound of $A \cup B$, which means $\sup (A \cup B) \le \max\{\sup A, \sup B\}$.  I do not know if there's a better way to go at it, but all I did was show the inequality. Can I do this, and show the reverse inequality? If so, how can I go about doing that?


I am a new Ubuntu user.  I would like to copy my Ubuntu system with all the programs and installations that I have made into a USB.  The reason is that I cannot install Ubuntu again in all the other laptops that I have, and redo all the installations, because that would take a lot of time.   Any help would be appreciated. Thank you!

I installed Ubuntu 14.04.1 on one of my laptops and now I want distribute that exact installation to a few of my friends. I tried making an iso with Gparted on a live session but it makes a 500 GB file (I've only used around 8 GB) .   Thanks in Advance !


If space is quantized, does the expansion of space imply that the quanta of space are multiplying?

To explain the expansion of space I have often heard people saying that space is continuously created. This picture is usually applied to cosmological scales but I`m nevertheless curious if some microscopic description of this process could be found (or probably is already available?).  The first thing which comes into my mind by thinking about this is that in theories like loop quantum gravity, there is an idea that space is quantized. Would space expansion then be explained as the creation of new quanta in loop quantum cosmology? Or are there other different ideas, such as the quanta themselves changing properties? Do people actually working on this already have some interesting results?


When trying to visualize a photon, I imagine it as an electromagnetic wave of very short length. Is this accurate?

Consider the question, .  The answers say, "an elementary particle" and not much else. They don't actually answer the question. Moreover, the question is flagged as a duplicate of,  – the answers there don't tell me what a photon is either. Nor do any of the answers to  mentioned in the comments. When I search on , I can't find anything useful. Questions such as,  look promising, but bear no fruit.  say things like, "the photon is an excitation of the photon field." That tells me  nothing. Nor does the , which says:     The photon is the quantum of the electromagnetic four-potential, and therefore the massless bosonic particle associated with the electromagnetic force, commonly also called the 'particle of light'...   I'd say that's less than helpful because it gives the impression that photons are forever popping into existence and flying back and forth exerting force. This same concept is in the  too - but it isn't true. As , "Virtual particles only exist in the mathematics of the model." So, who can tell me what a real photon is, or refer me to some kind of authoritative informative definition that is accepted and trusted by particle physicists? I say all this because I think it's of paramount importance. If we have no clear idea of what a photon actually is, we lack foundation. It's like what :     Photons seem to be one of the foundation ideas of quantum mechanics, so I am concerned that without a clear definition or set of concrete examples, the basis for understanding quantum experiments is a little fuzzy.   I second that, only more so. How can we understand pair production if we don't understand what the photon is? Or the electron? Or the electromagnetic field? Or everything else? It all starts with the photon.   I will give a 400-point bounty to the least-worst answer to the question. One answer will get the bounty, even if I don't like it. And the question is this:    What exactly is a photon?


There's evidence that Ollivander knew that Voldemort and Tom Riddle were the same person. When he gave Harry his wand, he remarked that a similar wand was given to Voldemort, who did 'terrible, but great things'.   However, Voldemort underwent a whole transformation. How did he know that? Only very few people made the connection between the young Tom Riddle and Voldemort, according to Dumbledore.   We do know that Ollivander had a perfect memory regarding wandlore.  Ollivander knew he gave an identical one to eleven-year-old Tom Riddle. Somehow, Ollivander also knew about Voldemort's wand.  It is likely that Ollivander recognized that this wasn't a facsimile wand with the same properties, but actually the same wand. I speculate that this is the way that he deduced that Voldemort and Tom Riddle should also be the same person.  Only, how could Ollivander know about Voldemort's wand in the first place? On what occasion could he have seen that wand?

We know that some people were aware of the fact that Lord Voldemort was Tom Marvolo Riddle prior to his return in Goblet of Fire; at the very least his close soon-to-be-Death-Eater "friends" and Albus Dumbledore:  “Very few people know that Lord Voldemort was once called Tom Riddle. I taught him myself, fifty years ago, at Hogwarts..." ... underwent so many dangerous, magical transformations, that when he resurfaced as Lord Voldemort, he was barely recognizable. Hardly anyone connected Lord Voldemort with the clever, handsome boy who was once Head Boy here.” (Professor Dumbledore to Weasleys, Chamber of Secrets, CHAPTER EIGHTEEN, Dobby’s Reward)  and  “Voldemort,” said Riddle softly, “is my past, present, and future, Harry Potter…” He pulled Harry’s wand from his pocket and began to trace it through the air, writing three shimmering words: TOM MARVOLO RIDDLE Then he waved the wand once, and the letters of his name rearranged themselves: I AM LORD VOLDEMORT “You see?” he whispered. “It was a name I was already using at Hogwarts, to my most intimate friends only, of course. ...  (Tom's Diary manifestation in the Chamber of Secrets).  QUESTION: Who - based on canon (books/interviews/pottermore) - knew about the fact that Lord Voldemort was Tom Marvolo Riddle prior to Ginny being taken to the Chamber of Secrets? Obviously, Albus Dumbledore and Tom himself. Who else?


I am trying to make a gameover scene where in if the player is game over The game will go back to the main or start up then when I press play it will start new game however if i am game over and go back to main and pressed play it will only show me Game over and wont continue my code is..... Gameover code..  #pragma strict import UnityEngine.UI; private var StopGame: boolean=false; private var showGUI: boolean=false; var GUIstop: GameObject; var StopMenu; var respawn : Transform;    private var canvas : Canvas;  function Start() { canvas = GetComponent.<Canvas>(); canvas.enabled = false; }    function Update () {  if(HealthControl.LOVES==0){ Pause();    Application.LoadLevel (0);            }  } public function Pause() { canvas.enabled = !canvas.enabled; Time.timeScale = Time.timeScale == 0 ? 1 : 0; }  public function Quit() { #if UNITY_EDITOR  EditorApplication.isPlaying = false; #else  Application.Quit(); #endif }

When my character died it displays gameover and goes back to main menu, then if I clicked play I can see my character however I can't make it move anymore. Any suggestions?  For game over:  #pragma strict import UnityEngine.UI; private var StopGame: boolean=false; private var showGUI: boolean=false; var GUIstop: GameObject; var StopMenu;  private var canvas : Canvas;  function Awake() {     canvas = GetComponent.<Canvas>();     canvas.enabled = false; }  function Update () {     // If the player has run out of health...     if(HealthControl.LOVES==0)         Pause();     //  } }  public function Pause() {     canvas.enabled = !canvas.enabled;     Time.timeScale = Time.timeScale == 0 ? 1 : 0;     StopGame=true; }  public function Quit() {     #if UNITY_EDITOR      EditorApplication.isPlaying = false;     #else      Application.Quit();     #endif }   For character movement:     function Update () {         transform.rotation.z=0;         if(Input.GetKey(KeyCode.UpArrow)){            transform.position.y+=moveSpeed*Time.deltaTime;        }        else if(Input.GetKey(KeyCode.RightArrow)){            transform.position.x+=moveSpeed*Time.deltaTime;        }


I just thought of something I have no good  way of ruling out in my mind. Say someone is in free-fall, and is meant to, unfortunately, splat on the ground. Due to it accelerating, its speed will be increasing constantly with time. However, by considering two different definitions of Newton's Second Law, $\vec F = m \vec a$, and $\vec F = \dot p$, I seem to find a contradiction with my knowledge. According to the first definition, the force on the person in free-fall is constant (which I would agree with). However, when the person hits the ground, the force that which it imparts on the ground will have to do with its final velocity, I would think. One would say if the person is falling with a force of $50 \ N$ it will apply $50 \ N$ to the ground on impact, but this seems to be the case without considering how long the person was experiencing $50 \ N$ before hitting the ground I've found, or, at least when I've done exercises about these sorts of things. The final speed of the object, its mass, and the time in which the mass comes to a stop should determine the force felt by the ground, not just the force on the person falling. Is my confusion getting through? I feel like when I've considered the force a falling object applies on impact, it's merely the force experienced on the falling object applied to the ground, but I feel like this is misleading - whether the object falls for $1$ second or $10$, the force on it is the same, but its momentum would not. Perhaps this is just an oversimplification of my high school. Am I correct in thinking that the things I've listed are actually the important factors and not just the theoretical force experienced by the free-falling object?

I am trying to calculate the force of impact of a falling object. I did my egg drop project. I dropped the egg from 10m with a mass of 126kg and with the velocity of 14.1 m/s. Which formula should I use to calculate the force of impact? I found the kinetic energy first and later I used the following formula: $W=Fs$ to find the force of impact. Is that the right formula?


Question:  Find the number of series of length-$n$ over $\{0,1,2,3,4\}$ where the difference between any two consecutive members is $1$ or $-1$  Below are my workings. I'm stuck because I don't understand how I can make the recursion.  Let $a_n$ be the number of $n$-length series. Let $a_n^k$ be the number of $n$-length series such that the first element is $k$. We have that $a_n=a_n^0+a_n^1+a_n^2+a_n^3+a_n^4$ If the series starts with $0$, then the next element must be $1$, and we have that $a_n^0=a_{n-1}^1$ If the series starts with $1$, then the next element must be $2$ or $0$, and we have that $a_n^1=a^2_{n-1}+a^0_{n-1}$ If the series starts with $2$, then the next element must be $3$ or $1$, and we have that $a_n^2=a^3_{n-1}+a^1_{n-1}$  There is an similar answer to this but not in the same way that my college requires.

How do I find a recursion formula to solve the following question:  In how many sequences of length $n$, with elements from $\{{0,1,2,3,4}\}$, the difference between every 2 adjacent elements is $1$ or $-1$?  I've been trying to solve the problem for the last 5 hours maybe, I'm sure that I'm missing something..   This is a problem in combinatorics, and the solution must be by finding a recursion formula for the problem.   best solution I've come so far is that if we say that $a_n$ is the solution to the question, so let's count how many sequences of size $n-1$ there are that meet the requirement, and we complete the first element to make it a sequence of $n$ elements. so for $n-1$ there $a_{n-1}$ sequences, and for each sequence we have $2$ options to choose the first element (one option is to take a plus $1$ number from the number that start the $n-1$ sequence, and the other option to to take a minus $1$ number from the number that start the $n-1$ sequence), only problem as you figured out is that if the $n-1$ sequnce starts with $0$ or $4$ there is only $1$ option left for the first element in the sequnce.. so $a_n=2a_{n-1}$ won't work.  I think that the solution may involve using $2$ or maybe $3$ recursion formulas.  Hope I was clear enough.


Can anybody tell me about the with sharing and without sharing of apex class ?  Why we can use it ?  If we are not specify the keyword with sharing or without sharing which keyword set by default for that class ? (With sharing or without sharing)  Thanks.

Per my understanding of With Sharing, Without Sharing and non-sharing-specified Classes in Apex, I would like to jot down the following notes and leave certain blanks for not sure answers; I wanted to know if I were correct/not and clear/not with the following notes.  1) With Sharing keyword implies in another words, "with Security Settings enforced". This again, pertains to only respecting OWDs and Sharing Rules [ What about Object Level Security/OLS and Field Level Security/FLS? ]  2) If a class is declared as "with sharing" then, the sharing settings apply to all code contained in the class, including initialization code, constructors and methods. However, Inner Classes DO NOT inherit sharing settings from the container class.  3) If a class is not declared either with sharing or without sharing, then by default, such a class is executed in system mode, i.e. without sharing mode; and current sharing rules remain in effect- which means that if any other class that has sharing enforced, calls such a non-specified-sharing class, then the called or non-specified-sharing class is executed in "with sharing" mode.  4) If class B extends class A, then all code in class B inherits the same sharing settings that class A has. However, class B's inner classes do not inherit class B's sharing settings.  5) If a with sharing class calls a without sharing class, then the called method(s) will be executed in the mode of the class in which they were defined, in this case, the called method(s) will execute in without sharing mode.   I have written a few example case scenarios, as below, that would summarize the understanding of the above concepts, I would like to learn if I am correct, also willing to know expert advice / suggestions w.r.t each of the below scenarios.  Say I have 3 classes:    public with sharing class A {}  public without sharing class B{} public class C{} // Class C is a non-specified-sharing class.   Now, let's consider the following case scenarios:    class B extends A   // class B's code now executes in class A's mode, i.e. in "with sharing" mode. class B calls class A    // called code will now be executed in the mode of the class in which it was defined, in this case, in class A's mode, i.e. in "with sharing" mode. class C calls class A    // called method's code in class A will execute in class A's mode, i.e. in "with sharing" mode. class C extends class A   // code in class C now executes in the parent class A's mode, i.e. in "with sharing" mode. class A calls C    // code in class C is executed in class C's mode, i.e. in "without sharing" mode although it's sharing settings are unspecified in the class' declaration. class A extends C   // class A's code now executes in the parent class C's mode, i.e. in "without sharing" mode.   I'm not quite sure of the case 6. Besides, I also wanted to know the use cases for which the with sharing and without sharing rules are applied and used. How are the sharing settings applicable in case of Visualforce Controller Classes and/or Controller Extensions.