Thor hammer cannot be lifted by anyone except Thor but in movie Avengers: Age of Ultron, vision lifted the hammer (Mjolnir) of Thor not any other avengers even when all the avengers are strong?
In some scenes in Avengers: Age of Ultron Iron man, War Machine, and Captain America try to lift Thor’s hammer but they end up failing. At some point Vision lifts it easily. How can Vision lift it?
Was Philip K. Dick able to watch a complete version of Blade Runner before his death or just unedited material?  The Blade Runner release date according to  and IMDb was 25 June, 1982. Philip K. Dick died a few months before, on March 2, 1982. How to implement a single instance Java application? Sometime I see many application such as msn, windows media player etc that are single instance applications (when user executes while application is running a new application instance will not created).  In C#, I use Mutex class for this but I don't know how to do this in Java. Can the present perfect continuous construct be used in passive voice? Can the passive voice be used for sentences in the present perfect continuous?  I understand the present perfect and its passive voice (have/has built, has been built). However, the passive voice of present perfect continuous is unclear:   Active: They have been building this house for years. Passive: ???   I have seen suggestions of “This house has been being built for years,” but it sounds awkward and I don't recall anywhere else where two be verbs follow one another. Is this the right form to use? How can I reduce the file size of a scanned PDF file? I have a 72.9MB PDF file that I need to shrink into under 500KB.  The file was a JPEG image that I had scanned, and then converted to pdf. Secure an Ubuntu OpenSSH server from Brute force attacks but without a firewall or SSH key pair? I use Ubuntu 16.04 and seek to harden my SSH authentication in a special manner.  The current situation:  I have a machine with a minimal Ubuntu server I use mainly to transfer files to via its local OpenSSH server. Now, I don't have a firewall on that machine from a few reasons and I also avoid using a key pair hence I use only a password. One of the only ways I have left to defend from brute force attacks, and the one I most desire at the moment, is using a mechanism that blocks a user for X amount of hours, after Y amount of connection tries.  The desired situation:  I wish to have a standalone mechanism (that is, not as part of a firewall) that blocks a user for X amount of hours, after Y amount of connection tries as a way to defend from brute force attacks.  My Question:  Do you know a utility (and specific configuration) that will let me achieve the desired situation? Anthology for children; contains story about friendly Martian on postapocalyptic Earth I'm looking for the title of an anthology of children's science fiction stories from the 1950s. The best of the bunch involved a Martian who visited earth, and realized we'd blown ourselves up in a nuclear war and had fallen into savagery. The Martian is a vegetarian who subsists on biscuits made by a machine he brought with him, and communicates by using one of his tentacles to feed messages direction to/from the brain of the person he's talking to.  Inadvertently left behind by his expedition, he initially befriended some children, and eventually managed to rebuild civilization. Presently he dies, but when another expedition comes a generation later, they find the civilization he rebuilt.  there were other stories, but that was the best one.   If I can't find the name of the book it was in, I'd be happy to settle for the name of the author and the title of the story. "strlen(s1) - strlen(s2)" is never less than zero Right place to ask a "discussion" question (I'm setting up a blog, what should....) Are two (or N) resistors in series more precise than one big resistor? Let's say I have one 2 k&ohm; resistor with 5% tolerance. If I replace it with two 1 k&ohm; resistors with 5% tolerance, will resulting tolerance go up, down, or remain unchanged?  I'm bad with probabilities, and I'm not sure what exactly tolerance says about resistance and its distribution.  I am aware that in the 'worst case' it will be the same; I'm more interested in what will happen on average. Will the chance of getting a more precise value increase if I use a series of resistors (because deviations will cancel each other out)?  On 'intuitive level' I think that it will, but I have no idea how to do the math with probabilities and find out if I'm actually right. Is it possible to prove $g^{|G|}=e$ in all finite groups without talking about cosets? What's the right terminology for Unity's UI elements? I've sent a few mails to the Ayatana mailing list regarding some UI suggestions for Unity, but I'm afraid I keep confusing the right terms for the UI element, so I would like to have some clarification.  Answer Index: Ubuntu16.04 boots into initramfs Ubuntu doesn't boot up and it goes into initramfs. I am writing from a live CD trial session. what should I do?  I understand that the boot flow is broken and that when the files from root are going to be loaded into the ram, it does not find the files in the root directory. Please correct me if I'm wrong.  The following is the output from ashell as I input the "exit" command:  (initramfs) exit /dev/mapper/ubuntu--vg-root contains a file system with errors, check forced. Inodes that were part of a corrupted orphan linked list found.  /dev/mapper/ubuntu-vg-root: UNEXPECTED INCONSISTENCY; Run fsck MANUALLY.     (i.e., without -a or -p options)  fsck exited with status code 4. The root file system on /dev/mapper/ubuntu--vg-root requires manual fsck On-shell and off-shell transformations in Noether's theorem For any transformation of the fields,  $$\varphi\to\varphi'=\varphi+\delta\varphi$$ the change in the Lagrangian can be written as  $$\delta\mathcal L = \text{EoM} + \partial_\mu j^\mu\tag{1}$$where "EoM" represents the equations of motion (Euler-Lagrange equations) and all other terms can be written as a total derivative of some function $j^\mu$, which is a known function in terms of the Lagrangian.   I would like to distinguish the different realizations of transformations. Let's assume that the transformation (1) leaves the action invariant, $\delta S=0$.    $\delta\mathcal L=0$   EoM $=0$, "on-shell": Noether current is conserved, $\partial_\mu j^\mu=0$. EoM $=\partial_\mu b^\mu\neq0$, "off-shell": modified Noether current $J^\mu = j^\mu+b^\mu$ is conserved, $\partial_\mu J^\mu=0$.   $\delta\mathcal L =\partial_\mu a^\mu \neq 0$, "quasi-symmetry"   EoM $=0$, "on-shell": modified Noether current $J^\mu = j^\mu-a^\mu$ is conserved, $\partial_\mu J^\mu=0$.  EoM $=\partial_\mu b^\mu\neq0$, "off-shell": modified Noether current $J^\mu = j^\mu-a^\mu+b^\mu$ is conserved, $\partial_\mu J^\mu=0$.     Is this listing correct?      What roles do the terms "on/off-shell" and "(quasi) symmetry" play in Noether's theorem?   Related: , , , , . How to insert spaces up to column X to line up things in columns? how to hide files from package explorer Too big of a sofa How to split a string in Java Find $x$ such that $(x^2 + 4x + 3)^x + (2x + 4)^x = (x^2 + 4x + 5)^x$ font-not-found error: font "HoeflerText" cannot be found -- LuaLaTex error! I am running this CV/Resume example from :   Here is a relevant fraction of the code:  \documentclass[10pt]{article} %!TEX encoding =  UTF-16 % See geometry.pdf to learn the layout options. There are lots. \usepackage[hmargin=1.25cm, vmargin=1.5cm]{geometry} %symbols - the ones you see on the left of the email and of the phone \usepackage{bbding} \usepackage{amssymb} \usepackage{eurosym} %Colors/Graphics \usepackage{color,graphicx} \usepackage[usenames,dvipsnames]{xcolor}  %Fonts and Tweaks for XeLaTeX \usepackage{fontspec,xltxtra,xunicode} \defaultfontfeatures{Mapping=tex-text} \setromanfont[Mapping=tex-text]{Hoefler Text} ...   So... when compiling with LuaLaTeX (part of MiKTeX on Windwos XP x64), I am getting the following error:  ... luaotfload | Font names database loaded: C:/Documents and Settings/Ampleforth/L ocal Settings/Application Data/MiKTeX/2.9/luatex-cache/generic/names/otfl-names .lua luaotfload | Updating the font names database: luaotfload | Scanning TEXMF and OS fonts... luaotfload | Font names database saved: %s  : C:/Documents and Settings/Ampleforth/Local Settings/Application Data/MiKTeX/2 .9/luatex-cache/generic/names/otfl-names.lua  !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !  ! fontspec error: "font-not-found" !  ! The font "HoeflerText" cannot be found. !  ! See the fontspec documentation for further information. ! For immediate help type H &lt;return&gt;. !...............................................    l.28 \setromanfont[Mapping=tex-text]{Hoefler Text}   What is wrong? How can I install this font so LuaLaTeX is picking it up? Where to download? Any other thoughts about this? In a race there are n horses.In the race more than one horse may get the same position. For example, 2 horses can finish in 3 ways.   Both first horse1 first and horse2 second horse2 first and horse1 second   In how many ways,the race can finish so that a particular horse can never be first.If f(n) is the number of ways, is there any recurrence relation to get f(n).