how can I Put title of figure in the left of the figure as in the attached capture ?
Can anyone tell me how to get my caption on side of my figure, and at the same time aligned with the top of my figure?
How can I implement object oriented programming in Mathematica? Mysterious Windows 7 Autorun Location I have Acer Aspire One A521 with brand new SSD disk, on which I've just installed brand new Windows 7 HE 64. After installing system I installed all drivers, including Conexant audio driver. Starting from that moment, after each system restart I see Windows prompt asking me, if I really want to run application C:\Program Files\CONEXANT\cAudioFilterAgent\cAudioFilterAgent64.exe.  Situation like that is quite normal to me, and I always use some "startup scanner" to find such software and purge system out of it. I have very, very old Startup Control Panel 2.8 by Mike Lin. It can have even ten years, but it has never disappointed me, so I continue using it. It scans Startup folders for current user and common one, HKLM Run, HKCU Run and Run Once sections of Windows Registry. For past ten years I thought that these are all locations where application, that is being autorun during system startup can coexist. Turns out, I was wrong.  Since this is brand new Windows, just installed, its autorun locations are empty. The only entry I do have is ATI graphic card driver manager startup string in HKLM Run. I have checked that fact ten times (but only with above mentioned program and manually) and I'm 100% sure, that in none of known to me autorun locations there are no traces of Conexant program startup string.  What do I miss? Does Windows 7 introduces some new startup location or a new method of autorunning programs, that is beyond, what I know and what Startup Control Panel scans?  Solving this problem is a snap for me. I can use brute-force method of removing manually that file or renaming it or I can uninstall Conexant audio driver at all (for the very, very limited use of audio in my laptop, that I have, Windows driver will for sure be enough, I've installed Conexant one "just in case"). But I'm really, really curious, how Windows is possible to run this program each time I restart it? Where autorun string for it can exists? White regions in DensityPlot — is this a bug with ColorFunctionScaling? Run Metro application on startup? I want to know where the Metro applications (Mail, People, Messages, ...) executable file path is.  Also, how can I run Mail application when my PC starts? What happened to Saruman after he was knifed by Grima? How to customize the Ubuntu Live CD? Proving that a doubly-periodic entire function $f$ is constant. Let $f: \Bbb C \to \Bbb C$ be an entire (analytic on the whole plane) function such that exists $\omega_1,\omega_2 \in \mathbb{S}^1$, linearly independent over $\Bbb R$ such that: $$f(z+\omega_1)=f(z)=f(z+\omega_2), \quad \forall\,z\in \Bbb C.$$Prove that $f$ is constant.   The intuition seems clear to me, we have the three vertices of a triangle given by $0$, $\omega_1$ and $\omega_2$. All points in the plane are one of the vertices of that triangle under a suitable parallel translation. The constant value will be $f(0)$, fine. Throwing values for $z$ there, I have found that $$f(n\omega_1) = f(\omega_1) = f(0)=f(\omega_2) = f(n\omega_2), \quad \forall\, n \in \Bbb Z.$$  I don't know how to improve the above for, say, rationals (at least). Some another ideas would be:   Checking that $f' \equiv 0$. I don't have a clue of how to do that. Write $w = a\omega_1+b\omega_2$, with $a,b \in \Bbb R$, do stuff and conclude that $f(w) = f(0)$. This approach doesn't seem good, because I only have a weak result with integers above. Finding that $f$ coincides with $f(0)$ on a set with an accumulation point. This seems also bad: the set on with $f$ coincides with $f(0)$ by which I found above is discrete.    Nothing works and this is getting annoying... And I don't see how analyticity comes in there. I'll be very thankful if someone can give me an idea.  (On a side note.. I know that this title is not informative at all. Feel free to edit if you come up with something better.) Can't do comparison on PageReference In my page constructor I call a method isFirstPageLoaded, to  check if the loaded page is the first page of the wizard.   private final PageReference FIRSTPAGE = Page.Maintenance_Lock_1;   private void isFirstPageLoaded() {          if(ApexPages.currentPage()!=this.FIRSTPAGE) {              throw new MaintenanceLockException(this.FIRSTPAGE + ' --- ' + ApexPages.currentPage());          }      }   The problem is: Even if I open the first page of the wizard, the exception is thrown. How can I compare two PageReferences? I would like to avoid to parse the URLs and remove parameters etc... Taking advantage of one-time pad key reuse? Suppose Alice wants to send encryptions (under a one-time pad) of $m_1$ and $m_2$ to Bob over a public channel.  Alice and Bob have a shared key $k$; however, both messages are the same length as the key $k$.  Since Alice is extraordinary lazy (and doesn't know about stream ciphers), she decides to just reuse the key.  Alice sends ciphertexts $c_1 = m_1 \oplus k$ and $c_2 = m_2 \oplus k$ to Bob through a public channel.  Unfortunately, Eve intercepts both of these ciphertexts and calculates $c_1 \oplus c_2 = m_1 \oplus m_2$.     What can Eve do with $m_1 \oplus m_2$?     Intuitively, it makes sense that Alice and Bob would not want $m_1 \oplus m_2$ to fall into Eve's hands, but how exactly should Eve continue with her attack? No group of order 400 is simple The documentation for the  function states that you pass it a number, and the positions past the decimal to round. Thus it should do this:  n = 5.59 round(n, 1) # 5.6   But, in actuality, good old floating point weirdness creeps in and you get:  5.5999999999999996   For the purposes of UI, I need to display 5.6. I poked around the Internet and found some  that this is dependent on my implementation of Python. Unfortunately, this occurs on both my Windows dev machine and each Linux server I've tried. .  Short of creating my own round library, is there any way around this? Not every open set in $\mathbb{R}^n$, for $n\geq2$, is a disjoint union of countable open balls. I know that every open set in $\mathbb{R}$ can be decomposed as the union of countably many disjoint open intervals and I'm trying to show that this property no longer holds in higher dimensions. For this I'm trying to show that there is no countable, pairwise disjoint open balls whose union is the open square $(0, 1)^2 ⊂ \mathbb{R}^2$. I know that it is because of the corners, but I don't know how to write this in mathematical terms. Thanks for any help. Write $\frac 11 + \frac12 + ...\frac1{(p-1)} =$ $\frac ab$.Such that $(a,b)=1$. Show that $p^2 \mid a$ $\text{if}$ $p\geq 5$.  I was trying to apply something with prime modulus, but I am unsure how exactly to go about it. Prevent mail being marked as spam This is a  about avoiding outgoing mail being classified as spam.   Also related:                    I'm wondering how to prevent my emails from my site being marked as spam? I'm using sendmail.  I'm trying to send emails through my ruby-on-rails application. The mails are all written in swedish (if that does make a difference?). I don't know why they keep getting marked as spam.  Are there any things that I can do to minimize the risk? How to switch render source (VSE or Camera)? If you create a scene for the Video Sequence Editor and start working on a project Blender will render the output from the VSE. But if you want to later switch it to render your 3D scene again (the camera output) where is the setting to select the source?  Usually I keep a separate .blend for VSE edits so I don't need to switch, but I feel like I ought to learn how to do this as it's pretty basic. I would expect to find this in the Render context but I see no place to specify the source.  Thanks. Can infinitely many primes lie over a prime? What is the difference between call and apply? I'm looking for this really cool music video that involved monsters and kids The video starts off with two kids a boy and a girl—both are speaking Spanish. They wake up and find that not only are their parents gone but also everyone in their town, so they pack up and try to find people.  I know there's a scene where they destroy a car.  When they're traveling they come across a big furry Totoro-like monster in a cave, and the monster is cool. Then it shows us that there's a bunch of kids and they're all running around having a blast and there's also a bunch of other alien looking monsters, but they must be good 'cause they're not attacking anyone.  And that's all I really remember. I've looked everywhere for it and if you can help it would be awesome.  I watched the video 5 or 6 years ago at least. I don't remember any females singing; I'm pretty sure it was a band of guys. It wasn't heavy metal or anything; it was more like pop. I don't remember much about the actual sound of it to be honest. Cauchy Problem for inviscid Burgers' equation Consider the Cauchy Problem of finding $u(x,t)$ such that    $$\frac{\partial u}{\partial t}+u\frac{\partial u}{\partial x}=0,x\in\mathbb{R},t&gt;0$$ $$u(x,0) = u_0(x), x\in\mathbb{R}$$ Which choices of the following functions for   $u_{0}$ yield a $C^{1}$ solution $u(x,t)$ for all   $x\in\mathbb{R},t&gt;0$         $u_{0}(x)=\frac{1}{1+x^{2}}$   $u_{0}(x)=x$   $u_{0}(x)=1+x^{2}$   $u_{0}(x)=1+2x$.      If I use the existence and uniqueness theorem for Cauchy problem i get the corresponding determinant is non zero so all are true according to me. But in answer key only option 2nd and 4th is given. Please help me to solve the problem. Thanks a lot. It confuses/blows my mind that the Binomial has variance proportional to $p(1-p)$. Equivalently, the Fisher information is proportional to $\frac{1}{p(1-p)}$. What is the reason for this? Why is the Fisher Information minimized at $p=0.5$? That is, why is inference most difficult at $p=0.5$?  Context:  I'm working on a sample size calculator, and the formula for $N$, the sample size needed, is an increasing factor of $p(1-p)$, the result of a variance estimation in the derivation.